<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/diego_ma/abduction"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/diego_ma/abduction</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2761cd76bc606ec748ce0f4badbcd5457/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2761cd76bc606ec748ce0f4badbcd5457/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs/0310047"/><swrc:date>Fri Dec 14 02:44:58 CET 2007</swrc:date><swrc:note>Submitted to \emph{Theory and Practice of Logic Programming}</swrc:note><swrc:title>Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation</swrc:title><swrc:year>2003</swrc:year><swrc:keywords>abduction </swrc:keywords><swrc:abstract>Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study \emph{abduction with penalization} in the logic programming framework. This form of abductive reasoning, which has not been previously analyzed in logic programming, turns out to represent several relevant problems, including optimization problems, very naturally. We define a formal model for abduction with penalization over logic programs, which extends the abductive framework proposed by Kakas and Mancarella. We address knowledge representation issues, encoding a number of problems in our abductive framework. In particular, we consider some relevant problems, taken from different domains, ranging from optimization theory to diagnosis and planning; their encodings turn out to be simple and elegant in our formalism. We thoroughly analyze the computational complexity of the main problems arising in the context of abduction with penalization from logic programs. Finally, we implement a system supporting the proposed abductive framework on top of the DLV engine. To this end, we design a translation from abduction problems with penalties into logic programs with weak constraints. We prove that this approach is sound and complete.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Simona Perri"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Francesco Scarcello"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Nicola Leone"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2ed158c52e3a7820cb5a2cf84b709fbc1/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2ed158c52e3a7820cb5a2cf84b709fbc1/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Fri Dec 14 02:44:11 CET 2007</swrc:date><swrc:booktitle>Working Notes of the {IJCAI}-97 Workshop on Abduction and Induction in {AI}</swrc:booktitle><swrc:title>Integrating Abduction in Machine Learning</swrc:title><swrc:year>1997</swrc:year><swrc:keywords>abduction induction </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Raymond J. Mooney"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/217d59263b48200b0dac50c18e43268c1/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/217d59263b48200b0dac50c18e43268c1/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Fri Dec 14 02:40:41 CET 2007</swrc:date><swrc:journal>Artificial Intelligence</swrc:journal><swrc:pages>69-142</swrc:pages><swrc:title>Interpretation as Abduction</swrc:title><swrc:volume>63</swrc:volume><swrc:year>1993</swrc:year><swrc:keywords>abduction NLP </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jerry R. Hobbs"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Mark E. Stickel"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Douglas E. Appelt"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Paul Martin"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2d44cd06980835f79332fe4c4b569194c/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2d44cd06980835f79332fe4c4b569194c/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://www.coling.uni-freiburg.de/{\~{}}neuhaus/papers/pnbib.html"/><swrc:date>Fri Dec 14 02:40:33 CET 2007</swrc:date><swrc:title>The Origin and Evolution of Language: A Plausible, Strong-{AI} Account</swrc:title><swrc:year>1996</swrc:year><swrc:keywords>evolution reification abduction </swrc:keywords><swrc:abstract>No abstract</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jerry R. Hobbs"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2d0b49de18540c413f1abc827714e02c5/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2d0b49de18540c413f1abc827714e02c5/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://citeseer.nj.nec.com/harabagiu99finding.html"/><swrc:date>Fri Dec 14 02:39:58 CET 2007</swrc:date><swrc:booktitle>Proc. AAAI Fall Symposium on Question Answering Systems</swrc:booktitle><swrc:pages>63-71</swrc:pages><swrc:title>Finding Answers in Large Collections of Texts: Paragraph Indexing + Abductive Inference</swrc:title><swrc:year>1999</swrc:year><swrc:keywords>question_answering abduction </swrc:keywords><swrc:abstract>This paper describes a methodology of answering questions by using information retrieved from very large collections of texts. We argue that combinations of information retrieval and extractions techniques cannot be used, due to the open-domain nature of the task. We propose a solution based on indexing techniques that identify paragraphs from texts where the answers can be found. The validity of the answers is obtained through a lightweight process of abduction.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sanda M. Harabagiu"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Steven J. Maiorano"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>
