Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains

DOI10.1007/978-3-540-72200-7_12zbMath1149.68331OpenAlexW1596251829MaRDI QIDQ5425403

Stefan Woltran, Hans Tompits, Michael Fink, Reinhard Pichler

Publication date: 13 November 2007

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72200-7_12

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Quantified Equilibrium Logic and Foundations for Answer Set Programs

This page was built for publication: Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains