{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:53:30Z","timestamp":1725566010146},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232421"},{"type":"electronic","value":"9783540302278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_6","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:34:52Z","timestamp":1284860092000},"page":"31-43","source":"Crossref","is-referenced-by-count":25,"title":["The CIFF Proof Procedure for Abductive Logic Programming with Constraints"],"prefix":"10.1007","author":[{"given":"U.","family":"Endriss","sequence":"first","affiliation":[]},{"given":"P.","family":"Mancarella","sequence":"additional","affiliation":[]},{"given":"F.","family":"Sadri","sequence":"additional","affiliation":[]},{"given":"G.","family":"Terreni","sequence":"additional","affiliation":[]},{"given":"F.","family":"Toni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol.\u00a01292, Springer, Heidelberg (1997)"},{"key":"6_CR2","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Logic and Data Bases, Plenum Press, New York (1978)"},{"key":"6_CR3","unstructured":"Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: The CIFF proof procedure: Definition and soundness results. Technical Report 2004\/2, Department of Computing, Imperial College London (May 2004)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0743-1066(97)00026-5","volume":"33","author":"T.H. Fung","year":"1997","unstructured":"Fung, T.H., Kowalski, R.A.: The IFF proof procedure for abductive logic programming. Journal of Logic Programming\u00a033(2), 151\u2013165 (1997)","journal-title":"Journal of Logic Programming"},{"key":"6_CR5","unstructured":"Kakas, A.C., Mancarella, P., Sadri, F., Stathis, K., Toni, F.: The KGP model of agency. In: Proc. ECAI 2004 (2004) (to appear)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0743-1066(99)00075-8","volume":"44","author":"A.C. Kakas","year":"2000","unstructured":"Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive constraint logic programming. Journal of Logic Programming\u00a044, 129\u2013177 (2000)","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Transactions on Programming Languages and Systems\u00a04(2), 258\u2013282 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-45619-8_3","volume-title":"Logic Programming","author":"A. Russo","year":"2002","unstructured":"Russo, A., Miller, R., Nuseibeh, B., Kramer, J.: An abductive approach for analysing event-based requirements specifications. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, p. 22. Springer, Heidelberg (2002)"},{"key":"6_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45757-7_35","volume-title":"Logics in Artificial Intelligence","author":"F. Sadri","year":"2002","unstructured":"Sadri, F., Toni, F., Torroni, P.: An abductive logic programming architecture for negotiating agents. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, p. 419. Springer, Heidelberg (2002)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0743-1066(99)00077-1","volume":"44","author":"M. Shanahan","year":"2000","unstructured":"Shanahan, M.: An abductive event calculus planner. Journal of Logic Programming\u00a044, 207\u2013239 (2000)","journal-title":"Journal of Logic Programming"},{"key":"6_CR11","unstructured":"Stathis, K., Kakas, A., Lu, W., Demetriou, N., Endriss, U., Bracciali, A.: PROSOCS: A platform for programming software agents in computational logic. In: Proc. AT2AI 2004 (2004)"},{"key":"6_CR12","unstructured":"Xanthakos, I.: Semantic Integration of Information by Abduction. PhD thesis, Department of Computing, Imperial College London (2003)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:58:14Z","timestamp":1620014294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}