{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:21:32Z","timestamp":1725484892659},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_11","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T01:24:41Z","timestamp":1180661081000},"page":"164-178","source":"Crossref","is-referenced-by-count":19,"title":["Alternating Fixpoint Theory for Logic Programs with Priority"],"prefix":"10.1007","author":[{"given":"Kewen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangzhen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"A. Analyti, S. Pramanik. Reliable semantics for extended logic programs with rule prioritization. Journal of Logic and Computation, 303\u2013325, 1995.","DOI":"10.1093\/logcom\/5.3.303"},{"key":"11_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. Apt","year":"1988","unstructured":"K. Apt, H. Blair and A. Walker. Towards a theory of declarative knowledge. In: J. Minker ed. Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Washington, pages 89\u2013148, 1988."},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00881830","volume":"15","author":"F. Badder","year":"1995","unstructured":"F. Badder, B. Hollunder. Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. Journal of Automated Reasoning, 15(1), 41\u201368, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR4","unstructured":"C. Baral, J. Lobo. Defeasible specifications in action theories. In: Proceedings of IJCAI\u201997, Morgan Kaufmann, pages 1441\u20131446, 1997."},{"key":"11_CR5","first-page":"19","volume":"4","author":"G. Brewka","year":"1996","unstructured":"G. Brewka. Well-founded semantics for extended logic programs with dynamic preferences. J. AI Research, 4: 19\u201336, 1996.","journal-title":"J. AI Research"},{"issue":"1\u20132","key":"11_CR6","first-page":"295","volume":"109","author":"G. Brewka","year":"1999","unstructured":"G. Brewka, T. Either. Preferred answer sets for extended logic programs, Artificial Intelligence, 109(1\u20132), 295\u2013356, 1999.","journal-title":"Artificial Intelligence"},{"key":"11_CR7","unstructured":"J. Delgrade, T. Schaub. Compiling reasoning with and about preferences in default logic. In: Proc. IJCAI\u201997, pages 168\u2013174, 1997."},{"key":"11_CR8","unstructured":"D. Gabbay, E. Laenens and D. Vermeir. Credulous vs. skeptical semantics for ordered logic programs. In: Proc. KR\u201992, pages 208\u2013217, 1992."},{"key":"11_CR9","unstructured":"M. Gelfond, V. Lifschitz. The stable model semantics for logic programming, in Logic Programming: Proc. Fifth Intl Conference and Symposium, pages 1070\u20131080, MIT Press, 1988."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"M. Gelfond, V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9: 365\u2013386, 1991.","journal-title":"New Generation Computing"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"M. Gelfond, T. Son. Reasoning with prioritized defaults. In: Proc. LPKR\u201997 (LNAI 1471), Springer, pages 164\u2013233, 1998.","DOI":"10.1007\/BFb0054795"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/logcom\/1.2.159","volume":"1","author":"E. Laenens","year":"1990","unstructured":"E. Laenens, D. Vermeir. A fixpoint semantics for ordered logic. Journal of Logic and Computation, 1:159\u2013185, 1990.","journal-title":"Journal of Logic and Computation"},{"key":"11_CR13","unstructured":"F. Lin. Embracing causality in specifying the indirect effects of actions. In: Proc. IJCAI\u201995, pages 1985\u20131991, 1995."},{"key":"11_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Logic Foundations of Computer Science","author":"W. Marek","year":"1997","unstructured":"W. Marek, A. Nerode and J. B. Remmel. Basic forward chaining construction for logic programs. In Logic Foundations of Computer Science (LNCS 1234), Springer, 1997."},{"issue":"1\u20133","key":"11_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0168-0072(98)00041-4","volume":"96","author":"W. Marek","year":"1999","unstructured":"W. Marek, A. Nerode and J. B. Remmel. Logic programs, well-ordering, and forward chaining. Journal of Pure and Applied Logic, 96(1\u20133):231\u201376, 1999.","journal-title":"Journal of Pure and Applied Logic"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"W. Marek, M. Truszczynski. Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, Springer, pages 375\u2013398, 1999.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"11_CR17","unstructured":"J. McCarthy, P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In: B. Meltzer and D. Michie eds. Machine Intelligence, vol. 4, pages 463\u2013502, 1969."},{"key":"11_CR18","unstructured":"I. Niemel\u00e4. Logic programs with stable model semantics as a constraint programming paradigm. In: Proc. the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72\u201379, 1998."},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/11663081.1997.10510900","volume":"7","author":"H. Prakken","year":"1997","unstructured":"H. Prakken, G. Sartor. Argument-based logic programming with defeasible priorities. J. Applied Non-Classical Logics, 7: 25\u201375, 1997.","journal-title":"J. Applied Non-Classical Logics"},{"key":"11_CR20","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. Przymusinski","year":"1988","unstructured":"T. Przymusinski. On the declarative semantics of deductive databases and logic programming. In: J. Minker ed. Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Washington, pages 193\u2013216, 1988."},{"issue":"1\u20132","key":"11_CR21","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(1\u20132), 81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"key":"11_CR22","unstructured":"C. Sakama, K. Inoue. Representing priorities in logic programs. In: Proc. IJC-SLP\u201996, MIT Press, pages 82\u201396, 1996."},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","volume":"47","author":"A. Gelder van","year":"1993","unstructured":"A. van Gelder. The alternating fixpoint of logic programs with negation. Journal of Computer and System Science, 47: 185\u2013120, 1993.","journal-title":"Journal of Computer and System Science"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"K. Wang. Argumentation-based abduction in disjunctive logic programming. Journal Logic Programming (47 pages, to appear), 2000.","DOI":"10.1016\/S0743-1066(00)00004-2"},{"key":"11_CR25","unstructured":"K. Wang, L. Zhou and F. Lin. A semantic framework for prioritized logic programs and its application to causal theories. Tech. report TUCS-9906, 1999."},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"J. You, L. Yuan. Three-valued semantics of logic programming: is it needed? In Proc. the 9th ACM PODS, pages 172\u2013182, 1990.","DOI":"10.1145\/298514.298559"},{"key":"11_CR27","unstructured":"J. You, X. Wang and L. Yuan. Disjunctive logic programming as constrained inferences. In: Proc. ICLP\u201997, MIT Press, 1997."},{"key":"11_CR28","unstructured":"Y. Zhang, N. Foo. Answer sets for prioritized logic programs. In: Proc. the 1997 International Symposium on Logic Programming, MIT Press, pages 69\u201383, 1997."}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:24:17Z","timestamp":1556450657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}