An Algorithm for Generating Arguments in Classical Predicate Logic
From MaRDI portal
Recommendations
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Algorithms for generating arguments and counterarguments in propositional logic
- Encoding deductive argumentation in quantified Boolean formulae
- Argumentative logics: Reasoning with classically inconsistent information
- Generalized Abstract Argumentation: Handling Arguments in FOL Fragments
Cites work
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 1852916 (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
- Argument-based extended logic programming with defeasible priorities
- Defeasible logic programming: an argumentative approach
- Dialectic proof procedures for assumption-based, admissible argumentation
Cited in
(5)- An approach to generating arguments over DL-Lite ontologies
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Algorithms for generating arguments and counterarguments in propositional logic
- Toward a more efficient generation of structured argumentation graphs
- Encoding deductive argumentation in quantified Boolean formulae
This page was built for publication: An Algorithm for Generating Arguments in Classical Predicate Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638143)