{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:05:49Z","timestamp":1749125149750},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":[[1992,6]]},"DOI":"10.1007\/bf01543473","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T02:14:28Z","timestamp":1113963268000},"page":"89-131","source":"Crossref","is-referenced-by-count":10,"title":["Generalized disjunctive well-founded semantics for logic programs"],"prefix":"10.1007","volume":"5","author":[{"given":"Chitta","family":"Baral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Lobo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Minker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"C. Baral, J. Lobo and J. Minker, Generalized well-founded semantics for logic programs: in:Proc. 10th Int. Conf. on Automated Deduction, ed. M.E. Stickel, Kaiserslautern, Germany (Springer, 1990) pp. 102?116.","DOI":"10.1007\/3-540-52885-7_82"},{"key":"CR2","unstructured":"C. Baral and V.S. Subrahmanian, Stable and extension class theory for logic programs and default logics, Technical Report CS-TR-2402, Dept of Computer Science, University of Maryland (February 1990), presented at the3rd Int. Workshop on Non-Monotonic Reasoning, South Lake Tahoe (May 90), extended version to appear in J. Auto. Reasoning."},{"key":"CR3","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programming: inProc. Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, Washington (1988) pp. 1070?1080."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R.A. Kowalski","year":"1971","unstructured":"R.A. Kowalski and D. Kuehner, Linear resolution with selection function, Art. Int. 2 (1971) 227?260.","journal-title":"Art. Int."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd,Foundations of Logic Programming (Springer, 1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"J. Lobo, Minker and A. Rajasekar, Circumscription and disjunctive logic programming, in:Artificial Intelligence and Mathematical Theory of Computation, ed. V. Lifschitz (Academic Press, 1991).","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"CR7","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 (1988) pp. 828?842."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"J. Minker, On indefinite databases and the Closed World Assumption, in:Lecture Notes in Computer Science 138 (Springer, 1982) pp. 292?308.","DOI":"10.1007\/BFb0000066"},{"key":"CR9","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. Lusk and R. Overbeek, Argonne, IL (1988) pp. 278?293.","DOI":"10.1007\/BFb0012837"},{"key":"CR10","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":"CR11","unstructured":"J. Minker, A. Rajasekar and J. Lobo, Theory of disjunctive logic programs, in:Computational Logic: Essays in Honor of Alan Robinson, ed. J. Lassez (MIT Press, 1990)."},{"key":"CR12","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 (1982) 191?194.","journal-title":"Inform. Proc. Lett."},{"key":"CR13","unstructured":"H. Przymusinska and T. Przymusinski, Weakly perfect model semantics for logic programs, in:Proc. 5th Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, Washington (1988) pp. 1106?1120."},{"key":"CR14","unstructured":"T. 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, 1990) pp. 42?59."},{"key":"CR15","unstructured":"T. Przymusinski, On the relationship between logic programming and non-monotonic reasoning, in:Proc. AAAI-88 (1988) pp. 444?440."},{"key":"CR16","unstructured":"T.C. Przymusinski, Non-monotonic reasoning vs. logic programming ? A new perspective, in:Handbook on the Formal Foundations of AI, eds. Y. Wilks and D. Partridge (1988)."},{"key":"CR17","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, DC, 1988) pp. 193?216."},{"key":"CR18","unstructured":"T. Przymusinski, Three-valued formalizations of non-monotonic reasoning and logic programming, in:Proc. 1st Int. Conf. on Knowledge Representation and Reasoning (1989) pp. 341?348."},{"key":"CR19","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":"CR20","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01531083","volume":"1","author":"A. Rajasekar","year":"1990","unstructured":"A. Rajasekar and J. Minker, On stratified disjunctive programs, Ann. Math. Art. Int. 1 (1990) 339?357.","journal-title":"Ann. Math. Art. Int."},{"key":"CR21","unstructured":"K. Ross, Well-founded semantics for disjunctive logic programs, in:Proc. 1st Int. Conf. on Deductive and Object Oriented Databases, Kyoto, Japan (1989)."},{"key":"CR22","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":"CR23","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, K. Ross and J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in:Proc. 7th Symp. on Principles of Database Systems (1988) pp. 221?230, to appear in J. ACM.","DOI":"10.1145\/308386.308444"},{"key":"CR24","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. Autom. Reasoning 1 (1985) 141?160.","journal-title":"J. Autom. Reasoning"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01543473.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01543473\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01543473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:44:33Z","timestamp":1586220273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01543473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":24,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01543473"],"URL":"https:\/\/doi.org\/10.1007\/bf01543473","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}