A nondeterministic well-founded semantics

DOI10.1007/BF01530893MaRDI QIDQ1924729zbMATH OpenFDO

Authors Alberto Torres

Publication date 20 October 1996

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01530893

zbMATH Keywords

partial stable modelswell-founded semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A non-ground realization of the stable and well-founded semantics
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
• A constructive semantics for non‐deducibility
• Semantics of non-deterministic possibility computation
• Nonwellfounded sets and programming language semantics
• scientific article; zbMATH DE number 3935006
• Extensional and intensional semantics of bounded and unbounded nondeterminism
• A tutorial on the well-founded semantics

Cites work

• Abductive Logic Programming
• Autoepistemic logic
• Graph theoretical structures in logic programs and default theories
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 140387 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Recent problems and results about kernels in directed graphs
• Short note preferred extensions are partial stable models
• Tie-breaking semantics and structural totality

Cited in

(15)

• Argumentation in disjunctive logic programming
• Credolous argumentation with the disjunctive stable semantics
• A semantics for a class of non-deterministic and causal production system programs
• Complexity and expressive power of deterministic semantics for DATALOG^ .
• scientific article; zbMATH DE number 3943004 (Why is no real title available?)
• Equivalence of well-founded and stable semantics
• scientific article; zbMATH DE number 1929962 (Why is no real title available?)
• A Principle-Based Analysis of Weakly Admissible Semantics
• scientific article; zbMATH DE number 5244180 (Why is no real title available?)
• A constructive semantics for non‐deducibility
• A tutorial on the well-founded semantics
• Aggregation and well-founded semantics\textsuperscript{+}
• A non-ground realization of the stable and well-founded semantics
• Graph theoretical structures in logic programs and default theories
• Fundamental properties of deterministic and nondeterministic extensions of Datalog

This page was built for publication: A nondeterministic well-founded semantics

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