Sciweavers

8132 search results - page 387 / 1627
» Dependability, Abstraction, and Programming
Sort
View
SUM
2007
Springer
16 years 1 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
VMCAI
2007
Springer
16 years 1 months ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif
CP
2005
Springer
16 years 12 days ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CC
2004
Springer
142views System Software» more  CC 2004»
16 years 8 days ago
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
Philippe Clauss, Irina Tchoupaeva
CICLING
2004
Springer
16 years 8 days ago
Towards Programming in Everyday Language: A Case for Email Management
Abstract. In order to extend the application domain of natural language interfaces to more realistic tasks without the decrease of user’s performance, it is desirable for users t...
Toru Sugimoto, Noriko Ito, Shino Iwashita, Michio ...