Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. Issue 5 (September 2021)

• Record Type: Journal Article
• Authors: BESIN, VIKTOR; HECHER, MARKUS; WOLTRAN, STEFAN
• Is Part Of: Theory and practice of logic programming. Volume 21:Issue 5(2021)
• Page Start: 575
• Page End: 592
• Publication Date: 2021-09
• Subjects: epistemic logic programming -- treewidth -- tree decompositions -- abstractions -- hybrid solving -- nested dynamic programming; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068421000399
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: Extending the popular answer set programming paradigm by introspective reasoning capacities has received increasing interest within the last years. Particular attention is given to the formalism of epistemic logic programs (ELPs) where standard rules are equipped with modal operators which allow to express conditions on literals for being known or possible, that is, contained in all or some answer sets, respectively. ELPs thus deliver multiple collections of answer sets, known as world views. Employing ELPs for reasoning problems so far has mainly been restricted to standard decision problems (complexity analysis) and enumeration (development of systems) of world views. In this paper, we take a next step and contribute to epistemic logic programming in two ways: First, we establish quantitative reasoning for ELPs, where the acceptance of a certain set of literals depends on the number (proportion) of world views that are compatible with the set. Second, we present a novel system that is capable of efficiently solving the underlying counting problems required to answer such quantitative reasoning problems. Our system exploits the graph-based measure treewidth and works by iteratively finding and refining (graph) abstractions of an ELP program. On top of these abstractions, we apply dynamic programming that is combined with utilizing existing search-based solvers like (e)clingo for hard combinatorial subproblems that appear during solving. It turns out that our approach is competitive with existing systems that were introduced recently.