{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:06:22Z","timestamp":1725570382750},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425939"},{"type":"electronic","value":"9783540454021"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45402-0_33","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T17:10:11Z","timestamp":1290186611000},"page":"411-415","source":"Crossref","is-referenced-by-count":2,"title":["plp: A Generic Compiler for Ordered Logic Programs"],"prefix":"10.1007","author":[{"given":"James P.","family":"Delgrande","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"issue":"1-2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0004-3702(99)00015-6","volume":"109","author":"G. Brewka","year":"1999","unstructured":"G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1-2):297\u2013356, 1999. 411, 412","journal-title":"Artificial Intelligence"},{"key":"33_CR2","unstructured":"J. Delgrande and T. Schaub. Compiling reasoning with and about preferences into default logic. In Proc. IJCAI-97, pages 168\u2013174. Morgan Kaufmann Publishers, 1997. 412"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"J. Delgrande, T. Schaub, and H. Tompits. A compilation of Brewka and Eiter\u2019s approach to prioritization. In Proc. JELIA-00, pages 376\u2013390. Springer Verlag, 2000.","DOI":"10.1007\/3-540-40006-0_26"},{"key":"33_CR4","unstructured":"J. Delgrande, T. Schaub, and H. Tompits. Logic programs with compiled preferences. In Proc. ECAI-00, pages 392\u2013398. IOS Press, 2000. 412, 413"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In Proc. LPNMR-97, pages 363\u2013374. Springer Verlag, 1997. 412","DOI":"10.1007\/3-540-63255-7_27"},{"key":"33_CR6","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 deductive databases. New Generation Computing, 9:365\u2013385, 1991. 411","journal-title":"New Generation Computing"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"M. Gelfond and T. Son. Reasoning with prioritized defaults. In Third International Workshop on Logic Programming and Knowledge Representation, pages 164\u2013223. Springer Verlag, 1997. 411","DOI":"10.1007\/BFb0054795"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4 and P. Simons. Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In Proc. LPNMR-97, pages 420\u2013429. Springer Verlag, 1997. 412","DOI":"10.1007\/3-540-63255-7_32"},{"key":"33_CR9","unstructured":"T. Schaub and K. Wang. A comparative study of logic programs with preference: Preliminary report. In Proc. AAAI Spring Symposium on Answer Set Programming, pages 151\u2013157. AAAI Press, 2001."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"K. Wang, L. Zhou, and F. Lin. Alternating fixpoint theory for logic programs with priority. In Proc. First International Conference on Computational Logic, pages 164\u2013178. Springer Verlag, 2000. 411, 412","DOI":"10.1007\/3-540-44957-4_11"},{"key":"33_CR11","unstructured":"Y. Zhang and N. Foo. Answer sets for prioritized logic programs. In Proc. ILPS-97, pages 69\u201384. MIT Press, 1997. 411"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45402-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:43:17Z","timestamp":1559806997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45402-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425939","9783540454021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45402-0_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}