Backing and undercutting in defeasible logic programming

DOI10.1007/978-3-642-22152-1_5MaRDI QIDQ3011934zbMATH OpenOpenAlexFDO

Authors Andrea Cohen, Guillermo R. Simari, Alejandro J. García

Publication date 29 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22152-1_5

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• An argumentation system for defeasible reasoning
• Argument graphs for defeasible logic programming
• Defeasible logic programming: an argumentative approach
• Argument-based extended logic programming with defeasible priorities
• An Alternative Foundation for DeLP: Defeating Relations and Truth Values

Cites work

• Defeasible logic programming: an argumentative approach
• DefLog: on the Logical Interpretation of Prima Facie Justified Assumptions
• scientific article; zbMATH DE number 733394 (Why is no real title available?)
• scientific article; zbMATH DE number 1531964 (Why is no real title available?)
• scientific article; zbMATH DE number 1852916 (Why is no real title available?)
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the evaluation of argumentation formalisms
• Reasoning about preferences in argumentation frameworks

Cited in

(5)

• A characterization of types of support between structured arguments and their relationship with support in abstract argumentation
• Structured argumentation dynamics. Undermining attacks in default justification logic
• An argumentation system for defeasible reasoning
• Foundations for a logic of arguments
• A structured bipolar argumentation theory for providing explanations in practical reasoning

This page was built for publication: Backing and undercutting in defeasible logic programming

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