{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:20Z","timestamp":1725524600348},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540929949"},{"type":"electronic","value":"9783540929956"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92995-6_1","type":"book-chapter","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T14:02:58Z","timestamp":1231509778000},"page":"1-15","source":"Crossref","is-referenced-by-count":0,"title":["On Preferring and Inspecting Abductive Models"],"prefix":"10.1007","author":[{"given":"Lu\u00eds Moniz","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Pierangelo","family":"Dell\u2019Acqua","sequence":"additional","affiliation":[]},{"given":"Gon\u00e7alo","family":"Lopes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Brewka, G.: Logic programming with ordered disjunction. In: Kaufmann, M. (ed.) Proc. 18th National Conference on Artificial Intelligence, AAAI 2002 (2002)"},{"key":"1_CR2","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczynski, M.: Answer set optimization. In: Proc. IJCAI 2003, pp. 867\u2013872 (2003)"},{"key":"1_CR3","unstructured":"Castro, L., Swift, T., Warren, D.S.: XASP: Answer Set Programming with XSB and Smodels, http:\/\/xsb.sourceforge.net\/packages\/xasp.pdf"},{"key":"1_CR4","unstructured":"Castro, L.F., Warren, D.S.: An environment for the exploration of non monotonic logic programs. In: Kusalik, A. (ed.) Proc. of the 11th Intl. Workshop on Logic Programming Environments (WLPE 2001) (2001)"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.jal.2006.03.010","volume":"5","author":"P. Dell\u2019Acqua","year":"2007","unstructured":"Dell\u2019Acqua, P., Pereira, L.M.: Preferential theory revision. J. of Applied Logic\u00a05(4), 586\u2013601 (2007)","journal-title":"J. of Applied Logic"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1111\/j.0824-7935.2004.00233.x","volume":"20","author":"J. Doyle","year":"2004","unstructured":"Doyle, J.: Prospects for preferences. Computational Intelligence\u00a020(3), 111\u2013136 (2004)","journal-title":"Computational Intelligence"},{"issue":"2","key":"1_CR7","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.: The IFF Proof Procedure for Abductive Logic Programming. The J.\u00a0of Logic Programming\u00a033(2), 151\u2013165 (1997)","journal-title":"The J.\u00a0of Logic Programming"},{"key":"1_CR8","unstructured":"Neg-Abdual. Constructive Negation with Abduction, http:\/\/centria.di.fct.unl.pt\/~lmp\/software\/contrNeg.rar"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-63255-7_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Niemel\u00e4","year":"1997","unstructured":"Niemel\u00e4, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol.\u00a01265, pp. 420\u2013429. Springer, Heidelberg (1997)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-77002-2_7","volume-title":"Progress in Artificial Intelligence","author":"L.M. Pereira","year":"2007","unstructured":"Pereira, L.M., Lopes, G.: Prospective logic agents. In: Neves, J., Santos, M.F., Machado, J.M. (eds.) EPIA 2007. LNCS, vol.\u00a04874, pp. 73\u201386. Springer, Heidelberg (2007)"},{"key":"1_CR11","unstructured":"Pereira, L.M., Pinto, A.M.: Notes on Inspection Points and Meta-Abduction in Logic Programs. Work in progress (2008), http:\/\/centria.di.fct.unl.pt\/~lmp\/publications\/online-papers\/IP08.pdf"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-77002-2_9","volume-title":"Progress in Artificial Intelligence","author":"L.M. Pereira","year":"2007","unstructured":"Pereira, L.M., Saptawijaya, A.: Modelling morality with prospective logic. In: Neves, J., Santos, M.F., Machado, J.M. (eds.) EPIA 2007. LNCS (LNAI), vol.\u00a04874, pp. 99\u2013111. Springer, Heidelberg (2007)"},{"key":"1_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198503064.001.0001","volume-title":"Change, Choice and Inference","author":"H. Rott","year":"2001","unstructured":"Rott, H.: Change, Choice and Inference. Oxford University Press, Oxford (2001)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-46238-4_5","volume-title":"AI*IA 99:Advances in Artificial Intelligence","author":"F. Sadri","year":"2000","unstructured":"Sadri, F., Toni, F.: Abduction with Negation as Failure for Active and Reactive Rules. In: Lamma, E., Mello, P. (eds.) AI*IA 1999. LNCS (LNAI), vol.\u00a01792, pp. 49\u201360. Springer, Heidelberg (2000)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11779568_11","volume-title":"Advances in Applied Artificial Intelligence","author":"P. Santana","year":"2006","unstructured":"Santana, P., Moniz Pereira, L.: Emergence of cooperation through mutual preference revision. In: Ali, M., Dapoigny, R. (eds.) IEA\/AIE 2006. LNCS (LNAI), vol.\u00a04031, pp. 81\u201390. Springer, Heidelberg (2006)"},{"issue":"3-4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1018990308362","volume":"25","author":"T. Swift","year":"1999","unstructured":"Swift, T.: Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 201\u2013240 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92995-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T22:46:39Z","timestamp":1709937999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92995-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540929949","9783540929956"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92995-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}