A fixpoint characterization of abductive logic programs

Bancilhon, 1986, Magic Sets and Other Strange Ways to Implement Logic Programs, 1 Bry, 1990, Intensional Updates: Abduction via Deduction, 561 Clark, 1978, Negation as Failure, 293 Console, 1991, On the Relationship between Abduction and Deduction, J. Logic and Computation, 1, 661, 10.1093/logcom/1.5.661 Denecker, 1992, On the Duality of Abduction and Model Generation, 650 Dressler, 1990, Problem Solving with the NM-ATMS, 253 Dung, 1991, Negations as Hypotheses: An Abductive Foundation for Logic Programming, 3 Eshghi, 1989, Abduction Compared with Negation by Failure, 234 Fernandez, 1991, Computing Perfect Models of Disjunctive Stratified Databases Fernandez, 1993, Disjunctive LP + Integrity Constraints = Stable Model Semantics, Annals of Mathematics and Artificial Intelligence, 8, 449, 10.1007/BF01530802 Fujita, 1991, A Model Generation Theorem Prover in KL1 Using a Ramified-Stack Algorithm, 494 Gelfond, 1990, Epistemic Approach to Formalization of Commonsense Reasoning Gelfond, 1988, The Stable Model Semantics for Logic Programming, 1070 Gelfond, 1991, Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365, 10.1007/BF03037169 Inoue, 1992, Linear Resolution for Consequence Finding, Artificial Intelligence, 56, 301, 10.1016/0004-3702(92)90030-2 Inoue, 1994, Hypothetical Reasoning in Logic Programs, J. Logic Programming, 18, 191, 10.1016/0743-1066(94)90043-4 Inoue, 1992, Embedding Negation as Failure into a Model Generation Theorem Prover, 400 Inoue, 1993, Bottom-Up Abduction by Model Generation, 102 Inoue, 1993, Transforming Abductive Logic Programs to Disjunctive Programs, 335 Inoue, 1994, On Positive Occurrences of Negation as Failure, 293 Kakas, 1990, Generalized Stable Models: A Semantics for Abduction, 385 Kakas, 1991, Knowledge Assimilation and Abduction, 54 Kakas, 1992, Abductive Logic Programming, J. Logic and Computation, 2, 719, 10.1093/logcom/2.6.719 Konolige, 1992, Abduction versus Closure in Causal Theories, Artificial Intelligence, 53, 255, 10.1016/0004-3702(92)90073-7 Lloyd, 1984, Making Prolog More Expressive, J. Logic Programming, 3, 225, 10.1016/0743-1066(84)90011-6 Manthey, 1988, SATCHMO: A Theorem Prover Implemented in Prolog, 415 Minker, 1982, On Indefinite Data Bases and the Closed World Assumption, 292 Minker, 1990, A Fixpoint Semantics for Disjunctive Logic Programs, J. Logic Programming, 9, 45, 10.1016/0743-1066(90)90033-2 Poole, 1987, Theorist: A Logical Reasoning System for Defaults and Diagnosis, 331 Preist, 1992, Consistency-Based and Abductive Diagnoses as Generalized Stable Models, 514 Sacca, 1990, Stable Models and Non-Determinism in Logic Programs with Negation, 205 Sakama, 1994, On the Equivalence between Disjunctive and Abductive Logic Programs, 489 Sakama, 1994, An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases, J. Automated Reasoning, 13, 145, 10.1007/BF00881915 Sakama, 1995, Paraconsistent Stable Semantics for Extended Disjunctive Programs, J. Logic and Computation, 5, 265, 10.1093/logcom/5.3.265 Satoh, 1991, Computing Abduction by Using the TMS, 505 Satoh, 1992, A Query Evaluation Method for Abductive Logic Programming, 671 van Emden, 1976, The Semantics of Predicate Logic as a Programming Language, J. ACM, 23, 733, 10.1145/321978.321991