223 search results - page 4 / 45 » Logic programs with monotone abstract constraint atoms |
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
ADBIS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
ASP
2005
Springer
14 years 27 days ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
AGP
2010
IEEE
13 years 11 months ago
2010
IEEE
