Argument graphs for defeasible logic programming

MaRDI QIDQ5116415zbMATH OpenFDO

Authors Francesca Toni, P. Mancarella

Publication date 25 August 2020

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Defeasible logic programming: an argumentative approach
• Argument-based extended logic programming with defeasible priorities
• Argumentation Semantics for Defeasible Logic
• Dynamics of knowledge in \textsc{DeLP} through argument theory change
• Complexity of DeLP: current status and moving forward

Cited in

(12)

• Argument graphs and assumption-based argumentation
• Argument-based extended logic programming with defeasible priorities
• Dynamics of knowledge in \textsc{DeLP} through argument theory change
• An Alternative Foundation for DeLP: Defeating Relations and Truth Values
• A comparative study of some central notions of \(\mathit{ASPIC}^+\) and \textit{DeLP}
• The foundations of DeLP: Defeating relations, games and truth values
• Backing and undercutting in defeasible logic programming
• Graph-based dispute derivations in assumption-based argumentation
• On influence and contractions in defeasible logic programming
• Computational properties of argument systems satisfying graph-theoretic constraints
• Defeasible logic programming in satisfiability modulo CHR
• Defeasible logic programming: an argumentative approach

This page was built for publication: Argument graphs for defeasible logic programming

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