Computing argumentation in logic programming
From MaRDI portal
Publication:4700098
DOI10.1093/logcom/9.4.515zbMath0935.68008OpenAlexW2133568918MaRDI QIDQ4700098
Francesca Toni, Antonis C. Kakas
Publication date: 31 October 1999
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a954db91cf1720dd9e46af03be337dabb61bd416
Related Items
DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION, Algorithms for generating arguments and counterarguments in propositional logic, A general framework for sound assumption-based argumentation dialogues, Dialectic proof procedures for assumption-based, admissible argumentation, On argumentation logic and propositional logic, A general semi-structured formalism for computational argumentation: definition, properties, and examples of application, Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification, Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach, An argument-based approach to reasoning with specificity, A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics, Computing ideal sceptical argumentation, Encoding deductive argumentation in quantified Boolean formulae, Alternative foundations for Reiter's default logic, Relating defeasible and normal logic programming through transformation properties.
