60 search results - page 2 / 12 » Loop Formulas for Circumscription |
IJCAI
2007
13 years 6 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...
AMAI
2006
Springer
13 years 5 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
AAAI
2008
13 years 7 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...