A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics

DOI10.1017/S147106840400225XMaRDI QIDQ4673544zbMATH OpenOpenAlexFDO

Authors

Publication date 29 April 2005

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

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

zbMATH Keywords

nonmonotonic reasoningargumentation semanticsextended logic programmingwell-founded semantics with explicit negation

Mathematics Subject Classification ID

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

Recommendations

• Semantic-based construction of arguments: an answer set programming approach
• Computing argumentation in logic programming
• Argumentation-based semantics for logic programs with first-order formulae
• An argumentation-theoretic foundation for logic programming
• Abducible Semantics and Argumentation

Cited in

(7)

• Argumentation-based semantics for logic programs with first-order formulae
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Skepticism relations for comparing argumentation semantics
• An encompassing framework for paraconsistent logic programs
• Semantic-based construction of arguments: an answer set programming approach
• From fuzzy to annotated semantic web languages
• Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification

This page was built for publication: A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics

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