{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:26:47Z","timestamp":1710347207668},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bf00881915","type":"journal-article","created":{"date-parts":[[2004,12,25]],"date-time":"2004-12-25T20:34:58Z","timestamp":1104006898000},"page":"145-172","source":"Crossref","is-referenced-by-count":51,"title":["An alternative approach to the semantics of disjunctive logic programs and deductive databases"],"prefix":"10.1007","volume":"13","author":[{"given":"Chiaki","family":"Sakama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Apt, K. R., Blair, H. A. and Walker, A.: Towards a theory of declarative knowledge, in J. Minker (ed.),Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988, pp. 89?148.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01543473","volume":"5","author":"C. Baral","year":"1992","unstructured":"Baral, C., Lobo, J. and Minker, J.: Generalized disjunctive well-founded semantics for logic programs,Ann. Mathematics and Artificial Intelligence 5 (1992), 89?132.","journal-title":"Ann. Mathematics and Artificial Intelligence"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. and Ramakrishnan, R.: Performance evaluation of data intensive logic programs, in J. Minker (ed.),Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988, pp. 439?517.","DOI":"10.1016\/B978-0-934613-40-8.50016-6"},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1109\/69.219736","volume":"5","author":"E. P. F. Chan","year":"1993","unstructured":"Chan, E. P. F.: A possible world semantics for disjunctive databases,IEEE Trans. on Knowledge and Data Engineering 5(2) (1993), 282?292. Preliminary version in: Research Report CS-89-47, Dept. of Computer Science, Univ. of Waterloo, 1989.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"CR5","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":"Clark, K. L.: Negation as failure, in H. Gallaire and J. Minker (eds.),Logic and Data Bases, Plenum, New York, 1978, pp. 293?322."},{"key":"CR6","unstructured":"Decker, H.: Foundations of first-order databases, Research Report, Siemens, 1992. Preliminary version inProc. 2nd Int. Workshop on the Deductive Approach to Information Systems and Databases, Universitat Politecnica de Catalunya, Report de Recerca LSI\/91\/30, 1991, pp. 149?173."},{"key":"CR7","unstructured":"Decker, H. and Casamayor, J. C.: Sustained models and sustained answers in first order databases,Proc. 4th Int. Workshop on the Deductive Approach to Information Systems and Databases, 1993."},{"key":"CR8","unstructured":"Dix, J.: Classifying semantics of disjunctive logic programs,Proc. Joint Int. Conf. and Symp. on Logic Programming, MIT Press, 1992, pp. 798?812."},{"key":"CR9","unstructured":"Dung, P. M.: Negation as failure for disjunctive logic programming,Proc. ILPS'91 Post-Conference Workshop on Disjunctive Logic Programs, 1991."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Eiter, T. and Gottlob, G.: Complexity aspects of various semantics for disjunctive databases,Proc. 12th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1993, pp. 158?167.","DOI":"10.1145\/153850.153864"},{"key":"CR11","unstructured":"Eiter, T., Gottlob, G. and Gurevich, Y.: Curb Your Theory!: A circumscriptive approach for inclusive interpretation of disjunctive information,Proc. IJCAI-93, Morgan Kaufmann, 1993, pp. 634?639."},{"key":"CR12","unstructured":"Eshghi, K. and Kowalski, R. A.: Abduction compared with negation by failure,Proc. 6th Int. Conf. on Logic Programming, MIT Press, 1989, pp. 234?254."},{"issue":"3&4","key":"CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01530802","volume":"8","author":"J. A. Fernandez","year":"1993","unstructured":"Fernandez, J. A., Lobo, J., Minker, J. and Subrahmanian, V. S.: Disjunctive LP + integrity constraints = stable model semantics,Ann. Mathematics and Artificial Intelligence 8(3&4) (1993), 449?474.","journal-title":"Ann. Mathematics and Artificial Intelligence"},{"key":"CR14","unstructured":"Gelfond, M. and Lifschitz, V.: The Stable model semantics for logic programming,Proc. 5th Int. Conf. and Symp. on Logic Programming, MIT Press, 1988, pp. 1070?1080."},{"issue":"3&4","key":"CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M. and Lifschitz, V.: Classical negation in logic programs and disjunctive databases,New Generation Computing 9(3&4) (1991), 365?385.","journal-title":"New Generation Computing"},{"key":"CR16","unstructured":"Gelfond, M.: Strong introspection,Proc. AAAI-91, MIT Press, 1991, pp. 386?391."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Inoue, K., Koshimura, M. and Hasegawa, R.: Embedding negation as failure into a model generation theorem prover,Proc. 11th Int. Conf. on Automated Deducation, Lecture Notes in Artificial Intelligence 607, Springer-Verlag, 1992, 400?415.","DOI":"10.1007\/3-540-55602-8_180"},{"key":"CR18","unstructured":"Inoue, K. and Sakama, C.: Transforming abductive logic programs to disjunctive programs,Proc. 10th Int. Conf. on Logic Programming, MIT Press, 1993, pp. 335?353."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Inoue, K. and Sakama, C.: On positive occurrences of negation as failure,Proc. 4th Int. Conf. on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, 1994, pp. 293?304.","DOI":"10.1016\/B978-1-4832-1452-8.50123-8"},{"issue":"1","key":"CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"Kraus, S., Lehmann, D. and Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics,Artificial Intelligence 44(1) (1990), 167?207.","journal-title":"Artificial Intelligence"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Lobo, J., Minker, J. and Rajasekar, A.:Foundations of Disjunctive Logic Programming, MIT Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog,Proc. 9th Int. Conf. on Automated Deducation, Lecture Notes in Computer Science 310, Springer-Verlag, 1988, pp. 415?434.","DOI":"10.1007\/BFb0012847"},{"issue":"1&2","key":"CR23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription ? a form of nonmonotonic reasoning,Artificial Intelligence 13(1&2) (1980), 27?39.","journal-title":"Artificial Intelligence"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Minker, J.: On indefinite data bases and the closed world assumption,Proc. 6th Int. Conf. on Automated Deduction, Lecture Notes in Computer Science 138, Springer-Verlag, 1982, pp. 292?308.","DOI":"10.1007\/BFb0000066"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0304-3975(92)90019-C","volume":"103","author":"W. Marek","year":"1992","unstructured":"Marek, W. and Subrahmanian, V. S.: The relationship between stable, supported, default and autoepistemic semantics for general logic programs,Theoretical Computer Science 103 (1992), 365?386.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"CR26","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"Marek, W. and Truszczynski, M.: Autoepistemic logic,J. ACM 38(3) (1991), 588?619.","journal-title":"J. ACM"},{"key":"CR27","unstructured":"Marek, W. and Truszczynski, M.: Computing intersection of autoepistemic expansions,Proc. 1st Int. Workshop on Logic Programming and Nonmonotonic Reasoning, MIT Press, 1991, 37?50."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C.: On the declarative semantics of deductive databases and logic programs, in J. Minker (ed.),Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988, pp. 193?216.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"issue":"3&4","key":"CR29","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. C. Przymusinski","year":"1991","unstructured":"Przymusinski, T. C.: Stable semantics for disjunctive programs,New Generation Computing 9(3&4) (1991), 401?424.","journal-title":"New Generation Computing"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C.: Semantics of disjunctive logic programs and deductive databases,Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, Lecture Notes in Computer Science 566, Springer-Verlag, 1991, pp. 85?107.","DOI":"10.1007\/3-540-55015-1_5"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1978","unstructured":"Reiter, R.: On closed world databases, in H. Gallaire and J. Minker (eds.),Logic and Data Bases, Plenum, New York, 1978, pp. 55?76."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00248321","volume":"5","author":"A. Rajasekar","year":"1989","unstructured":"Rajasekar, A., Lobo, J. and Minker, J.: Weak generalized closed world assumption,J. Automated Reasoning 5 (1989), 293?307.","journal-title":"J. Automated Reasoning"},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"Ross, K.: The well founded semantics for disjunctive logic programs,Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases, North-Holland, 1989, pp. 385?401.","DOI":"10.1016\/B978-0-444-88433-6.50029-0"},{"issue":"2","key":"CR34","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","volume":"4","author":"K. A. Ross","year":"1988","unstructured":"Ross, K. A. and Topor, R. W.: Inferring negative information from disjunctive databases,J. Automated Reasoning 4(2) (1988), 397?424.","journal-title":"J. Automated Reasoning"},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"Sakama, C.: Possible model semantics for disjunctive databases,Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases, North-Holland, 1989, pp. 369?383.","DOI":"10.1016\/B978-0-444-88433-6.50028-9"},{"key":"CR36","unstructured":"Sakama, C. and Inoue, K.: Negation in disjunctive logic programs,Proc. 10th Int. Conf. on Logic Programming, MIT Press, 1993, pp. 703?719."},{"key":"CR37","unstructured":"Sakama, C. and Inoue, K.: On the equivalence between disjunctive and abductive logic programs,Proc. 11th Int. Conf. on Logic Programming, MIT Press, 1994, pp. 489?503."},{"issue":"1","key":"CR38","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0743-1066(90)90032-Z","volume":"9","author":"T. Sato","year":"1990","unstructured":"Sato, T.: Completed logic programs and their consistency,J. Logic Programming 9(1), 1990, pp. 33?44.","journal-title":"J. Logic Programming"},{"key":"CR39","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01543479","volume":"5","author":"J. S. Schlipf","year":"1992","unstructured":"Schlipf, J. S.: Formalizing a logic for logic programming.Ann. Mathematics and Artificial Intelligence 5 (1992), 279?302.","journal-title":"Ann. Mathematics and Artificial Intelligence"},{"issue":"4","key":"CR40","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden Van","year":"1976","unstructured":"Van Emden, M. H. and Kowalski, R. A.: The semantics of predicate logic as a programming language,J. ACM 23(4) (1976), 733?742.","journal-title":"J. ACM"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881915.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881915\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T23:30:34Z","timestamp":1586043034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994]]}},"alternative-id":["BF00881915"],"URL":"https:\/\/doi.org\/10.1007\/bf00881915","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}