150 search results - page 19 / 30 » The Stable Models of a Predicate Logic Program |
159
click to vote
WLP
2004
Springer
15 years 10 months ago
2004
Springer
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...
173
click to vote
AGP
2003
IEEE
15 years 10 months ago
2003
IEEE
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 ...
140
Voted
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
165
click to vote
AAAI
2000
15 years 6 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 ...
162
click to vote
NMR
2004
Springer
15 years 10 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...