Complexity of rule redundancy in non-ground answer-set programming over finite domains

Authors:
Michael Fink;Reinhard Pichler;Hans Tompits;Stefan Woltran
Affiliations:
Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria;Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria;Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria;Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria
Venue:
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Year:
2007

Citing 10
Cited 4

Explicit representation of terms defined by counter examples

Journal of Automated Reasoning
Sufficient-completeness, ground-reducibility and their complexity

Acta Informatica
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Equivalence in Answer Set Programming

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
On the Complexity of H-Subsumption

Proceedings of the 12th International Workshop on Computer Science Logic
Comparisons and computation of well-founded semantics for disjunctive logic programs

ACM Transactions on Computational Logic (TOCL)
Strong and uniform equivalence in answer-set programming: characterizations and complexity results for the non-ground case

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Discovering classes of strongly equivalent logic programs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Equilibrium Logic and Foundations for Answer Set Programs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Logic programming for knowledge representation

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Minimal logic programs

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Equivalence between extended datalog programs -- a brief survey

Datalog'10 Proceedings of the First international conference on Datalog Reloaded

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particular relevant in practice when programs with variables are considered, where such transformations play a basic role in (offline) simplifications of logic programs. So far, such transformations of non-ground programs have been considered under the implicit assumption that the domain (i.e., the set of constants of the underlying language) is always suitably extensible. However, this may not be a desired scenario, e.g., if one needs to deal with a fixed number of objects. In this paper, we investigate how an explicit restriction of the domain influences the applicability of program transformations and we study in detail computational aspects for the concepts of tautological rules and rule subsumption. More precisely, we provide a full picture of the complexity to decide whether a non-ground rule is tautological or subsumed by another rule under several restrictions.