{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:05Z","timestamp":1747546925530},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667490"},{"type":"electronic","value":"9783540467670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46767-x_3","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:51Z","timestamp":1269897171000},"page":"34-48","source":"Crossref","is-referenced-by-count":3,"title":["Locally Determined Logic Programs"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Cenzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B.","family":"Remmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amy","family":"Vanderbilt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"3_CR1","first-page":"3","volume":"4","author":"A. H","year":"1978","unstructured":"H. Andreka, I. Nemeti. The Generalized Completeness of Horn Predicate Logic as a Programming Language. Acta Cybernetica 4(1978) pp. 3\u201310.","journal-title":"Acta Cybernetica"},{"key":"3_CR2","volume-title":"Handbook of Theoretical Computer Science","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt. Logic programming.Handbook of Theoretical Computer Science (J. van Leeuven, ed.), Cambridge, MA: MIT Press, 1990."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1990-13103","volume":"13","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt, H. A. Blair. Arithmetical Classification of Perfect Models of Stratified Programs. Fundamenta Informaticae 13 (1990) pp. 1\u201317.","journal-title":"Fundamenta Informaticae"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.2307\/2272247","volume":"41","author":"D.R. Bean","year":"1976","unstructured":"D.R. Bean. Effective Coloration. Journal of Symbolic Logic 41(1976) pp. 469\u2013480.","journal-title":"Journal of Symbolic Logic"},{"key":"3_CR5","unstructured":"D. Cenzer and J.B. Remmel. II stack0 stack1-classes in Mathematics. Handbook of Recursive Mathematics: Volume 2 (Yu. L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel, eds.) Studies in Logic and the Foundations of Mathematics, vol. 139: 623\u2013822, Elsevier, 1998."},{"key":"3_CR6","unstructured":"M. Gelfond and V. Lifschitz. The stable semantics for logic programs. Proceedings of the 5th International Sympposium on Logic Programming, MIT Press, pp. 1070\u20131080, 1988."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0168-0072(92)90069-C","volume":"56","author":"W. Marek","year":"1992","unstructured":"W. Marek, A. Nerode, and J. B. Remmel. How complicated is the set of stable models of a recursive logic program? Annals of Pure and Applied Logic, 56 (1992), pp. 119\u2013135.","journal-title":"Annals of Pure and Applied Logic"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0743-1066(14)80008-3","volume":"21","author":"W. Marek","year":"1994","unstructured":"W. Marek, A. Nerode, and J. B. Remmel. The stable models of predicate logic programs. Journal of Logic Programming, 21 (1994), pp. 129\u2013154.","journal-title":"Journal of Logic Programming"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0168-0072(94)90013-2","volume":"67","author":"Marek W.","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":"3_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"Reiter. R","year":"1980","unstructured":"R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1980), pp. 81\u2013132.","journal-title":"Artificial Intelligence"},{"key":"3_CR11","unstructured":"R.M. Smullyan. Theory of Formal Systems, Annals of Mathematics Studies, no. 47, Princeton, N.J."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46767-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T08:12:06Z","timestamp":1635149526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46767-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667490","9783540467670"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46767-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}