{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:34Z","timestamp":1725664714317},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:00:09Z","timestamp":1330279209000},"page":"214-225","source":"Crossref","is-referenced-by-count":2,"title":["Basic forward chaining construction for logic programs"],"prefix":"10.1007","author":[{"given":"V. W.","family":"Marek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nerode","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. B.","family":"Remmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"K. Apt, H.A. Blair, and A. Walker. Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programming, pages 89\u2013142, 1987.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"K. Apt. Logic programming. Handbook of Theoretical Computer Science, pages 493\u2013574, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"22_CR3","unstructured":"M. Gelfond and V. Lifschitz. The stable semantics for logic programs. Proceedings of the 5th International Symposium on Logic Programming, pages 1070\u20131080, 1988."},{"key":"22_CR4","unstructured":"J. Grant and V.S. Subrahmanian. Reasoning about inconsistent knowledge bases. IEEE Trans. on Knowledge and Data Engineering, to appear."},{"key":"22_CR5","first-page":"33","volume":"173","author":"C.G. Jockusch","year":"1972","unstructured":"C.G. Jockusch and R.I. Soare. \u03c0 1 0 classes and degrees of theories. Transactions of American Mathematical Society, 173:33\u201356, 1972.","journal-title":"Transactions of American Mathematical Society"},{"key":"22_CR6","first-page":"253","volume":"IV","author":"M. Kifer","year":"1989","unstructured":"M. Kifer and E. Lozinskii. RI: A logic for reasoning about inconsistency. TARK IV, pages 253\u2013262, 1989.","journal-title":"TARK"},{"key":"22_CR7","unstructured":"W. Kohn and A. Nerode. Models for Hybrid Systems: Automata, Topologies, Controllability, Observability. In: Hybrid Systems, R.L. Grossman, A. Nerode, A.P. Ravn, H. Rischel, eds. Springer LN in CS 736, pages 317\u2013356, 1993."},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01531080","volume":"1","author":"W. Marek","year":"1990","unstructured":"W. Marek, A. Nerode, and J.B. Remmel. Nonmonotonic rule systems I. Annals of Mathematics and Artificial Intelligence, 1:241\u2013273, 1990.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01543477","volume":"5","author":"W. Marek","year":"1992","unstructured":"W. Marek, A. Nerode, and J. B. Remmel. Nonmonotonic rule systems II. Annals of Mathematics and Artificial Intelligence, 5:229\u2013263, 1992.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"22_CR10","first-page":"446","volume-title":"The stable models of predicate logic programs","author":"W. Marek","year":"1992","unstructured":"W. Marek, A. Nerode, and J. B. Remmel. The stable models of predicate logic programs. Proceedings of International Joint Conference and Symposium on Logic Programming, pages 446\u2013460, Boston, MA, 1992. MIT Press."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"W. Marek, A. Nerode, and J. B. Remmel. Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning, Proceedings of 10th Annual IEEE Symposium on Logic in Computer Science, pp. 178\u2013187, 1995.","DOI":"10.1109\/LICS.1995.523255"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0168-0072(94)90013-2","volume":"67","author":"W. Marek","year":"1994","unstructured":"W. Marek, A. Nerode, and J. B. Remmel. Context for Belief Revision: FC-Normal Nonmonotonic Rule Systems, Annals of Pure and Applied Logic 67(1994) pp. 269\u2013324.","journal-title":"Annals of Pure and Applied Logic"},{"key":"22_CR13","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\u0144ski. Autoepistemic logic. Journal of the ACM, 38:588\u2013619, 1991.","journal-title":"Journal of the ACM"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"W. Marek and M. Truszczy\u0144ski. Nonmonotonic Logic \u2014 Context-dependent reasonings 1993, Springer Verlag.","DOI":"10.1007\/978-3-662-02906-0"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"T. Przymusinski, On the declarative semantics of stratified deductive databases and logic programs, Foundations of Deductive Databases and Logic Programming, pages 193\u2013216, 1987.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"22_CR16","unstructured":"M. Reinfrank, O. Dressler, and G. Brewka. On the relation between truth maintenance and non-monotonic logics. Proceedings of IJCAI-89, pages 1206\u20131212."},{"key":"22_CR17","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:81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, K.A. Ross and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM 38(1991).","DOI":"10.1145\/116825.116838"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:13Z","timestamp":1605629713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}