{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:07Z","timestamp":1747548607274,"version":"3.40.5"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1018986207453","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"311-337","source":"Crossref","is-referenced-by-count":7,"title":["Semantics and expressiveness of disjunctive ordered logic"],"prefix":"10.1007","volume":"25","author":[{"given":"Francesco","family":"Buccafurri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasquale","family":"Rullo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325528_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, Reading, MA, 1995)."},{"key":"325528_CR2","doi-asserted-by":"publisher","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 Programming 19\/20 (1994) 73-148.","journal-title":"J. Logic Programming"},{"key":"325528_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","volume":"78","author":"N. Bidoit","year":"1991","unstructured":"N. Bidoit and C. Froidevaux, Negation by default and unstratifiable logic programs, Theoret. Comput. Sci. 78 (1991) 85-112.","journal-title":"Theoret. Comput. Sci."},{"key":"325528_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1613\/jair.284","volume":"4","author":"G. Brewka","year":"1996","unstructured":"G. Brewka, Well-founded semantics for extended logic programs with dynamic preferences, J. Artif. Intell. Res. 4 (1996) 19-36.","journal-title":"J. Artif. Intell. Res."},{"key":"325528_CR5","volume-title":"Proc. KR '98","author":"G. Brewka","year":"1998","unstructured":"G. Brewka and T. Eiter, Preferred answer sets for extended logic programs, in: Proc. KR '98 (Morgan Kaufmann, San Mateo, CA, 1998)."},{"issue":"1","key":"325528_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0743-1066(95)00076-3","volume":"27","author":"F. Buccafurri","year":"1996","unstructured":"F. Buccafurri, N. Leone and P. Rullo, Stable models and their computation for logic programming with inheritance and true negation, J. Logic Programming 27(1) (1996) 5-43.","journal-title":"J. Logic Programming"},{"key":"325528_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","volume":"17","author":"M. Cadoli","year":"1993","unstructured":"M. Cadoli, and M. Schaerf, A survey of complexity results for non-monotonic logics, J. Logic Programming 17 (1993) 127-160.","journal-title":"J. Logic Programming"},{"issue":"1","key":"325528_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. Chandra","year":"1982","unstructured":"A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25(1) (1982) 99-128.","journal-title":"J. Comput. System Sci."},{"key":"325528_CR9","first-page":"369","volume-title":"Proc. International Symposium on Logic Programming","author":"Y. Dimopoulos","year":"1995","unstructured":"Y. Dimopoulos and A. Kakas, Logic programming without negation as failure, in: Proc. International Symposium on Logic Programming (MIT Press, Cambridge, MA, 1995) pp. 369-383."},{"key":"325528_CR10","first-page":"227","volume":"22","author":"J. Dix","year":"1995","unstructured":"J. Dix, A classification theory of semantics of normal logic programs: Strong properties, Fund. Inform. 22 (1995) 227-255.","journal-title":"Fund. Inform."},{"key":"325528_CR11","first-page":"257","volume":"22","author":"J. Dix","year":"1995","unstructured":"J. Dix, A classification theory of semantics of normal logic programs: Weak properties, Fund. Inform. 22 (1995) 257-288.","journal-title":"Fund. Inform."},{"key":"325528_CR12","doi-asserted-by":"crossref","unstructured":"T. Eiter and G. Gottlob, On the computational cost of disjunctive logic programming: Propositional case, Ann. Math. Artificial Intelligence (1995).","DOI":"10.1007\/BF01536399"},{"key":"325528_CR13","doi-asserted-by":"crossref","unstructured":"T. Eiter, G. Gottlob and H. Mannila, Disjunctive Datalog, ACM Trans. Database Systems 22(3) (1997).","DOI":"10.1145\/261124.261126"},{"issue":"1\u20132","key":"325528_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(96)00179-X","volume":"189","author":"T. Eiter","year":"1997","unstructured":"T. Eiter, G. Gottlob and N. Leone, Abduction from logic programs: Semantics and complexity, Theoret. Comput. Sci. 189(1\u20132) (1997) 129-177.","journal-title":"Theoret. Comput. Sci."},{"key":"325528_CR15","series-title":"Lecture Notes in Computer Science","first-page":"364","volume-title":"Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97)","author":"T. Eiter","year":"1997","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello, A deductive system for non-monotonic reasoning, in: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), eds. J. Dix, U. Furbach and A. Nerode, Lecture Notes in Computer Science, Vol. 1265 (Springer, New York, 1997) pp. 364-375."},{"key":"325528_CR16","volume-title":"Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning \u2014 KR '98","author":"T. Eiter","year":"1998","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello, The knowledge representation system dlv: Progress report, comparisons, and benchmarks, in: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning \u2014 KR '98 (Morgan Kaufman, Trento, Italy, 1998)."},{"key":"325528_CR17","first-page":"43","volume-title":"Complexity of Computation","author":"R. Fagin","year":"1974","unstructured":"R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: Complexity of Computation, ed. R.M. Karp (Amer. Math. Soc., Providence, RI, 1974) pp. 43-74."},{"key":"325528_CR18","doi-asserted-by":"publisher","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 Computing 9 (1991) 365-385.","journal-title":"New Generation Computing"},{"key":"325528_CR19","doi-asserted-by":"crossref","unstructured":"M. Gelfond and T.C. Son, Reasoning with prioritized defaults, in: Proc. of the Workshop Logic Programming and Knowledge Representation \u2014 LPKR '97, Port Jefferson, New York (October 1997).","DOI":"10.1007\/BFb0054795"},{"issue":"3","key":"325528_CR20","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 nonmonotonic logics, J. Logic Comput. 2(3) (1992) 397-425.","journal-title":"J. Logic Comput."},{"key":"325528_CR21","volume-title":"Proc. International Conference on Logic Programming \u2014 ICLP '94","author":"A.C. Kakas","year":"1994","unstructured":"A.C. Kakas and P. Mancarella, The acceptability semantics for logic programs, in: Proc. International Conference on Logic Programming \u2014 ICLP '94, S. Margherita, Italy (1994)."},{"key":"325528_CR22","unstructured":"R.A. Kowalski and F. Sadri, Logic programs with exceptions, in: Proc. of 7th ICLP, Jerusalem (1990) pp. 598-616."},{"key":"325528_CR23","doi-asserted-by":"crossref","unstructured":"E. Laenens, D. Sacc\u00e1 and D. Vermeir, Extending logic programming, in: Proc. of ACM SIGMOD (May 1990).","DOI":"10.1145\/93597.98728"},{"issue":"2","key":"325528_CR24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/logcom\/1.2.159","volume":"1","author":"E. Laenens","year":"1990","unstructured":"E. Laenens and D. Vermeir, A fixpoint semantics for ordered logic, J. Logic Comput. 1(2) (1990) 159-185.","journal-title":"J. Logic Comput."},{"key":"325528_CR25","doi-asserted-by":"crossref","unstructured":"N. Leone, A. Mecchia, G. Rossi and P. Rullo, A deductive environment for dealing with objects and non-monotonic reasoning, IEEE Trans. Knowledge Data Engrg. 9(4) (1997).","DOI":"10.1109\/69.617049"},{"issue":"1","key":"325528_CR26","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF03038273","volume":"12","author":"N. Leone","year":"1993","unstructured":"N. Leone and G. Rossi, Well-founded semantics and stratification for ordered logic programs, New Generation Computing 12(1) (1993) 91-121.","journal-title":"New Generation Computing"},{"issue":"6","key":"325528_CR27","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1093\/logcom\/3.6.621","volume":"3","author":"N. Leone","year":"1993","unstructured":"N. Leone and P. Rullo, Ordered logic programming with sets, J. Logic Comput. 3(6) (1993) 621-642.","journal-title":"J. Logic Comput."},{"issue":"2","key":"325528_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/inco.1997.2630","volume":"135","author":"N. Leone","year":"1997","unstructured":"N. Leone, P. Rullo and F. Scarcello, Disjunctive stable models: Unfounded sets, fixpoint semantics and computation, Inform. Comput. 135(2) (1997) 69-112.","journal-title":"Inform. Comput."},{"key":"325528_CR29","volume-title":"Foundations of Disjunctive Logic Programming","author":"J. Lobo","year":"1992","unstructured":"J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming (MIT Press, Cambridge, MA, 1992)."},{"key":"325528_CR30","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF01531081","volume":"1","author":"W. Marek","year":"1990","unstructured":"W. Marek and M. Truszczy\u0144ski, Modal logic for default reasoning, Ann. Math. Artificial Intelligence 1 (1990) 275-302.","journal-title":"Ann. Math. Artificial Intelligence"},{"issue":"3","key":"325528_CR31","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"W. Marek and M. Truszczy\u0144ski, Autoepistemic logic, Journal of the ACM 38(3) (1991) 518-619.","journal-title":"Journal of the ACM"},{"key":"325528_CR32","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy, Circumscription \u2014 a form of nonmonotonic reasoning, Artificial Intelligence 13 (1980) 27-39.","journal-title":"Artificial Intelligence"},{"key":"325528_CR33","doi-asserted-by":"crossref","unstructured":"J. Minker, On indefinite data bases and the closed world assumption, in: Proc. CADE-82 (1982) pp. 292-308.","DOI":"10.1007\/BFb0000066"},{"key":"325528_CR34","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/oso\/9780198537472.003.0007","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"D. Nute","year":"1994","unstructured":"D. Nute, Defeasible logic, in: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. III, eds. D. Gabbay, C. Hogger and J. Robinson (Clarendon Press, Oxford, 1994) pp. 353-395."},{"key":"325528_CR35","unstructured":"S. Pradhan and J. Minker, Combining datalog databases using priorities, Internat. J. Cooperative Intell. Syst. (1996)."},{"key":"325528_CR36","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymusinski","year":"1991","unstructured":"T. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing 9 (1991) 401-424.","journal-title":"New Generation Computing"},{"key":"325528_CR37","doi-asserted-by":"publisher","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"},{"issue":"3","key":"325528_CR38","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1446","volume":"54","author":"D. Sacc\u00e0","year":"1997","unstructured":"D. Sacc\u00e0, The expressive powers of stable models for bound and unbound DATALOG queries, J. Comput. System Sci. 54(3) (1997) 441-464.","journal-title":"J. Comput. System Sci."},{"key":"325528_CR39","first-page":"82","volume-title":"Proc. Joint International Conference and Symposium on Logic Programming","author":"C. Sakama","year":"1996","unstructured":"C. Sakama and K. Inoue, Representing priorities in logic programs, in: Proc. Joint International Conference and Symposium on Logic Programming (MIT Press, Cambridge, MA, 1996) pp. 82-96."},{"key":"325528_CR40","doi-asserted-by":"crossref","unstructured":"J.S. Schlipf, The expressive powers of logic programming semantics, in: Proc. ACM Symposium on Principles of Database Systems (1990) pp. 196-204.","DOI":"10.1145\/298514.298564"},{"key":"325528_CR41","volume-title":"Proc. TARK-90","author":"G. Shvarts","year":"1990","unstructured":"G. Shvarts, Autoepistemic modal logics, in: Proc. TARK-90 (Morgan Kaufman, San Mateo, CA, 1990)."},{"key":"325528_CR42","volume-title":"The Mathematics of Inheritance Systems","author":"D.S. Touretzky","year":"1986","unstructured":"D.S. Touretzky, The Mathematics of Inheritance Systems (Pitman, London, 1986)."},{"key":"325528_CR43","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J.D. Ullman","year":"1989","unstructured":"J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vols. 1 and 2 (Computer Science Press, Rockville, MD, 1989)."},{"key":"325528_CR44","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi, The complexity of relational query languages, in: Proc. ACM Symp. on Theory of Computing (1982) pp. 137-146.","DOI":"10.1145\/800070.802186"},{"key":"325528_CR45","unstructured":"Y. Zhang and N.Y. Foo, Answer sets for prioritized logic programs, in: Proc. ILPS '97, Port Jefferson, New York (October 1997) pp. 69-84."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018986207453.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018986207453\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018986207453.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:38:58Z","timestamp":1747546738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018986207453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":45,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["325528"],"URL":"https:\/\/doi.org\/10.1023\/a:1018986207453","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}