Complexity of DeLP: current status and moving forward
From MaRDI portal
Publication:5116402
zbMATH Open1440.68262MaRDI QIDQ5116402FDOQ5116402
Authors: Laura Cecchi, Pablo R. Fillottrani 
Publication date: 25 August 2020
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
computational complexityargumentation systemsdefeasible logic programmingdata and combined complexitygame-based semantics
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)
Cited In (10)
- Dynamics of knowledge in \textsc{DeLP} through argument theory change
- An Alternative Foundation for DeLP: Defeating Relations and Truth Values
- Problems, models and complexity. II: Application to the DLSP
- The foundations of DeLP: Defeating relations, games and truth values
- Title not available (Why is that?)
- Logic Programming and Nonmonotonic Reasoning
- On the relationship between DeLP and ASPIC\(^+\)
- Defeasible logic programming in satisfiability modulo CHR
- Argument graphs for defeasible logic programming
- Defeasible logic programming: an argumentative approach
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)
