TY - JOUR A1 - Gebser, Martin A1 - Schaub, Torsten H. T1 - Tableau calculi for logic programs under answer set semantics JF - ACM transactions on computational logic N2 - We introduce formal proof systems based on tableau methods for analyzing computations in Answer Set Programming (ASP). Our approach furnishes fine-grained instruments for characterizing operations as well as strategies of ASP solvers. The granularity is detailed enough to capture a variety of propagation and choice methods of algorithms used for ASP solving, also incorporating SAT-based and conflict-driven learning approaches to some extent. This provides us with a uniform setting for identifying and comparing fundamental properties of ASP solving approaches. In particular, we investigate their proof complexities and show that the run-times of best-case computations can vary exponentially between different existing ASP solvers. Apart from providing a framework for comparing ASP solving approaches, our characterizations also contribute to their understanding by pinning down the constitutive atomic operations. Furthermore, our framework is flexible enough to integrate new inference patterns, and so to study their relation to existing ones. To this end, we generalize our approach and provide an extensible basis aiming at a modular incorporation of additional language constructs. This is exemplified by augmenting our basic tableau methods with cardinality constraints and disjunctions. KW - Theory KW - Answer Set Programming KW - tableau calculi KW - proof complexity Y1 - 2013 U6 - https://doi.org/10.1145/2480759.2480767 SN - 1529-3785 VL - 14 IS - 2 PB - Association for Computing Machinery CY - New York ER -