Algorithms for generating arguments and counterarguments in propositional logic

DOI10.1016/J.IJAR.2011.01.005MaRDI QIDQ648354zbMATH OpenOpenAlexFDO

Authors Vasiliki Efstathiou, Anthony Hunter

Publication date 22 November 2011

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2011.01.005

zbMATH Keywords

canonical undercutscomputational models of argumentcounteragumentdisjunctive clauselogic-based argumentation

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
• An Algorithm for Generating Arguments in Classical Predicate Logic
• Encoding deductive argumentation in quantified Boolean formulae
• Toward a more efficient generation of structured argumentation graphs
• Complexity Classifications for Logic-Based Argumentation

Cites work

• scientific article; zbMATH DE number 3664336 (Why is no real title available?)
• scientific article; zbMATH DE number 1844506 (Why is no real title available?)
• scientific article; zbMATH DE number 1852916 (Why is no real title available?)
• scientific article; zbMATH DE number 3320385 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A Proof Procedure Using Connection Graphs
• A logic-based theory of deductive arguments
• A reasoning model based on the production of acceptable arguments
• Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
• An Algorithm for Generating Arguments in Classical Predicate Logic
• An argument-based approach to reasoning with clinical knowledge
• An argumentation framework for merging conflicting knowledge bases
• Argument-based extended logic programming with defeasible priorities
• Computing argumentation in logic programming
• Defeasible logic programming: an argumentative approach
• Dialectic proof procedures for assumption-based, admissible argumentation
• Encoding deductive argumentation in quantified Boolean formulae
• On the computational complexity of assumption-based argumentation for default reasoning.
• Properties and Complexity of Some Formal Inter-agent Dialogues
• The complexity of logic-based abduction

Cited in

(9)

• Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
• Generating possible intentions with constrained argumentation systems
• An Algorithm for Generating Arguments in Classical Predicate Logic
• Semantic-based construction of arguments: an answer set programming approach
• Bipolarity in argumentation graphs: towards a better understanding
• Encoding deductive argumentation in quantified Boolean formulae
• Flexible dispute derivations with forward and backward arguments for assumption-based argumentation
• Classical logic, argument and dialectic
• Methods for solving reasoning problems in abstract argumentation -- a survey

This page was built for publication: Algorithms for generating arguments and counterarguments in propositional logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648354)