Computing argumentation in logic programming
From MaRDI portal
Recommendations
- Logic Programming, Argumentation and Human Reasoning
- Argumentation in disjunctive logic programming
- An argumentation-theoretic foundation for logic programming
- Argumentation and answer set programming
- Logic Programming with Defaults and Argumentation Theories
- Computation in extended argumentation frameworks
- From logic programming and non-monotonic reasoning to computational argumentation and beyond
- Defeasible logic programming: an argumentative approach
- On the equivalence between logic programming semantics and argumentation semantics
Cited in
(22)- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Computing ideal sceptical argumentation
- Relating defeasible and normal logic programming through transformation properties.
- Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers
- Algorithms for generating arguments and counterarguments in propositional logic
- Computing the acceptability semantics
- Alternative foundations for Reiter's default logic
- Generic logical encoding for argumentation
- A general framework for sound assumption-based argumentation dialogues
- Dialectic proof procedures for assumption-based, admissible argumentation
- DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION
- An argument-based approach to reasoning with specificity
- \(\mathrm{AL}^+\): extended argumentation logic
- On the paraconsistency of argumentation logic
- An argumentation-theoretic foundation for logic programming
- Modality Argumentation Programming
- A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics
- On argumentation logic and propositional logic
- Encoding deductive argumentation in quantified Boolean formulae
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
This page was built for publication: Computing argumentation in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700098)
