Alternating fixpoint theory for logic programs with priority

DOI10.1007/3-540-44957-4_11MaRDI QIDQ2767052zbMATH OpenFDO

Authors Kewen Wang, Lizhu Zhou, Fangzhen Lin

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44957-4_11

zbMATH Keywords

alternating fixpointsanswer setslogic programsprioritywell-founded model

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• The alternating fixpoint of logic programs with negation
• scientific article; zbMATH DE number 3848592
• Optimal fixedpoints of logic programs
• scientific article; zbMATH DE number 1407674
• scientific article; zbMATH DE number 1824109
• Two results for prioritized logic programming
• Alternation and the computational complexity of logic programs
• A fixpoint semantics for disjunctive logic programs
• Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
• Embedding prioritized circumscription in logic programs

Cited in

(7)

• Dynamic reordering of alternatives for definite logic programs
• A selective semantics for logic programs with preferences
• scientific article; zbMATH DE number 4164169 (Why is no real title available?)
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• scientific article; zbMATH DE number 6174932 (Why is no real title available?)
• Logic Programming with Defaults and Argumentation Theories
• Strong order equivalence

This page was built for publication: Alternating fixpoint theory for logic programs with priority

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