{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:26:59Z","timestamp":1672691219377},"reference-count":138,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01530759","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T03:03:26Z","timestamp":1113879806000},"page":"1-24","source":"Crossref","is-referenced-by-count":35,"title":["Overview of disjunctive logic programming"],"prefix":"10.1007","volume":"12","author":[{"given":"Jack","family":"Minker","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"574","volume-title":"Proc. Joint Int. Conf. and Symp. on Logic Programming","author":"J.J. Alferes","year":"1992","unstructured":"J.J. Alferes and L.M. Pereira, On logic program semantics with two kinds of negation, in:Proc. Joint Int. Conf. and Symp. on Logic Programming, ed. K. Apt, Washington, DC, USA, 1992 (The MIT Press) pp. 574?588."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K.R. Apt","year":"1988","unstructured":"K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufman, Washington, 1988) pp. 89?148."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19\/20","author":"K.R. Apt","year":"1994","unstructured":"K.R. Apt and R.N. Bol, Logic programming and negation: A survey, J. Logic Prog. 19\/20 (1994) 9?71.","journal-title":"J. Logic Prog."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"K.R. Apt, Logic programming, in:Handbook of Theoretical Computer Science, Vol. B, ed. J. van Leeuwen (Elsevier, 1990) pp. 493?574.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. van Emden, Contributions to the theory of logic programming, J. ACM 29(3) (1982) 841?862.","journal-title":"J. ACM"},{"key":"CR6","volume-title":"Ph.D. Thesis","author":"C. Baral","year":"1991","unstructured":"C. Baral, Issues in knowledge representation: Semantics and Knowledge Combination, Ph.D. Thesis, University of Maryland, College Park, MD 20742 (1991); also University of Maryland Technical Report CS-TR-2761, UMIACS TR-91-129."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"C. Baral, J. Lobo and J. Minker, Generalized disjunctive well-founded semantics for logic programs: Declarative semantics, in:Proc. 5th Int. Symp. on Methodologies for Intelligent Systems, eds. Z. Ras, M. Zemankova and M.L. Emrich (Knoxville, TN, October 1990) pp. 465?473.","DOI":"10.21236\/ADA232064"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"C. Baral, J. Lobo and J. Minker, Generalized disjunctive well-founded semantics for logic programs: Procedural semantics, in:Proc. 5th Int. Symp. on Methodologies for Intelligent Systems, eds. Z. Ras, M. Zemankova and M.L. Emrich, Knoxville, TN 1990, pp. 456?464.","DOI":"10.21236\/ADA232064"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/3-540-52885-7_82","volume-title":"Proc. 10th Int. Conf. on Automated Deduction","author":"C. Baral","year":"1990","unstructured":"C. Baral, J. Lobo and J. Minker, Generalized well-founded semantics for logic programs,Proc. 10th Int. Conf. on Automated Deduction, ed. M.E. Stickle, Kaiserslautern, FRG, 1990 (Springer) pp. 102?116."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"C. Baral, J. Lobo and J. Minker, WF3: A semantics for negation in normal disjunctive logic programs, in:Proc. 6th Int. Symp. on Methodologies for Intelligent Systems, Charlotte, NC, 1991.","DOI":"10.1007\/3-540-54563-8_109"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","volume":"19\/20","author":"C. Baral","year":"1994","unstructured":"C. Baral and M. Gelfond, Logic programming and knowledge representation, J. Logic Progr. 19\/20 (1994) 73?148.","journal-title":"J. Logic Progr."},{"key":"CR12","unstructured":"C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian, Mixed integer programming methods for computing non-monotonic deductive databases. Also Technical Report CS-TR-2801, University of Maryland (1991), to appear in J. ACM."},{"key":"CR13","volume-title":"Technical Report R-163","author":"R. Ben-Eliyahu","year":"1992","unstructured":"R. Ben-Eliyahu and R. Dechter, Propositional semantics for default logic, Technical Report R-163, Cognitive Science Lab., Computer Science Dept., Univ. of California at Los Angeles, USA (1992). Also presented at the4th Int. Workshop on Non-monotonic Reasoning, Vermont, 1992. Notes edited by H. Kautz and D.W. Etherington."},{"key":"CR14","first-page":"379","volume-title":"Proc. Joint Int. Conf. and Symp. on Logic Programming","author":"R. Ben-Eliyahu","year":"1992","unstructured":"R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programming. in: K. Apt, editor,Proc. Joint Int. Conf. and Symp. on Logic Programming, ed. K. Apt, Washington, DC, USA, 1992 (MIT Press) pp. 379?385. Full paper appears in [15]."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs. Ann. Math. and AI, this issue.","DOI":"10.1007\/BF01530761"},{"key":"CR16","unstructured":"A. Borgida and D.W. Etherington, Hierarchical knowledge bases and efficient disjunctive reasoning, in:Proc. 1st Int. Conf. on Knowledge Representation and Reasoning (1989) pp. 33?43."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","volume":"25","author":"G. Bossu","year":"1985","unstructured":"G. Bossu and P. Siegel, Saturation, nonmonotonic reasoning and the closed-world assumption, Artificial Intelligence 25 (1985) 13?63.","journal-title":"Artificial Intelligence"},{"key":"CR18","volume-title":"Ph.D. Thesis","author":"M. Cadoli","year":"1993","unstructured":"M. Cadoli, Two methods for tractable reasoning in artificial intelligence: Language restriction and theory approximation, Ph.D. Thesis, Universit\u00e0 di Roma ?La Sapienza?, Via Salaria 113, 00198 Roma, Italy (1993)."},{"key":"CR19","unstructured":"M. Cadoli and M. Lenzerini, The complexity of closed world reasoning and circumscription, in:Proc. AAAI, 1990, pp. 550?555. Also Technical Report, Universit\u00e0 di Roma ?La Sapienza?, via Salaria 113, 00198 Roma, Italy."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0743-1066(93)90029-G","volume":"17","author":"M. Cadoli","year":"1993","unstructured":"M. Cadoli and M. Schaerf, A survey on complexity results for non-monotonic logics, J. Logic Progr. 17(2?4) (1993).","journal-title":"J. Logic Progr."},{"key":"CR21","volume-title":"A possible world semantics for non-Horn databases","author":"E. Chan","year":"1989","unstructured":"E. Chan, A possible world semantics for non-Horn databases (University of Waterloo, Canada, 1989)."},{"issue":"2?4","key":"CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-1066(93)90034-E","volume":"17","author":"W. Chen","year":"1993","unstructured":"W. Chen and D.S. Warren, A goal-oriented approach to compute the well-founded semantics,J. Logic Progr. 17(2?4) (1993) 279?300.","journal-title":"J. Logic Progr"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"S. Chi and L.J. Henschen, Recursive query answering with non-Horn clauses, in:Proc. 9th Int. Conf. on Automated Deduction, eds. E.L. Lusk and R.A. Overbeek, Argonne, IL, 1988, pp. 294?312.","DOI":"10.1007\/BFb0012838"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(90)90012-M","volume":"34","author":"J. Chomicki","year":"1990","unstructured":"J. Chomicki and V.S. Subrahmanian, Generalized closed world assumption is ? 2 0 complete, Inform. Processing Lett., 34 (1990) 281?292.","journal-title":"Inform. Processing Lett."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark, Negation as failure, in:Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum, New York, 1978) pp. 293?322."},{"key":"CR26","unstructured":"H. Decker, On alternative models, fixpoints and consistency of disjunctive databases, Siemens Corp. Technical Report (1991)."},{"key":"CR27","unstructured":"H. Decker, On the declarative, operational and procedural semantics of disjunctive computational theories, in:Proc. 2nd Int. Workshop on the Deductive Approach to Information Systems and Databases, Aiguablava, Spain, 1991 (invited paper)."},{"key":"CR28","unstructured":"R. Demolombe, An efficient strategy for non-Horn deductive data bases (1988), Extended version of ref. [29]. CERT Technical Report, Toulouse, France."},{"key":"CR29","first-page":"325","volume-title":"Information Processing 89","author":"R. Demolombe","year":"1989","unstructured":"R. Demolombe, An efficient strategy for non-Horn deductive data bases, in:Information Processing 89, ed. G.X. Deiter (Elsevier, Amsterdam, 1989) pp. 325?330."},{"key":"CR30","unstructured":"J. Dix, Classifying semantics of logic programs, in: Logic Programming and Non-monotonic Reasoning:Proc. 1st Int. Workshop, eds. A. Nerode, W. Marek and V.S. Subrahmanian (MIT Press, 1991) pp. 166?180."},{"key":"CR31","unstructured":"J. Dix, Semantics of logic programs: Their intuitions and formal properties. An overview, to appear in Logic, Action and Informaticae (1994)."},{"key":"CR32","unstructured":"J. Dix, G. Gottlob and V. Marek. Causal models of disjunctive logic programs, in:Proc. 11th Int. Conf. on Logic Programming, ed. P. Van Hentenryck (The MIT Press, 1994) pp. 290?302."},{"key":"CR33","unstructured":"J. Dix and M. M\u00fcller, An axiomatic approach to semantics of disjunctive programs, in:Proc. 11th Int. Conf. on Logic Programming, ed. P. Van Hentenryck (The MIT Press, 1994) pp. 303?320."},{"key":"CR34","unstructured":"P.M. Dung and K. Kanchanasut, On generalized predicate completion of non-Horn programs, in:North American Conf. in Logic Programming (Cleveland, 1989) pp. 587?603."},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"P.M. Dung and N.H. Liem, Negation as failure for disjunctive logic programming, Ann. Math. and AI, this issue.","DOI":"10.1007\/BF01530760"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"T. Eiter and G. Gottlob, On the complexity of logic-based abduction, in:Proc. 10th Symp. on Theoretical Aspects of Computer Science (STACS-93) (LNCS Springer-Verlag, 1993).","DOI":"10.1007\/3-540-56503-5_10"},{"key":"CR37","volume-title":"Technical Report CD-TR 91\/20","author":"T. Eiter","year":"1993","unstructured":"T. Eiter and G. Gottlob, Propositional circumscription and extended closed world reasoning are ? 2 p -complete, Technical Report CD-TR 91\/20, Christian Doppler Labor F\u00fcr Expertensysteme Technische Universit\u00e4t Wien, Vienna, Austria (1993), to appear in Theor. Comp. Sci."},{"key":"CR38","volume-title":"Ph.D. Thesis","author":"J.A. Fern\u00e1ndez","year":"1994","unstructured":"J.A. Fern\u00e1ndez, Disjunctive deductive databases. Ph.D. Thesis, Dept. of Computer Science, Univ. of Maryland, College Park, MD 20742. USA (1994), TR CS-TR-3208 UMIACS-TR-94-6."},{"key":"CR39","unstructured":"J.A. Fern\u00e1ndez and J. Lobo, A proof procedure for stable theories, submitted to J. Logic Progr. (1993)."},{"key":"CR40","first-page":"660","volume-title":"Proc. Int. Conf. on Logic Programming","author":"J.A. Fern\u00e1ndez","year":"1991","unstructured":"J.A. Fern\u00e1ndez and J. Minker, Bottom-up evaluation on disjunctive databases, in:Proc. Int. Conf. on Logic Programming, ed. K. Furukawa (MIT Press, Cambridge, MA, 1991) pp. 660?675."},{"key":"CR41","first-page":"5","volume":"3","author":"J.A. Fern\u00e1ndez","year":"1993","unstructured":"J.A. Fern\u00e1ndez and J. Minker, Theory and algorithms for disjunctive deductive databases, Programmirovanie 3 (1993) 5?39 (in Russian) Invited Paper by the Academy of Sciences of Russia, (in English) University of Maryland Department of Computer Science CS-TR-3223 and UMIACS-TR-94-17 (1994).","journal-title":"Programmirovanie"},{"key":"CR42","first-page":"449","volume":"8","author":"J.A. Fern\u00e1ndez","year":"1993","unstructured":"J.A. Fern\u00e1ndez, J. Lobo, J. Minker and V.S. Subrahmanian, Disjunctive LP+integrity constraints=stable model semantics, Ann. Math. and AI 8 (1993) 449?474.","journal-title":"Ann. Math. and AI"},{"key":"CR43","unstructured":"J.A. Fern\u00e1ndez, Z.A. Khandakar and J. Minker, A tractable class of disjunctive deductive databases, in:Proc. Workshop on Deductive Databases, Joint Int. Conf. and Symp. on Logic Programming (JICSLP'92), Washington, DC, 1992."},{"key":"CR44","doi-asserted-by":"crossref","unstructured":"J.A. Fern\u00e1ndez and J. Minker, Semantics of disjunctive deductive databases, in:Int. Conf. on Database Theory: Lecture Notes in Computer Science 646 (Springer-Verlag, 1992) pp. 21?50.","DOI":"10.1007\/3-540-56039-4_31"},{"key":"CR45","unstructured":"J.A. Fern\u00e1ndez and J. Minker, Bottom-up computation of perfect models for disjunctive theories, J. Logic Prog. (1993) submitted. Preliminary version presented at the ILPS'91 Workshop on Disjunctive Logic Programs, San Diego, California."},{"key":"CR46","unstructured":"M.C. Fitting and M. Ben-Jacob, Stratified and three-valued logic programming semantics, in:Proc. 5th Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, WA, 1988, pp. 1054?1069."},{"key":"CR47","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0743-1066(85)80003-0","volume":"4","author":"D.M. Gabbay","year":"1985","unstructured":"D.M. Gabbay, N-PROLOG: an extension of PROLOG with hypothetical implication, Part 2, J. Logic Progr. 4 (1985) 251?283.","journal-title":"J. Logic Progr."},{"key":"CR48","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","volume":"4","author":"D.M. Gabbay","year":"1984","unstructured":"D.M. Gabbay and U. Reyle, N-PROLOG: an extension of PROLOG with hypothetical implication, Part 1, J. Logic Progr. 4 (1984) 319?355.","journal-title":"J. Logic Progr."},{"key":"CR49","doi-asserted-by":"crossref","unstructured":"M. Gelfond, Logic programming and reasoning with incomplete information, Ann. Math. and AI, this issue.","DOI":"10.1007\/BF01530762"},{"key":"CR50","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Comp. 9 (1991) 365?385.","journal-title":"New Generation Comp."},{"key":"CR51","first-page":"1070","volume-title":"Proc. 5th Logic Programming Symp","author":"M. Gelfond","year":"1988","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in:Proc. 5th Logic Programming Symp. (Ass. Logic Programming, MIT Press, Cambridge, MA, 1988) pp. 1070?1080."},{"key":"CR52","first-page":"579","volume-title":"Logic Programming:Proc. 7th Int. Conf.","author":"M. Gelfond","year":"1990","unstructured":"M. Gelfond and V. Lifschitz, Logic programs with classical negation, in: Logic Programming:Proc. 7th Int. Conf., eds. D.H.D. Warren and P. Szeredi (MIT Press, Cambridge, MA, 1990) pp. 579?597."},{"key":"CR53","unstructured":"M. Gelfond, H. Przymusi?ska and T.C. Przymusinski, The extended closed world assumption and its relation to parallel circumscription,Proc. 5th ACM SIGACT-SIGMOID Symp. on Principle of Database Systems (1986) pp. 133?139."},{"key":"CR54","unstructured":"M. Gelfond, V. Lifschitz, H. Przymusi?ska and M. Truszczy?ski, Disjunctive defaults, in:Principles of Knowledge Representation and Reasoning: Proc. 2nd Int. Conf., San Mateo, CA, April 22?25, 1991, eds. J. Allen, R. Fikes and E. Sandewall (Morgan Kaufmann) pp. 230?237."},{"key":"CR55","unstructured":"M.L. Ginsberg, ed.,Readings in Nonmonotonic Reasoning (Morgan Kaufmann, 1987)."},{"key":"CR56","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"G. Gottlob, Complexity results for non-monotonic logics, J. Logic and Comput. 2 (1992) 397?425.","journal-title":"J. Logic and Comput."},{"key":"CR57","unstructured":"J. Grant and J. Minker, Answering queries in indefinite databases and the null value problem, in:Advances in Computing Research, ed. P. Kanellakis (1986) pp. 247?267."},{"key":"CR58","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/B978-0-934613-40-8.50015-4","volume-title":"Foundations of Decutive Databases and Logic Programming","author":"L.J. Henschen","year":"1988","unstructured":"L.J. Henschen and H. Park, Compiling the GCWA in indefinite databases, in:Foundations of Decutive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Washington, 1988) pp. 395?438."},{"key":"CR59","unstructured":"R. Hill, Lush resolution and its completeness, TR DCL Memo 78, Department of Artificial Intelligence, University of Edinburgh (1974)."},{"key":"CR60","first-page":"259","volume":"3","author":"T. Imielinski","year":"1991","unstructured":"T. Imielinski, Incomplete deductive databases, Ann. Math. and AI 3 (1991) 259?293.","journal-title":"Ann. Math. and AI"},{"key":"CR61","doi-asserted-by":"crossref","unstructured":"T. Imielinski and K. Vadaparty, Complexity of query processing in databases with OR-objects, in:Proc. 7th ACM SIGACT\/SIGMOD Symp. on Principles of Database Systems, Philadelphia, PA, 1989, pp. 51?65.","DOI":"10.1145\/73721.73726"},{"key":"CR62","first-page":"400","volume-title":"Proc. 11th Int. Conf. on Automated Deduction","author":"K. Inoue","year":"1992","unstructured":"K. Inoue, M. Koshimura and R. Hasegawa, Embedding negation as failure into a model generation theorem prover, in:Proc. 11th Int. Conf. on Automated Deduction, ed. D. Kapur, Saratoga Springs NY, USA, 1992 (Springer-Verlag) pp. 400?415."},{"key":"CR63","unstructured":"J. Jaffar, J.-L. Lassez and J.W. Lloyd, Completeness of the negation as failure rule, in:Proc. 8th Int. Joint Conf. on Artificial Intelligence, Karlsruhe, West Germany, 1983, pp. 500?506."},{"key":"CR64","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"A.C. Kakas","year":"1993","unstructured":"A.C. Kakas, R.A. Kowalski and F. Toni, Abductive logic programming, J. Logic and Comput. 2 (1993) 719?770. Also, Technical Report, Dept. of Computing, Imperial College, London (1992).","journal-title":"J. Logic and Comput."},{"key":"CR65","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R.A. Kowalski","year":"1991","unstructured":"R.A. Kowalski and D. Kuehner, Linear resolution with selection function, Artificial Intelligence 2 (1991) 227?260.","journal-title":"Artificial Intelligence"},{"key":"CR66","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/35043.35046","volume":"31","author":"R.A. Kowalski","year":"1988","unstructured":"R.A. Kowalski, The early years of logic programming, Commun. ACM 31(1) (1988) 38?43.","journal-title":"Commun. ACM"},{"key":"CR67","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"S. Kraus, D. Lehmann and M. Magidor, Nonmonotonic reasoning, preferential models and cumulative logics, Artificial Intelligence (44) (1990) 167?207.","journal-title":"Artificial Intelligence"},{"key":"CR68","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","volume":"29","author":"J.L. Lassez","year":"1984","unstructured":"J.L. Lassez and M.J. Maher, Closure and fairness in the semantics of programming logic, Theor. Comp. Sci. 29 (1984) 167?184.","journal-title":"Theor. Comp. Sci."},{"key":"CR69","unstructured":"V. Lifschitz and H. Turner, From disjunctive programs to abduction, in:Proc. of the Workshop on Non-monotonic Extensions of Logic Programming: Theory, Implementation and Applications, held in conjunction with ICLP'94, eds. J. Dix, L.M. Pereira and T. Przymusinski, 1994, pp. 111?125."},{"issue":"1","key":"CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77643.77644","volume":"15","author":"K.C. Liu","year":"1990","unstructured":"K.C. Liu and R. Sunderraman, Indefinite and maybe information in relational databases, ACM Transact. Database Syst. 15(1) (1990) 1?39.","journal-title":"ACM Transact. Database Syst."},{"key":"CR71","doi-asserted-by":"crossref","unstructured":"K.-C. Liu and R. Sunderraman, On representing indefinite and maybe information in relational databases: a generalization,Proc. IEEE Data Engineering, 1990, pp. 495?502.","DOI":"10.1109\/ICDE.1990.113503"},{"key":"CR72","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd,Foundations of Logic Programming (Springer, 1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"CR73","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd,Foundations of Logic Programming, 2nd Ed. (Springer, 1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"CR74","unstructured":"J. Lobo, On the semantics of disjunctive logic programs with negation, Ph.D. Thesis, University of Maryland, Department of Computer Science (1990); also, University of Maryland Technical Report CS-TR-2604, UMIACS-TR-91-20."},{"key":"CR75","first-page":"255","volume-title":"Proc. 6th Int. Conf. on Logic Programming","author":"J. Lobo","year":"1989","unstructured":"J. Lobo, J. Minker and A. Rajesekar, Extending the semantics of logic programs to disjunctive logic programs, in:Proc. 6th Int. Conf. on Logic Programming, eds. G. Levi and M. Martelli. Cambridge, Massachusetts, 1989. (MIT Press) pp. 255?267."},{"key":"CR76","doi-asserted-by":"crossref","unstructured":"J. Lobo, J. Minker and A. Rajasekar,Foundations of Disjunctive Logic Programming (MIT Press, 1992).","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"CR77","unstructured":"J. Lobo, A. Rajasekar and J. Minker, Weak completion theory for non-Horn programs, in:Proc. 5th Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen (Seattle, Washington, August 15?19, 1988) pp. 828?842."},{"key":"CR78","unstructured":"J. Lobo, C. Yu and G. Wang, Computing the transitive closure in disjunctive databases, Technical Report, Department of Electrical Engineering and Computer Science, University of Illinois at Chicago (1992)."},{"key":"CR79","unstructured":"D.W. Loveland,Automated Theorem Proving: A Logical Basis (North-Holland, 1978)."},{"key":"CR80","doi-asserted-by":"crossref","unstructured":"D.W. Loveland, Near-Horn PROLOG, in:Proc. 4th Int. Conf. on Logic Programming, ed. J.-L. Lassez (1987) pp. 456?459.","DOI":"10.21236\/ADA185172"},{"key":"CR81","volume-title":"Computational Logic: Essays in Honor of J. Alan Robinson","author":"D.W. Loveland","year":"1991","unstructured":"D.W. Loveland and D.W. Reed, A near-Horn PROLOG for compilation, in:Computational Logic: Essays in Honor of J. Alan Robinson, ed. J.-L. Lassez (MIT Press, Cambridge, MA, 1991), to appear; also Technical Report CS-1989-14, Duke University."},{"key":"CR82","volume-title":"Technical Report CS-1994-16","author":"D.W. Loveland","year":"1994","unstructured":"D.W. Loveland, D.W. Reed and D.S. Wilson, SATCHMORE: SATCHMO with RElevancy. Technical Report CS-1994-16, Dept. of Computer Science. Duke University, Durham, NC 27708, USA (1994)."},{"key":"CR83","doi-asserted-by":"crossref","unstructured":"R. Manthey and F. Bry. SATCHMO: A theorem prover implemented in Prolog, in:Proc. 9th Int. Conf. on Automated Deduction, 1988.","DOI":"10.1007\/BFb0012847"},{"key":"CR84","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"W. Marek and M. Truszczy?ski, Autoepistemic logic, J. ACM 38 (1991) 588?619.","journal-title":"J. ACM"},{"key":"CR85","unstructured":"W. Marek and M. Truszczy?ski,Non-monotonic Logics: Context-Dependent Reasoning (Springer-Verlag, 1993)."},{"key":"CR86","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy, Circumscription ? a form of non-monotonic reasoning, Artificial Intelligence 13 (1980) 27?39.","journal-title":"Artificial Intelligence"},{"key":"CR87","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","volume":"25","author":"D. McDermott","year":"1980","unstructured":"D. McDermott and J. Doyle, Non-monotonic logic I, Artificial Intelligence 25 (1980) 41?72.","journal-title":"Artificial Intelligence"},{"key":"CR88","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume":"138","author":"J. Minker","year":"1982","unstructured":"J. Minker, On definite databases and the closed world assumption, in:Lecture Notes in Computer Science 138 (Springer, 1982) pp. 292?308.","journal-title":"Lecture Notes in Computer Science"},{"key":"CR89","volume-title":"Proc. Workshop on Foundations of Deductive Databases and Logic Programming","author":"J. Minker","year":"1986","unstructured":"J. Minker,Proc. Workshop on Foundations of Deductive Databases and Logic Programming, University of Maryland, College Park, MD, 1986."},{"key":"CR90","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0743-1066(88)90006-4","volume":"5","author":"J. Minker","year":"1988","unstructured":"J. Minker, Perspectives in deductive databases, J. Logic Progr. 5 (1988) 33?60.","journal-title":"J. Logic Progr."},{"key":"CR91","unstructured":"J. Minker, Toward a foundation of disjunctive logic programming, in:Proc. North American Conf. on Logic Programming, eds. E.L. Lusk and R.A. Overbeek (1989) pp. 1215?1235."},{"issue":"2?4","key":"CR92","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0743-1066(93)90028-F","volume":"17","author":"J. Minker","year":"1993","unstructured":"J. Minker, An overview of nonmonotonic reasoning and logic programming, J. Logic Progr. 17 (2?4) (1993) 95?126.","journal-title":"J. Logic Progr."},{"key":"CR93","volume-title":"Technical Report CS-TR-1869","author":"J. Minker","year":"1987","unstructured":"J. Minker and A. Rajasekar, A fixpoint semantics for non-Horn logic programs, Technical Report CS-TR-1869, Department of Computer Science, University of Maryland, College Park, MD (1987)."},{"key":"CR94","doi-asserted-by":"crossref","unstructured":"J. Minker and A. Rajasekar, Procedural interpretation of non Horn logic programs, in:Proc. 9th Int. Conf. on Automated Deduction, eds. E.L. Lusk and R.A. Overbeek (1988) pp. 278?293.","DOI":"10.1007\/BFb0012837"},{"key":"CR95","unstructured":"J. Minker and A. Rajasekar, Disjunctive logic programming, in:Proc. Int. Symp. Methodologies for Intelligent Systems, 1989, pp. 381?394 (Invited Lecture)."},{"key":"CR96","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"J. Minker and A. Rajasekar, A fixpoint semantics for disjunctive logic programs, J. Logic Progr. 9 (1990) 45?74.","journal-title":"J. Logic Progr."},{"key":"CR97","doi-asserted-by":"crossref","unstructured":"J. Minker and C. Ruiz, On extended disjunctive logic programs, in:Proc. 7th Int. Symp. on Methodologies for Intelligent Systems, eds. J. Komorowski and Z.W. Ra?. Lecture Notes in AI. Springer-Verlag (1993) pp. 1?18 (Invited Paper).","DOI":"10.1007\/3-540-56804-2_1"},{"issue":"3\/4","key":"CR98","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1994-201236","volume":"20","author":"J. Minker","year":"1994","unstructured":"J. Minker and C. Ruiz, Semantics for disjunctive logic programs with explicit and default negation, Fundamenta Informaticae 20(3\/4) (1994) 145?192. Anniversary Issue edited by H. Rasiowa.","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"CR99","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(82)90035-7","volume":"14","author":"J. Minker","year":"1982","unstructured":"J. Minker and G. Zanon, An extension to linear resolution with selection function, Inform. Proc. Lett. 14(3) (1982) 191?194.","journal-title":"Inform. Proc. Lett."},{"key":"CR100","unstructured":"R.C. Moore, Possible-world semantics for autoepistemic logic, in:Proc. AAAI Workshop on Non-Monotonic Reasoning, New Paltz, 1984, pp. 396?401."},{"key":"CR101","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R.C. Moore","year":"1985","unstructured":"R.C. Moore, Semantical considerations on non-monotonic logic, Artificial Intelligence 25 (1985) 75?94.","journal-title":"Artificial Intelligence"},{"key":"CR102","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T.C. Przymusinski","year":"1988","unstructured":"T.C. Przymusinski, On the declarative semantics of deductive databases and logic programming, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Washington, 1988) pp. 193?216."},{"key":"CR103","unstructured":"T.C. Przymusinski, Perfect model semantics, in:Proc 5th Int. Conf. and Symp. on Logic Programming, eds. R. Kowalski and K. Bowen (1988) pp. 1081?1096."},{"key":"CR104","doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski, Every logic program has a natural stratification and an iterated fixed point model, in:Proc. 8th ACM SIGACT\/SIGMOD\/SIGART Symp. on Principles of Database Systems (1989) pp. 11?21.","DOI":"10.1145\/73721.73723"},{"key":"CR105","doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski, On the declarative and procedural semantics of logic programs, J. Automated Reasoning 5(2) (June 1989).","DOI":"10.1007\/BF00243002"},{"key":"CR106","unstructured":"T.C. Przymusinski, Extended stable semantics for normal and disjunctive programs, in:Proc. 7th Int. Conf. on Logic Programming, eds. D.H.D. Warren and P. Szeredi. Jerusalem, Israel, 1990 (MIT Press), 459?477."},{"key":"CR107","unstructured":"T.C. Przymusinski, Three valued stable models and well-founded models of logic programs, Technical Report, Department of Computer Science, University of Texas at El Paso (1990)."},{"key":"CR108","first-page":"42","volume-title":"Proc. North American Conf. on Logic Programming","author":"T.C. Przymusinski","year":"1990","unstructured":"T.C. Przymusinski, Stationary semantics for disjunctive logic programs and deductive databases, in:Proc. North American Conf. on Logic Programming, eds. S. Debray and M. Hermenegildo (MIT Press, Cambridge, MA, 1990) pp. 42?59."},{"key":"CR109","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T.C. Przymusinski","year":"1991","unstructured":"T.C. Przymusinski, Stable semantics for disjunctive programs, New Generation Comp. J. 9 (1991) 401?424.","journal-title":"New Generation Comp. J."},{"key":"CR110","unstructured":"T. Przymusinski, Static semantics of logic programs, in:Proc Workshop on Non-monotonic Extensions of Logic Programming: Theory, Implementation and Applications, held in conjunction with ICLP'94, eds. J. Dix, L.M. Pereira and T. Przymusinski, 1994, pp. 17?32."},{"key":"CR111","unstructured":"A. Rajasekar, Semantics for disjunctive logic programs, Ph.D. Thesis, University of Maryland, Department of Computer Science (1989); also, University of Maryland Technical Report CS-TR-2359, UMIACS-TR-89-122."},{"key":"CR112","doi-asserted-by":"crossref","unstructured":"A. Rajasekar, J. Lobo and J. Minker, Weak generalized closed world assumption, J. Automated Reasoning (1989) 293?307.","DOI":"10.1007\/BF00248321"},{"key":"CR113","unstructured":"A. Rajasekar and J. Minker, Stratification semantics for general disjunctive programs, in:Proc. North American Conf. on Logic Programming, eds. E.L. Lusk and R.A. Overbeek, 1989, pp. 573?586."},{"key":"CR114","volume-title":"Proc. Int. Logic Programming Symp.","author":"D.W. Reed","year":"1991","unstructured":"D.W. Reed, D.W. Loveland and B.T. Smith, An alternative of disjunction logic programs, in:Proc. Int. Logic Programming Symp. (MIT Press, Cambridge, MA, 1991); also Technical Report, CS-1991-11, Department of Computer Science, Duke University."},{"key":"CR115","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"E. Reiter","year":"1978","unstructured":"E. Reiter, On closed world data bases, in:Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum, New York, 1978) p. 55?76."},{"key":"CR116","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81?132.","journal-title":"Artificial Intelligence"},{"key":"CR117","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/5383.5388","volume":"33","author":"R. Reiter","year":"1986","unstructured":"R. Reiter, A sound and sometimes complete query evaluation algorithm for relational databases with null values, J. ACM 33 (1986) 349?370.","journal-title":"J. ACM"},{"key":"CR118","doi-asserted-by":"crossref","unstructured":"R. Reiter, Nonmonotonic reasoning, Ann. Rev. Comp. Sci. (1987) 147?188.","DOI":"10.1146\/annurev.cs.02.060187.001051"},{"key":"CR119","doi-asserted-by":"crossref","unstructured":"J. Rohmer, R. Lescoeur and J.-M. Kerisit, The Alexander method: a Technique for the processing of recusive axioms in deductive databases, new Generation Comp. 4(3) (1986).","DOI":"10.1007\/BF03037407"},{"key":"CR120","doi-asserted-by":"crossref","unstructured":"K.A. Ross, A procedural semantics for well-founded negation in logic programs, in:Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (1989).","DOI":"10.1145\/73721.73724"},{"key":"CR121","unstructured":"K.A. Ross, Well-founded semantics for disjunctive logic programs, in:Proc. 1st Int. Conf. on Deductive and Object Oriented Databases, Kyoto, Japan, 1989, pp. 352?369."},{"key":"CR122","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","volume":"4","author":"K.A. Ross","year":"1988","unstructured":"K.A. Ross and R.W. Topor, Inferring negative information from disjunctive databases, J. Automated Reasoning 4 (1988) 397?424.","journal-title":"J. Automated Reasoning"},{"key":"CR123","doi-asserted-by":"crossref","unstructured":"C. Sakama, Possible model semantics for disjunctive databases, in:Proc. 1st Int. Conf. on Deductive and Object Oriented Databases, 1989, pp. 337?351.","DOI":"10.1016\/B978-0-444-88433-6.50028-9"},{"key":"CR124","unstructured":"C. Sakama and K. Inoue, On the equivalence between disjunctive and abductive logic programs, in:Proc. 11th Int. Conf. on Logic Programming, ed. P. Van Hentenryck (MIT Press, 1994) pp. 489?503."},{"key":"CR125","unstructured":"D. Seipel, Tree-based fixpoint iteration for disjunctive logic programs, in:Proc. ILPS'93 Workshop on Logic Programming with Incomplete Information, 1993, pp. 177?189."},{"key":"CR126","doi-asserted-by":"crossref","unstructured":"J.C. Shepherdson, negation in logic programming, in:Foundations of deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, 1988) pp. 19?88.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"CR127","unstructured":"B.T. Smith and D.W. Loveland, A simple near-Horn PROLOG interpreter, in:Proc. 5th Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, Washington, 1988, pp. 794?809."},{"key":"CR128","doi-asserted-by":"crossref","unstructured":"B. Spencer, Avoiding duplicate proofs with the foothold refinement, Ann. of Math. and AI, this issue.","DOI":"10.1007\/BF01530763"},{"key":"CR129","unstructured":"L.S. Sterling and E.Y. Shapiro,The Art of Prolog (MIT Press, 1986)."},{"key":"CR130","unstructured":"M. Suchenek, Minimal models for closed world databases, in:Proc. ISMIS 4, ed. Z.W. Ras (1989) pp. 515?522."},{"key":"CR131","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.E. Emden van","year":"1976","unstructured":"M.E. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23 (1976) 733?742.","journal-title":"J. ACM"},{"key":"CR132","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, Negation as failure using tight derivations for general logic programs, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, 1988) pp. 1149?1176.","DOI":"10.1016\/B978-0-934613-40-8.50007-5"},{"key":"CR133","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, K.A. Ross and J. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in:Proc. 7th Symp. on Principles of Database Systems (1988) pp. 221?230.","DOI":"10.1145\/308386.308444"},{"key":"CR134","unstructured":"M.Y. Vardi, The complexity of relational languages in:Proc. 14th ACM Symp. on the Theory of Computing, (1982) pp. 137?146."},{"key":"CR135","unstructured":"G. Wagner, Solving the Steamroller, and other puzzles, with extended disjunctive logic programming, in:Proc. Workshop on Non-monotonic Extensions of Logic Programming: Theory, Implementation and Applications, held in conjunction with ICLP'94, eds. J. Dix, L.M. Pereira and T. Przymusinski, 1994, pp. 127?144."},{"key":"CR136","volume-title":"Technical Report UMIACS-TR-93-63 and CS-TR-3103","author":"A. Yahya","year":"1993","unstructured":"A. Yahya, J.A. Fern\u00e1ndez and J. Minker, Ordered model trees: A normal form for disjunctive deductive databased, Technical Report UMIACS-TR-93-63 and CS-TR-3103, University of Maryland Institute for Advance Computer Studies, College Park, MD 20742 (1993), to appear in J. Automated Reasoning."},{"key":"CR137","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00244994","volume":"1","author":"A. Yahya","year":"1985","unstructured":"A. Yahya and L.J. Henschen, Deduction in non-Horn databases, J. Automated Reasoning 1 (1985) 141?160.","journal-title":"J. Automated Reasoning"},{"key":"CR138","doi-asserted-by":"crossref","unstructured":"L.Y. Yuan and D.-A. Chiang, A sound and complete evaluation algorithm for relational databases with disjunctive information, in:Principles of Database Systems (1989) 66?74.","DOI":"10.1145\/73721.73727"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530759\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530759.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530759\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:04:34Z","timestamp":1586217874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":138,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01530759"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01530759","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":["Applied Mathematics","Artificial Intelligence"],"published":{"date-parts":[[1994,3]]}}}