Complexity of DeLP: current status and moving forward

MaRDI QIDQ5116402zbMATH OpenFDO

Authors Laura Cecchi, Pablo R. Fillottrani

Publication date 25 August 2020

zbMATH Keywords

argumentation systemscomputational complexitydata and combined complexitydefeasible logic programminggame-based semantics

Mathematics Subject Classification ID

Logic programming (68N17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Defeasible logic programming: an argumentative approach
• The foundations of DeLP: Defeating relations, games and truth values
• Logic Programming and Nonmonotonic Reasoning
• An Alternative Foundation for DeLP: Defeating Relations and Truth Values
• Dynamics of knowledge in \textsc{DeLP} through argument theory change

Cited in

(10)

• Problems, models and complexity. II: Application to the DLSP
• Defeasible logic programming in satisfiability modulo CHR
• scientific article; zbMATH DE number 169405 (Why is no real title available?)
• Defeasible logic programming: an argumentative approach
• On the relationship between DeLP and ASPIC^+
• Argument graphs for defeasible logic programming
• Dynamics of knowledge in \textsc{DeLP} through argument theory change
• An Alternative Foundation for DeLP: Defeating Relations and Truth Values
• Logic Programming and Nonmonotonic Reasoning
• The foundations of DeLP: Defeating relations, games and truth values

This page was built for publication: Complexity of DeLP: current status and moving forward

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