Interdefinability of defeasible logic and logic programming under the well-founded semantics

DOI10.1017/S147106841100041XzbMath1272.68079OpenAlexW2963571216MaRDI QIDQ2845124

Frederick Maier

Publication date: 22 August 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s147106841100041x

zbMATH Keywords

well-founded semanticslogic programmingstable model semanticsdefeasible logicambiguity blocking and propagation

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (1)

Annotated defeasible logic

Uses Software

• XSB

Cites Work

• Well-founded semantics for defeasible logic
• A logic for default reasoning
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• Floating conclusions and zombie paths: Two deep difficulties in the ``directly skeptical approach to defeasible inheritance nets
• A skeptical theory of inheritance in nonmonotonic semantic networks
• A lattice-theoretical fixpoint theorem and its applications
• Representation results for defeasible logic
• Defeasible reasoning: A discussion of some intuitions
• Embedding defeasible logic into logic programming
• Propositional Clausal Defeasible Logic
• Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics
• Negation in logic programming
• The Semantics of Predicate Logic as a Programming Language
• Defeasible Logic is Stable
• The well-founded semantics for general logic programs
• Argumentation Semantics for Defeasible Logic
• Propositional plausible logic: Introduction and implementation

This page was built for publication: Interdefinability of defeasible logic and logic programming under the well-founded semantics