R. Ben-Eliyahu and R. Dechter. Default reasoning using classical logic. Artificial Intelligence, 84(1--2):113--150, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Coherence in Finite Argument Systems - Dunne, Bench-Capon (2001) (Correct)
....by which the relationship between argument systems, propositional formulae, and graph theoretic concepts offers potential for further research. 7 Translations from non classical logics into propositional forms have also been considered in a more general setting in work of Ben Eliyahu and Dechter[1]. 17 ....
R. Ben-Eliyahu and R. Dechter. Default reasoning using classical logic. Artificial Intelligence, 84(1--2):113--150, 1996.
Coherence in Finite Argument Systems - Dunne, Bench-Capon (2001) (Correct)
....by which the relationship between argument systems, propositional formulae, and graph theoretic concepts offers potential for further research. 7 Translations from non classical logics into a propositional forms has also been considered in a more general setting in work of Ben Eliyahu and Dechter[1]. 17 ....
R. Ben-Eliyahu and R. Dechter. Default reasoning using classical logic. Artificial Intelligence, 84(1--2):113--150, 1996.
Extending and Implementing the Stable Model Semantics - Simons, Niemelä, Soininen (2002) (61 citations) (Correct)
....and only if T (P 1 ) T (P 2 ) is satis able. Proposition 4.3 (Niemel a [44] There is no modular mapping from the class of normal logic programs to propositional formulae. Although there is no modular translation of normal logic programs into propositional logic, there are more complex ones [4]. However, these translations are rather complicated and hide much of the structure of the original problem, which makes them cumbersome to use when modeling. Capturing general weight constraints rules seems to be even more non trivial. 5 Basic Constraint Rules In this section we introduce an ....
....program and models that are not stable are removed. As the number of minimal models can be very large compared to the number of stable models and as the minimal models must be stored, we conclude that this approach is very inecient. Since a logic program can be encoded as a satis ability problem [4] and since a satis ability problem can easily be encoded as an integer linear program, it is possible to compute the stable models of a logic program using only one integer linear program. However, it would hardly be reasonable to actually utilize such a complex encoding. The Modi ed Davis Putnam ....
R. Ben-Eliyahu and R. Dechter. Default reasoning using classical logic. Articial Intelligence, 84:113-150, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC