Sciweavers

223 search results - page 26 / 45
» Logic programs with monotone abstract constraint atoms
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 8 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CADE
2009
Springer
14 years 9 months ago
Decidability Results for Saturation-Based Model Building
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
Matthias Horbach, Christoph Weidenbach
ICLP
2010
Springer
14 years 11 days ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian
SUM
2010
Springer
13 years 6 months ago
Cost-Based Query Answering in Action Probabilistic Logic Programs
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...
FOSSACS
2007
Springer
14 years 2 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard