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

DOI10.1007/978-3-642-02846-5_15zbMATH Open1251.68054OpenAlexW1577642690MaRDI QIDQ4649728FDOQ4649728

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

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

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

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

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

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)