{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:38Z","timestamp":1725565418443},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_11","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"149-164","source":"Crossref","is-referenced-by-count":1,"title":["Limiting Resolution: From Foundations to Implementation"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Caldon","sequence":"first","affiliation":[]},{"given":"Eric","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Entailment: The Logic of Relevance and Necessity","author":"A. Anderson","year":"1975","unstructured":"Anderson, A., Belnap, N.: Entailment: The Logic of Relevance and Necessity. Princeton University Press, Princeton (1975)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19\/20","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Bol, R.: Logic Programming and Negation: A Survey. J. of Logic Programming.\u00a019\/20, 9\u201371 (1994)","journal-title":"J. of Logic Programming."},{"key":"11_CR3","first-page":"293","volume-title":"Logic and Databases","author":"K. Clark","year":"1978","unstructured":"Clark, K.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled Evaluation with Delaying for General Logic Programs. J. of the ACM\u00a043(1), 20\u201374 (1996)","journal-title":"J. of the ACM"},{"key":"11_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. M.I.T. Press, Cambridge (1990)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Gold, E.: Language Identification in the Limit. Information and Control\u00a010 (1967)","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55844-6_141","volume-title":"Programming Language Implementation and Logic Programming","author":"C. Holzbaur","year":"1992","unstructured":"Holzbaur, C.: Metastructures vs. attributed variables in the context of extensible unification. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, Springer, Heidelberg (1992)"},{"key":"11_CR8","unstructured":"Israel, D.J.: What\u2019s wrong with nonmonotonic logic. In: Proc. of the First National Conference on Artificial Intelligence, pp. 99\u2013101 (1980)"},{"key":"11_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn, 2nd edn. M.I.T. Press, Cambridge (1999)","edition":"2"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. Artificial Intelligence\u00a044, 167\u2013207 (1990)","journal-title":"Artificial Intelligence"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K.: Negation in logic programming. J. of Logic Prog.\u00a04, 289\u2013308 (1987)","journal-title":"J. of Logic Prog."},{"key":"11_CR12","unstructured":"Le, T.: A general scheme for representing negative and quantified queries for deductive databases. In: Proc. of the First Int. Conf. on Information and Knowledge Management. Baltimore, Maryland (1992)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W., Topor, R.W.: Making Prolog more expressive. J. of Logic Programming\u00a01(3), 225\u2013240 (1984)","journal-title":"J. of Logic Programming"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45619-8_17","volume-title":"Logic Programming","author":"\u00c9. Martin","year":"2002","unstructured":"Martin, \u00c9., Nguyen, P., Sharma, A., Stephan, F.: Learning in Logic with Rich- Prolog. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, p. 239. Springer, Heidelberg (2002)"},{"key":"11_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-45650-3_21","volume-title":"Discovery Science","author":"E. Martin","year":"2001","unstructured":"Martin, E., Sharma, A., Stephan, F.: A General Theory of Deduction, Induction, and Learning. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol.\u00a02226, p. 228. Springer, Heidelberg (2001)"},{"key":"11_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-36169-3_21","volume-title":"Algorithmic Learning Theory","author":"E. Martin","year":"2002","unstructured":"Martin, E., Sharma, A., Stephan, F.: Logic, Learning, and Topology in a Common Framework. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol.\u00a02533, pp. 248\u2013262. Springer, Heidelberg (2002)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19\/20","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S., de Raedt, L.: Inductive Logic Programming: Theory and Methods. J. of Logic Programming.\u00a019\/20, 629\u2013679 (1994)","journal-title":"J. of Logic Programming."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1983","unstructured":"Mycroft, A., O\u2019Keefe, R.A.: A Polymorphic Type System for Prolog. Artificial Intelligence\u00a023, 295\u2013307 (1983)","journal-title":"Artificial Intelligence"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1111\/j.1467-8640.1986.tb00083.x","volume":"2","author":"D. Perlis","year":"1986","unstructured":"Perlis, D.: On the Consistency of Commonsense Reasoning. Computational Intelligence\u00a02, 180\u2013190 (1986)","journal-title":"Computational Intelligence"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00243002","volume":"5","author":"T.C. Przymusinski","year":"1989","unstructured":"Przymusinski, T.C.: On the declarative and procedural semantics of logic programs. J. of Automated Reasoning.\u00a05, 167\u2013205 (1989)","journal-title":"J. of Automated Reasoning."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(89)90106-0","volume":"65","author":"J.C. Shepherdson","year":"1989","unstructured":"Shepherdson, J.C.: A sound and complete semantics for a version of negation as failure. Theoretical Computer Science\u00a065, 343\u2013371 (1989)","journal-title":"Theoretical Computer Science"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/3-540-55460-2_37","volume-title":"Logic Programming","author":"A. Voronkov","year":"1992","unstructured":"Voronkov, A.: Logic programming with bounded quantifiers. In: Voronkov, A. (ed.) RCLP 1990 and RCLP 1991. LNCS, vol.\u00a0592, pp. 486\u2013514. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:24:32Z","timestamp":1620012272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}