191 search results - page 9 / 39 » Propositional theories are strongly equivalent to logic prog... |
AAAI
1990
13 years 9 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
JAIR
2008
13 years 7 months ago
2008
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...
IJCAI
1989
13 years 9 months ago
1989
It is argued that Ginsberg's Possible Worlds Approach to counterfactual implication suffers from a number of defects which are the result of confusing proof theory and model ...
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...