19 search results - page 2 / 4 » A Purely Model-Theoretic Semantics for Disjunctive Logic Pro... |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
LPNMR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
ASIAN
1999
Springer
13 years 11 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
IJCAI
2007
13 years 8 months ago
2007
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...
KR
2004
Springer
14 years 14 days ago
2004
Springer
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...