41 search results - page 1 / 9 » Propositional Satisfiability and Constraint Programming: A c... |
CSUR
2006
13 years 6 months ago
2006
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
JAR
2006
13 years 6 months ago
2006
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
AAAI
2000
13 years 8 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
CP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...