Computing loops with at most one external support rule for disjunctive logic programs

DOI10.1007/978-3-642-02846-5_15MaRDI QIDQ4649728zbMATHOpenAlexFDO

Authors Jianmin Ji, Fangzhen Lin, Xiaoping Chen

Publication date 13 November 2012

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02846-5_15

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Computing loops with at most one external support rule
• Logic Programming
• Embedding functions into disjunctive logic programs
• Embedding functions into disjunctive logic programs
• On elementary loops of logic programs

Cites work

• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Comparisons and computation of well-founded semantics for disjunctive logic programs
• Discovering classes of strongly equivalent logic programs
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Logic Programming
• Nested expressions in logic programs
• Semantics of (disjunctive) logic programs based on partial evaluation
• The DLV system for knowledge representation and reasoning

Cited in

(3)

• Computing loops with at most one external support rule
• On elementary loops of logic programs
• Conflict-driven answer set solving: from theory to practice

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Computing loops with at most one external support rule for disjunctive logic programs

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