Comparisons and computation of well-founded semantics for disjunctive logic programs

DOI10.1145/1055686.1055690zbMath1367.68042OpenAlexW2011438231WikidataQ130890671 ScholiaQ130890671MaRDI QIDQ5277723

Kewen Wang, Lizhu Zhou

Publication date: 12 July 2017

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

Full work available at URL: http://hdl.handle.net/10072/4294

zbMATH Keywords

program transformationswell-founded semanticsnonmonotonic reasoningnegationdisjunctive logic programmingargumentationsemantics of logic programs and deductive databasesresidual programs

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (6)

Strong order equivalence ⋮ Semantic forgetting in answer set programming ⋮ The infinite-valued semantics: overview, recent results and future directions ⋮ Random logic programs: Linear model ⋮ Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs ⋮ Semi-equilibrium models for paracoherent answer set programs

This page was built for publication: Comparisons and computation of well-founded semantics for disjunctive logic programs