Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach

DOI10.1007/978-3-540-77684-0_19zbMath1138.68557OpenAlexW1501337828MaRDI QIDQ5445306

Vasiliki Efstathiou, Anthony Hunter

Publication date: 4 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77684-0_19

Mathematics Subject Classification ID

Related Items (5)

Semantic-based construction of arguments: an answer set programming approach ⋮ Algorithms for generating arguments and counterarguments in propositional logic ⋮ An Algorithm for Generating Arguments in Classical Predicate Logic ⋮ Encoding deductive argumentation in quantified Boolean formulae ⋮ Argument graphs and assumption-based argumentation

Cites Work

• Easy problems are sometimes hard
• A reasoning model based on the production of acceptable arguments
• On the computational complexity of assumption-based argumentation for default reasoning.
• Dialectic proof procedures for assumption-based, admissible argumentation
• Generating hard satisfiability problems
• Argument-based extended logic programming with defeasible priorities
• A Proof Procedure Using Connection Graphs
• The complexity of logic-based abduction
• Computing argumentation in logic programming
• Defeasible logic programming: an argumentative approach
• Logic Programming and Nonmonotonic Reasoning
• A logic-based theory of deductive arguments
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach