Extended ASP Tableaux and rule redundancy in normal logic programs

DOI10.1017/S1471068408003578zbMath1156.68011OpenAlexW3103407543MaRDI QIDQ3546041

Matti Järvisalo, Emilia Oikarinen

Publication date: 18 December 2008

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068408003578

zbMATH Keywords

tableau methodproof complexityanswer set programmingproblem structureextension ruleExtended Resolution proof system

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Conflict-driven answer set solving: from theory to practice, Boosting Answer Set Optimization with Weighted Comparator Networks

Uses Software

• ASSAT

Cites Work

• Knowledge Representation, Reasoning and Declarative Problem Solving