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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Charniak, E., Goldman, R.P.: A Probabilistic Model of Plan Recognition. In: AAAI, pp. 160–165 (1991)
Hobbs, J.R., Stickel, M., Martin, P., Edwards, D.: Interpretation as abduction. Artificial Intelligence 63, 69–142 (1993)
Shanahan, M.: Perception as Abduction: Turning Sensor Data Into Meaningful Representation. Cognitive Science 29(1), 103–134 (2005)
Peraldi, S.E., Kaya, A., Melzer, S., Möller, R., Wessel, M.: Multimedia Interpretation as Abduction. In: Int’l Workshop on Description Logics (2007)
Fellbaum, C. (ed.): WordNet: an electronic lexical database. MIT Press (1998)
Ruppenhofer, J., Ellsworth, M., Petruck, M., Johnson, C., Scheffczyk, J.: FrameNet II: Extended Theory and Practice. Technical report, Berkeley, USA (2010)
Chambers, N., Jurafsky, D.: Unsupervised Learning of Narrative Schemas and their Participants. In: ACL, pp. 602–610 (2009)
Schoenmackers, S., Davis, J., Etzioni, O., Weld, D.: Learning First-order Horn Clauses from Web Text. In: EMNLP, pp. 1088–1098 (2010)
Hovy, D., Zhang, C., Hovy, E., Penas, A.: Unsupervised discovery of domain-specific knowledge from text. In: ACL, pp. 1466–1475 (2011)
Ovchinnikova, E., Montazeri, N., Alexandrov, T., Hobbs, J.R., McCord, M., Mulkar-Mehta, R.: Abductive Reasoning with a Large Knowledge Base for Discourse Processing. In: IWCS, Oxford, UK, pp. 225–234 (2011)
Dagan, I., Dolan, B., Magnini, B., Roth, D.: Recognizing textual entailment: Rational, evaluation and approaches - Erratum. NLEÂ 16(1), 105 (2010)
Bylander, T., Allemang, D., Tanner, M.C., Josephson, J.R.: The computational complexity of abduction. Artificial Intelligence 49(1-3), 25–60 (1991)
Mulkar, R., Hobbs, J., Hovy, E.: Learning from Reading Syntactically Complex Biology Texts. In: Commonsense, Palo Alto (2007)
Poole, D.: Logic Programming, Abduction and Probability: a top-down anytime algorithm for estimating prior and posterior probabilities. New Generation Computing 11(3-4), 377–400 (1993)
Ishizuka, M., Matsuo, Y.: SL Method for Computing a Near-optimal Solution using Linear and Non-linear Programming in Cost-based Hypothetical Reasoning. In: PRCAI, pp. 611–625 (1998)
Chivers, S.T., Tagliarini, G.A., Abdelbar, A.M.: An Evolutionary Optimization Approach to Cost-Based Abduction, with Comparison to PSO. In: IJCNN, pp. 2926–2930 (2007)
Santos, E.: A linear constraint satisfaction approach to cost-based abduction. Artificial Intelligence 65 (1), 1–27 (1994)
Inoue, N., Inui, K.: ILP-Based Reasoning for Weighted Abduction. In: AAAI Workshop on Plan, Activity and Intent Recognition (2011)
Raina, R., Ng, A.Y., Manning, C.D.: Robust textual inference via learning and abductive reasoning. In: AAAI (2005)
Stern, A., Dagan, I.: A confidence model for syntactically-motivated entailment proofs. In: ACL, pp. 455–462 (2011)
Dantzig, G.B., Fulkerson, R., Johnson, S.M.: Solution of a large-scale traveling salesman problem. Operations Research 2(4), 393–410 (1954)
Riedel, S., Clarke, J.: Incremental Integer Linear Programming for Non-projective Dependency Parsing. In: EMNLP, pp. 129–137 (2006)
Riedel, S.: Improving the Accuracy and Efficiency of MAP Inference for Markov Logic. In: UAI, pp. 468–475 (2008)
Joachims, T., Finley, T., Yu, C.J.: Cutting-plane training of structural svms. In: Machine Learning, pp. 27–59 (2009)
Berant, J., Aviv, T., Goldberger, J.: Global Learning of Typed Entailment Rules. In: ACL, pp. 610–619 (2008)
Kate, R.J., Mooney, R.J.: Probabilistic Abduction using Markov Logic Networks. In: PAIRS (2009)
Raghavan, S., Mooney, R.J.: Bayesian Abductive Logic Programs. In: STARAI, pp. 82–87 (2010)
Singla, P., Domingos, P.: Abductive Markov Logic for Plan Recognition. In: AAAI, pp. 1069–1075 (2011)
Blythe, J., Hobbs, J.R., Domingos, P., Kate, R.J., Mooney, R.J.: Implementing Weighted Abduction in Markov Logic. In: IWCS, Oxford, UK, pp. 55–64 (2011)
Richardson, M., Domingos, P.: Markov logic networks. In: ML, pp. 107–136 (2006)
Ng, H.T., Mooney, R.J.: Abductive Plan Recognition and Diagnosis: A Comprehensive Empirical Evaluation. In: KR, pp. 499–508 (1992)
Hobbs, J.R.: Ontological promiscuity. In: ACL, Chicago, Illinois, pp. 61–69 (1985)
Bos, J.: Wide-Coverage Semantic Analysis with Boxer. In: STEP, pp. 277–286 (2008)
Prendinger, H., Ishizuka, M.: First-Order Diagnosis by Propositional Reasoning: A Representation-Based Approach. In: DX, pp. 220–225 (1999)
Abdelbar, A.M., Hefny, M.: An efficient lp-based admissible heuristic for cost-based abduction. JETAI 17(3), 297–303 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inoue, N., Inui, K. (2012). Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-33353-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33352-1
Online ISBN: 978-3-642-33353-8
eBook Packages: Computer ScienceComputer Science (R0)