Computing the acceptability semantics

DOI10.1007/3-540-59487-6_29MaRDI QIDQ5101465zbMATH OpenOpenAlexFDO

Authors Francesca Toni, A. C. Kakas

Publication date 30 August 2022

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59487-6_29

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic programming (68N17) Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55)

Recommendations

• Computing argumentation in logic programming
• scientific article; zbMATH DE number 1926641
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• A unifying view for logic programming with non-monotonic reasoning
• An argumentation-theoretic foundation for logic programming

Cites work

• A logical framework for default reasoning

Cited in

(7)

• Computing ideal sceptical argumentation
• An abstract, argumentation-theoretic approach to default reasoning
• Dialectic proof procedures for assumption-based, admissible argumentation
• An abductive proof procedure for reasoning about actions in modal logic programming
• Nonmonotonic reasoning by monotonic inferences with priority constraints
• An abductive proof procedure for conditional logic programming
• scientific article; zbMATH DE number 1324657 (Why is no real title available?)

This page was built for publication: Computing the acceptability semantics

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