Defeasible logic programming: an argumentative approach

DOI10.1017/S1471068403001674zbMath1090.68015MaRDI QIDQ4819006

Guillermo R. Simari, Alejandro Javier García

Publication date: 24 September 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

knowledge representation; nonmonotonic reasoning; defeasible argumentation

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T30: Knowledge representation

68N17: Logic programming

Related Items

Logic Programming with Defaults and Argumentation Theories, A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments, Defeasible Argumentation Support for an Extended BDI Architecture, Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach, A logic programming framework for possibilistic argumentation: Formalization and logical properties, The foundations of DeLP: Defeating relations, games and truth values, An argument-based approach to reasoning with clinical knowledge, On the evaluation of argumentation formalisms, Encoding deductive argumentation in quantified Boolean formulae, Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification, SCC-recursiveness: a general schema for argumentation semantics, A formal account of Socratic-style argumentation, Argumentation Theory and Decision Aiding, Dialectical Explanations in Defeasible Argumentation, DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION, An Algorithm for Generating Arguments in Classical Predicate Logic, Modelling Argument Accrual in Possibilistic Defeasible Logic Programming