Computing loops with at most one external support rule

DOI10.1145/2422085.2422088MaRDI QIDQ2946687zbMATH OpenOpenAlexFDO

Authors Jianmin Ji, Fangzhen Lin, Xiaoping Chen

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422085.2422088

zbMATH Keywords

answer set semanticsanswer set solversdisjunctive logic programsloop formulasnormal logic programswell-founded semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Computing loops with at most one external support rule for disjunctive logic programs
• Logic Programming
• ASSAT: computing answer sets of a logic program by SAT solvers
• Logic Programming and Nonmonotonic Reasoning
• Why are there so many loop formulas?

Cited in

(3)

• Computing loops with at most one external support rule for disjunctive logic programs
• Why are there so many loop formulas?
• Logic Programming and Nonmonotonic Reasoning

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

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