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

DOI10.1145/1055686.1055690MaRDI QIDQ5277723zbMATH OpenOpenAlexWikidataFDO

Authors 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

argumentationdisjunctive logic programmingnegationnonmonotonic reasoningprogram transformationsresidual programssemantics of logic programs and deductive databaseswell-founded semantics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1884387
• On the computation of the disjunctive well-founded semantics
• scientific article; zbMATH DE number 846973
• Generalized disjunctive well-founded semantics for logic programs.
• Disjunctive logic and semantics of disjunctive logic programs
• scientific article; zbMATH DE number 591001
• scientific article; zbMATH DE number 1926616
• Propositional semantics for disjunctive logic programs

Cited in

(16)

• Semantic forgetting in answer set programming
• Semi-equilibrium models for paracoherent answer set programs
• scientific article; zbMATH DE number 1765676 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1884387 (Why is no real title available?)
• scientific article; zbMATH DE number 846973 (Why is no real title available?)
• scientific article; zbMATH DE number 915921 (Why is no real title available?)
• Logic Programming
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• On the equivalence of the static and disjunctive well-founded semantics and its computation
• On the computation of the disjunctive well-founded semantics
• On dynamics in structured argumentation formalisms
• Computation of non-ground disjunctive well-founded semantics with constraint logic programming
• Strong order equivalence

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

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