Sciweavers

314 search results - page 8 / 63
» Compactness Properties for Stable Semantics of Logic Program...
Sort
View
IJCAI
2007
14 years 10 months ago
A New Perspective on Stable Models
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
JLP
2000
134views more  JLP 2000»
14 years 9 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
ICLP
2005
Springer
15 years 2 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
Emad Saad, Enrico Pontelli
LPKR
1997
Springer
15 years 1 months ago
Disjunctive Logic Programming and Autoepistemic Logic
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...
Li-Yan Yuan, Jia-Huai You, Randy Goebel
AGP
2003
IEEE
15 years 2 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