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

DOI10.1017/S147106840400225XzbMath1093.68022OpenAlexW1980425590MaRDI QIDQ4673544

No author found.

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 in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (5)

From Fuzzy to Annotated Semantic Web Languages ⋮ Skepticism relations for comparing argumentation semantics ⋮ Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification ⋮ An encompassing framework for paraconsistent logic programs ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

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