Circumscribing embedded implications (without stratifications)

Aho, 1979, Universality of Data Retrieval Languages, Proceedings of the Sixth ACM Symposium on Principles of Programming Languages, 110, 10.1145/567752.567763 Anderson, 1975 Apt, 1988, Towards a Theory of Declarative Knowledge, 89 Apt, 1982, Contributions to the Theory of Logic Programming, J. ACM, 29, 841, 10.1145/322326.322339 Bollen, 1991, Relevant Logic Programming, J. Automated Reasoning, 7, 563, 10.1007/BF01880329 Bonner, 1988, Hypothetical Datalog: Complexity and Expressibility, Vol. 326, 144 Bonner, 1988, A Logic for Hypothetical Reasoning, Proceedings of the Seventh National Conference on Artificial Intelligence, 480 Bonner, 1989, Hypothetical Datalog: Negation and Linear Recursion, Proceedings of the ACM Symposium on the Principles of Database Systems, 286 Bonner, 1990, Adding Negation-as-Failure to Intuitionistic Logic Programming, Proceedings of the North American Conference on Logic Programming, 681 Bonner, 1989, Expressing Database Queries with Intuitionistic Logic, Proceedings of the North American Conference on Logic Programming, 831 Chandra, 1982, Structure and Complexity of Relational Queries, J. Comput. System Sci., 25, 99, 10.1016/0022-0000(82)90012-5 Clark, 1978, Negation as Failure, 293 Dung, 1990, On the Strong Completion of Logic Programs, Vol. 463, 158 Dung, 1990, Strong Circumscription Specifies the Stable Semantics of Logic Programs, Proceedings of the European Conference on Artificial Intelligence Dunn, 1986, Relevance Logic and Entailment, Vol. III, 117 Elkan, 1988, Automated Inductive Reasoning about Logic Programs, Proceedings of the Fifth International Conference and Symposium on Logic Programming, 876 Fitting, 1969 Gabbay, 1985, N-PROLOG: An Extension of PROLOG with Hypothetical Implication, II. Logical Foundations and Negation as Failure, J. Logic Programming, 2, 251, 10.1016/S0743-1066(85)80003-0 Gabbay, 1984, N-PROLOG: An Extension of PROLOG with Hypothetical Implications, I, J. Logic Programming, 1, 319, 10.1016/0743-1066(84)90029-3 Gelfond, 1988, The Stable Model Semantics for Logic Programming, Proceedings of the Fifth International Conference and Symposium on Logic Programming, 1070 Girard, 1987, Linear Logic, Theoret. Comput. Sci., 50, 1, 10.1016/0304-3975(87)90045-4 Goguen, 1986, EQLOG: Equality, Types, and Generic Modules for Logic Programming, 295 Hallnäss, 1990, A Proof-Theoretic Approach to Logic Programming: I. Clauses as Rules, J. Logic and Comput., 1, 261, 10.1093/logcom/1.2.261 Hallnäss, 1991, A Proof-Theoretic Approach to Logic Programming: II. Programs as Definitions, J. Logic and Comput., 1, 635, 10.1093/logcom/1.5.635 Hodas, 1991, Logic Programming in a Fragment of Intuitionistic Linear Logic (Extended Abstract), Proceedings of the Sixth Annual Symposium on Logic in Computer Science, 32, 10.1109/LICS.1991.151628 Johansson, 1937, Der Minimalkalkül, ein Reduzierter Intuitionistischer Formalismus, Compositio Math., 4, 119 Kanamori, 1986, Formulation of Induction Formulas in Verification of PROLOG Programs, Proceedings of the Eight International Conference on Automated Deduction, 281, 10.1007/3-540-16780-3_97 Kripke, 1965, Semantical Analysis of Intuitionistic Logic, I, 92 Lifschitz, 1985, Computing Circumscription, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, 121 Lifschitz, 1988, On the Declarative Semantics of Logic Programs with Negation, 177 Lin, 1991, A Study of Nonmonotonic Reasoning Makowsky, 1985, Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples, Vol. 185, 374 McCarthy, 1980, Circumscription: A Form of Non-Monotonic Reasoning, Artificial Intelligence, 13, 27, 10.1016/0004-3702(80)90011-9 McCarthy, 1986, Applications of Circumscription to Formalizing Common-Sense Knowledge, Artificial Intelligence, 28, 89, 10.1016/0004-3702(86)90032-9 McCarthy, 1988, Clausal Intuitionistic Logic I. Fixed-Point Semantics, J. Logic Programming, 5, 1, 10.1016/0743-1066(88)90005-2 McCarty, 1988, Clausal Intuitionistic Logic. II. Tableau Proof Procedures, J. Logic Programming, 5, 93, 10.1016/0743-1066(88)90014-3 McCarty, 1989, A Language for Legal Discourse. I. Basic Features, 180 McCarty, 1991, Circumscribing Embedded Implications, 211 McCarty, 1993, Computing with Prototypes McCarty, 1993, Proving Inductive Properties of PROLOG Programs in Second-Order Intuitionistic Logic, 44 McCarty, 1991, Indefinite Reasoning with Definite Rules, Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 890 McCarty, 1992, Reasoning about Indefinite Actions, 59 McCarty, 1993, An Intuitionistic Interpretation of Finite and Infinite Failure, 417 Miller, 1989, A Logical Analysis of Modules in Logic Programming, J. Logic Programming, 6, 79, 10.1016/0743-1066(89)90031-9 Miller, 1989, Lexical Scoping as Universal Quantification, Proceedings of the Sixth International Conference on Logic Programming, 268 Nadathur, 1988, An Overview of ΛPROLOG, Proceedings of the Fifth International Conference and Symposium on Logic Programming, 810 Pareschi, 1988, A Definite Clause Version of Categorial Grammar, Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics, 270, 10.3115/982023.982056 Przymusinski, 1988, On the Declarative Semantics of Stratified Deductive Databases and Logic Programming, 193 Reiter, 1982, Circumscription Implies Predicate Completion (Sometimes), Proceedings of the Second National Conference on Artificial Intelligence, 418 Schroeder-Heister, 1990, Hypothetical Reasoning and Definitional Reflection in Logic Programming, Vol. 475, 327 Tarski, 1955, A Lattice-Theoretical Fixpoint Theorem and Its Applications, Pacific J. Math., 5, 285, 10.2140/pjm.1955.5.285 Troelstra, 1988 Urquhart, 1972, Semantics for Relevant Logics, J. Symbolic Logic, 37, 159, 10.2307/2272559 van, 1990, Recursively Indefinite Databases, Proceedings of the International Conference on Database Theory van, 1976, The Semantics of Predicate Logic as a Programming Language, J. ACM., 23, 733, 10.1145/321978.321991 Van, 1989, The Alternating Fixpoint of Logic Programs with Negation, Proceedings of the Eight ACM Symposium on the Principles of Database Systems, 1 Van, 1991, The Well-Founded Semantics for General Logic Programs, J. ACM, 38, 620