Filters








20,257 Hits in 2.8 sec

AbductionRules: Training Transformers to Explain Unexpected Inputs [article]

Nathan Young, Qiming Bao, Joshua Bensemann, Michael Witbrock
2022 arXiv   pre-print
We present AbductionRules, a group of natural language datasets designed to train and test generalisable abduction over natural-language knowledge bases.  ...  Transformers have recently been shown to be capable of reliably performing logical reasoning over facts and rules expressed in natural language, but abductive reasoning - inference to the best explanation  ...  We believe our results are promising and demonstrate the viability of Transformer-based abduction (and logical reasoning in general), but also indicate opportunities for improvement.  ... 
arXiv:2203.12186v1 fatcat:o6fahqdyw5fwrkoixmfbru3nwi

Semantics and complexity of abduction from default theories

Thomas Eiter, Georg Gottlob, Nicola Leone
1997 Artificial Intelligence  
(i.e., knowledge bases) of nonclassical logics.  ...  Since logical knowledge representation is commonly based on nonclassical formalisms like default logic, autoepistemic logic, or circumscription, it is necessary to perform abductive reasoning from theories  ...  Acknowledgements The authors would like to thank a referee for his helpful comments on this paper.  ... 
doi:10.1016/s0004-3702(96)00040-9 fatcat:xw4ygt4ecbbkbk5zmerxfch56a

Abduction from logic programs: Semantics and complexity

Thomas Eiter, Georg Gottlob, Nicola Leone
1997 Theoretical Computer Science  
Abduction ~ from observations and a theory, find using hypotheses an explanation for the * Corresponding  ...  Acknowledgements The authors would like to thank the referees for their valuable and instructive comments that helped to improve the presentation of this paper.  ...  In particular, Section 3.2 was proposed by a referee; it greatly improves understanding of the relationships between the different abduction problems investigated, and simplified proofs.  ... 
doi:10.1016/s0304-3975(96)00179-x fatcat:tks5uin32fcxhibfmrrar54fqu

Page 7826 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
The semantics of the logic is based on the Dempster rule of conditioning for possibility the- ory.  ...  In this paper, we show that complex planning strategies find natural logic-based formulations and efficient implementa- tions in the framework of deductive database languages.  ... 

Page 7066 of Mathematical Reviews Vol. , Issue 99j [page]

1999 Mathematical Reviews  
The result of this paper can be used not only for refinement of domain descriptions but also for abductive planning, prediction and explanation.  ...  Based on the paradigm of argumentation, an abductive semantic framework for disjunctive logic programming is presented, in which the disjunc- tions of negative literals are taken as possible assumptions  ... 

Combining Axiom Injection and Knowledge Base Completion for Efficient Natural Language Inference [article]

Masashi Yoshikawa, Koji Mineshima, Hiroshi Noji, Daisuke Bekki
2018 arXiv   pre-print
In this work, we show the processing time of a state-of-the-art logic-based RTE system can be significantly reduced by replacing its search-based axiom injection (abduction) mechanism by that based on  ...  In logic-based approaches to reasoning tasks such as Recognizing Textual Entailment (RTE), it is important for a system to have a large amount of knowledge data.  ...  We are also grateful to Bevan Johns for proofreading examples in LexSICK dataset and Hitoshi Manabe for his public codebase from which we learned many about the KBC techniques.  ... 
arXiv:1811.06203v1 fatcat:kacd6r7cangtfelnvkowt5g5ai

Combining Axiom Injection and Knowledge Base Completion for Efficient Natural Language Inference

Masashi Yoshikawa, Koji Mineshima, Hiroshi Noji, Daisuke Bekki
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In this work, we show the processing time of a state-of-the-art logic-based RTE system can be significantly reduced by replacing its search-based axiom injection (abduction) mechanism by that based on  ...  In logic-based approaches to reasoning tasks such as Recognizing Textual Entailment (RTE), it is important for a system to have a large amount of knowledge data.  ...  We are also grateful to Bevan Johns for proofreading examples in LexSICK dataset and Hitoshi Manabe for his public codebase from which we learned many about the KBC techniques.  ... 
doi:10.1609/aaai.v33i01.33017410 fatcat:3aic4w6zpffe5h65bjiadqvq2q

