834 search results - page 4 / 167 » Computing Minimal Models, Stable Models, and Answer Sets |
183
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
148
click to vote
SUM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
154
click to vote
AAAI
2000
15 years 5 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 ...
170
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
163
click to vote
AI
2011
Springer
14 years 11 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...