Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs

DOI10.1007/978-3-540-74610-2_10MaRDI QIDQ3608651zbMATH OpenOpenAlexFDO

Authors Matti Järvisalo, Emilia Oikarinen

Publication date 5 March 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.4551

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Extended ASP Tableaux and rule redundancy in normal logic programs
• Tableau calculi for logic programs under answer set semantics
• Tableau Calculi for Answer Set Programming
• Generic Tableaux for Answer Set Programming
• Removing Redundancy from Answer Set Programs

Cited in

(7)

• On the relation among answer set solvers
• Tableau calculi for logic programs under answer set semantics
• Extended ASP Tableaux and rule redundancy in normal logic programs
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Tableau Calculi for Answer Set Programming
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• Removing Redundancy from Answer Set Programs

This page was built for publication: Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608651)