Abductive Knowledge Induction From Raw Data [article]

Wang-Zhou Dai, Stephen H. Muggleton
2021 arXiv   pre-print
In this paper, we present Abductive Meta-Interpretive Learning (Meta_Abd) that unites abduction and induction to learn neural networks and induce logic theories jointly from raw data.  ...  Experimental results demonstrate that Meta_Abd not only outperforms the compared systems in predictive accuracy and data efficiency but also induces logic programs that can be re-used as background knowledge  ...  The authors thank Céline Hocquette, Stassa Patsantzis and Ai Lun for their careful proofreading and helpful comments.  ... 
arXiv:2010.03514v2 fatcat:6mtsp6ucvnafnme47sama6vuru

The complexity of logic-based abduction

Thomas Eiter, Georg Gottlob
1995 Journal of the ACM  
Our results indicate that abduction is harder than deduction.  ...  Regarding specifically logic-based abduction, THEORIST by Poole [62] is a framework for abductive and default reasoning and can be used for diagnosis [63] and other problem solving activities [61].  ...  Wagner for sending papers.  ... 
doi:10.1145/200836.200838 fatcat:5vu3leoqmrekdnwuprtckloy2i

The complexity of logic-based abduction [chapter]

Thomas Eiter, Georg Gottlob
1993 Lecture Notes in Computer Science  
Our results indicate that abduction is harder than deduction.  ...  Regarding specifically logic-based abduction, THEORIST by Poole [62] is a framework for abductive and default reasoning and can be used for diagnosis [63] and other problem solving activities [61].  ...  Wagner for sending papers.  ... 
doi:10.1007/3-540-56503-5_10 fatcat:e22s3zoqtvcvdijempogaqmpga

Page 5785 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
In this work it is shown how it can be used for abductive reasoning. It is also proven that the proposed method is strictly more powerful than existing methods for abduction in logic programming.”  ...  results for the unrestricted problems.  ... 

Page 501 of Mathematical Reviews Vol. , Issue 99a [page]

1991 Mathematical Reviews  
The main results are that the above abductive reasoning tasks on propositional logic programs populate the classes at the lower end of the polynomial hierarchy up to Z', and provide complete problems for  ...  This proves abduction from logic programs to be a rich source of problems of varying complexity.” 99a:68029 68N17 Garcia de la Banda, Maria (5-MNSH-C; Clayton); Marriott, Kim (5-MNSH-C; Clayton); Stuckey  ... 

Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation

Maciej Komosinski, Adam Kups, Dorota Leszczyńska-Jasion, Mariusz Urbański
2014 ACM Transactions on Computational Logic  
In this article, results of the automation of an abductive procedure are reported.  ...  To comprehend the abductive procedure and the evaluation process more extensively, analyses have been conducted on a number of artificially generated abductive problems.  ...  The criterion of Operational Complexity added to the three "basic" criteria could probably yield more varied results for more complex formulas.  ... 
doi:10.1145/2629669 fatcat:it6u6iiqz5ennfwuuicb2tnwha

Page 3389 of Mathematical Reviews Vol. , Issue 92f [page]

1992 Mathematical Reviews  
Summary: “In this paper we introduce a semantic framework for autoepistemic logics, based on the theory of semi-inductive pro- cesses.  ...  “One difficulty that arises in developing parsimonious covering theory and other models of abductive diagnosis is the compu- tational complexity involved.  ... 

Page 2652 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
{For the entire collection see MR 2001b:68002. } 2001d:68054 68N17 68Q55 Wang, Kewen (PRC-TSI-CT; Beijing) Argumentation-based abduction in disjunctive logic programming. (English summary) J.  ...  Due to the presence of integrity constraints, alternative revision of the knowl- edge base may result from an update.  ... 
« Previous Showing results 1 — 15 out of 20,257 results