Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

DOI10.1007/978-3-642-02846-5_15zbMath1251.68054OpenAlexW1577642690MaRDI QIDQ4649728

Fangzhen Lin, Jianmin Ji, Xiao-Ping 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)

Related Items (1)

Conflict-driven answer set solving: from theory to practice

Uses Software

• ASSAT

Cites Work

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

This page was built for publication: Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs