Guarded resolution for answer set programming

DOI10.1017/S1471068410000062MaRDI QIDQ3087811zbMATH OpenFDO

Authors Wiktor Marek, Jeffrey Remmel

Publication date 17 August 2011

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

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

zbMATH Keywords

Gelfond-Lifschitz operatorguarded atomsguarded Horn clausesguarded resolutionpositive unit resolutionproof-theory for answer set programmingstable semantics of logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 6536279
• Logic Programming and Nonmonotonic Reasoning
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• Open answer set programming with guarded programs
• Stable models and circumscription

Cited in

(6)

• scientific article; zbMATH DE number 1696822 (Why is no real title available?)
• Disjunctive Programs with Set Constraints
• Open answer set programming with guarded programs
• Logic Programming and Nonmonotonic Reasoning
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• Foundations of Information and Knowledge Systems

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Guarded resolution for answer set programming

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