Sciweavers

622 search results - page 2 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
AGP
2003
IEEE
13 years 10 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
WLP
2004
Springer
13 years 10 months ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
Misa Keinänen, Ilkka Niemelä
ICLP
2003
Springer
13 years 10 months ago
Computing Minimal Models, Stable Models, and Answer Sets
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
Zbigniew Lonc, Miroslaw Truszczynski
FOIKS
2008
Springer
13 years 6 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
LPNMR
2005
Springer
13 years 10 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir