Modeling variations of first-order Horn abduction in answer set programming

DOI10.3233/FI-2016-1446zbMATH Open1373.68393arXiv1512.08899MaRDI QIDQ4589246FDOQ4589246

Authors: Peter Schüller 

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Abstract: We study abduction in First Order Horn logic theories where all atoms can be abduced and we are looking for preferred solutions with respect to three objective functions: cardinality minimality, coherence, and weighted abduction. We represent this reasoning problem in Answer Set Programming (ASP), in order to obtain a flexible framework for experimenting with global constraints and objective functions, and to test the boundaries of what is possible with ASP. Realizing this problem in ASP is challenging as it requires value invention and equivalence between certain constants, because the Unique Names Assumption does not hold in general. To permit reasoning in cyclic theories, we formally describe fine-grained variations of limiting Skolemization. We identify term equivalence as a main instantiation bottleneck, and improve the efficiency of our approach with on-demand constraints that were used to eliminate the same bottleneck in state-of-the-art solvers. We evaluate our approach experimentally on the ACCEL benchmark for plan recognition in Natural Language Understanding. Our encodings are publicly available, modular, and our approach is more efficient than state-of-the-art solvers on the ACCEL benchmark.

Full work available at URL: https://arxiv.org/abs/1512.08899

Recommendations

• First-order abduction as enumeration of stable models
• Abduction from logic programs: Semantics and complexity
• Abductive logic programs with penalization: semantics, complexity and implementation
• Large-scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference
• Towards Abductive Reasoning in First-order Logic

zbMATH Keywords

answer set programmingfirst-order Horn abductionnatural-language understandingweighted abduction

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Natural language processing (68T50)

Cited In (2)

• DualGrounder: lazy instantiation via clingo multi-shot framework
• The External Interface for Extending WASP

This page was built for publication: Modeling variations of first-order Horn abduction in answer set programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589246)