Abducing through negation as failure: stable models within the independent choice logic

The Journal of Logic Programming - Tập 44 - Trang 5-35 - 2000
David Poole1
1Department of Computer Science, University of British Columbia, 2366 Main Hall, Vancouver, BC, Canada V6T 1Z4

Tài liệu tham khảo

Chang, 1973

K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Databases, Plenum Press, New York, 1978, pp. 293–322

Console, 1991, On the relationship between abduction and deduction, Journal of Logic and Computation, 1, 661, 10.1093/logcom/1.5.661

deKleer, 1992, Characterizing diagnoses and systems, Artificial Intelligence, 56, 197, 10.1016/0004-3702(92)90027-U

Kakas, 1993, Abductive logic programming, Journal of Logic and Computation, 2, 719, 10.1093/logcom/2.6.719

Kean, 1990, An incremental method for generating prime implicants/implicates, Journal of Symbolic Computation, 9, 185, 10.1016/S0747-7171(08)80029-6

Marchiori, 1996, Practical methods for proving termination of general logic programs, Journal of Artificial Intelligence Research, 4, 179, 10.1613/jair.198

Pearl, 1988

Poole, 1993, Probabilistic Horn abduction and Bayesian networks, Artificial Intelligence, 64, 81, 10.1016/0004-3702(93)90061-F

Poole, 1994, Representing diagnosis knowledge, Annals of Mathematics and Artificial Intelligence, 11, 33, 10.1007/BF01530736

Przymusinski, 1991, Three-valued nonmonotonic formalisms and semantics of logic programs, Artificial Intelligence, 49, 309, 10.1016/0004-3702(91)90013-A

Shanahan, 1997

J. Von Neumann, O. Morgenstern, Theory of Games and Economic Behavior, third ed., Princeton University Press, Princeton, NJ, 1953