1179 search results - page 108 / 236 » Programming in Hybrid Constraint Languages |
162
click to vote
CPAIOR
2010
Springer
14 years 11 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
103
click to vote
ICLP
2004
Springer
15 years 6 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
103
click to vote
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
113
click to vote
PPDP
2004
Springer
15 years 6 months ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
120
click to vote
CHARME
2003
Springer
15 years 6 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...