764 search results - page 4 / 153 » On the Expressibility of Stable Logic Programming |
101
click to vote
JELIA
2000
Springer
15 years 3 months ago
2000
Springer
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
114
click to vote
CORR
1998
Springer
14 years 11 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
105
click to vote
AMAI
2006
Springer
14 years 11 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...
LFCS
2007
Springer
15 years 5 months ago
2007
Springer
Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of mode...
117
click to vote
AGP
2003
IEEE
15 years 4 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 ...