Disjunctive logic programs, answer sets, and the cut rule

DOI10.1007/S00153-022-00821-XOpenAlexW4214841334MaRDI QIDQ2085572

Yanyan Li

Publication date: 18 October 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-022-00821-x

zbMATH Keywords

cut ruledisjunctive logic programsmodalitiesclassical negationanswer setshyper-resolution ruletableau proofs

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Uses Software

• ASSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ASSAT: computing answer sets of a logic program by SAT solvers
• Logic programming as classical inference
• Completeness of hyper-resolution via the semantics of disjunctive logic programs
• Semantical considerations on nonmonotonic logic
• Generalized disjunctive well-founded semantics for logic programs.
• Logic programming and knowledge representation---The A-Prolog perspective
• Static semantics for normal and disjunctive logic programs
• On the computational cost of disjunctive logic programming: Propositional case
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• A fixpoint semantics for disjunctive logic programs
• Generic Tableaux for Answer Set Programming
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• Logic programming and negation: A survey
• Semantics of (disjunctive) logic programs based on partial evaluation
• Contextual hypotheses and semantics of logic programs
• Logic programming with strong negation
• Strong and explicit negation in non-monotonic reasoning and logic programming
• Super logic programs

This page was built for publication: Disjunctive logic programs, answer sets, and the cut rule