Large-Scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference

Authors:
Naoya Inoue;Kentaro Inui
Affiliations:
Tohoku University, Sendai, Japan;Tohoku University, Sendai, Japan
Venue:
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Year:
2012

Citing 18
Cited 1

The computational complexity of abduction

Artificial Intelligence - Special issue on knowledge representation
Interpretation as abduction

Artificial Intelligence - Special volume on natural language processing
A linear constraint satisfaction approach to cost-based abduction

Artificial Intelligence
Logic programming, abduction and probability: a top-down anytime algorithm for estimating prior and posterior probabilities

Selected papers of international conference on Fifth generation computer systems 92
SL Method for Computing a Near-Optimal Solution Using Linear and Non-linear Programming in Cost-Based Hypothetical Reasoning

PRICAI '98 Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Ontological promiscuity

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Markov logic networks

Machine Learning
Incremental integer linear programming for non-projective dependency parsing

EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Cutting-plane training of structural SVMs

Machine Learning
Robust textual inference via learning and abductive reasoning

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Wide-coverage semantic analysis with Boxer

STEP '08 Proceedings of the 2008 Conference on Semantics in Text Processing
Unsupervised learning of narrative schemas and their participants

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
A probabilistic model of plan recognition

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Learning first-order Horn clauses from web text

EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Global learning of typed entailment rules

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Unsupervised discovery of domain-specific knowledge from text

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Implementing weighted abduction in Markov logic

IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
Abductive reasoning with a large knowledge base for discourse processing

IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics

Discriminative learning of first-order weighted abduction from partial discourse explanations

CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abduction is inference to the best explanation. Abduction has long been studied intensively in a wide range of contexts, from artificial intelligence research to cognitive science. While recent advances in large-scale knowledge acquisition warrant applying abduction with large knowledge bases to real-life problems, as of yet no existing approach to abduction has achieved both the efficiency and formal expressiveness necessary to be a practical solution for large-scale reasoning on real-life problems. The contributions of our work are the following: (i) we reformulate abduction as an Integer Linear Programming (ILP) optimization problem, providing full support for first-order predicate logic (FOPL); (ii) we employ Cutting Plane Inference, which is an iterative optimization strategy developed in Operations Research for making abductive reasoning in full-fledged FOPL tractable, showing its efficiency on a real-life dataset; (iii) the abductive inference engine presented in this paper is made publicly available.