Dialectic proof procedures for assumption-based, admissible argumentation
From MaRDI portal
Publication:2457643
DOI10.1016/j.artint.2005.07.002zbMath1131.68103OpenAlexW2084827335MaRDI QIDQ2457643
Robert Kowalski, Francesca Toni, Phan Minh Dung
Publication date: 23 October 2007
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2005.07.002
Related Items (46)
Measure-Based Inconsistency-Tolerant Maintenance of Database Integrity ⋮ Collaborative vs. Conflicting Learning, Evolution and Argumentation ⋮ Normal and strong expansion equivalence for argumentation frameworks ⋮ Toward incremental computation of argumentation semantics: a decomposition-based approach ⋮ Labellings for assumption-based and abstract argumentation ⋮ Inference procedures and engine for probabilistic argumentation ⋮ Approved Models for Normal Logic Programs ⋮ Forecasting with jury-based probabilistic argumentation ⋮ Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation ⋮ Justifying answer sets using argumentation ⋮ Simple contrapositive assumption-based argumentation frameworks ⋮ Logical argumentation by dynamic proof systems ⋮ Fundamental properties of attack relations in structured argumentation with priorities ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ Flexible dispute derivations with forward and backward arguments for assumption-based argumentation ⋮ Explanations of non-monotonic inference in admissibility-based abstract argumentation ⋮ Instantiating abstract argumentation with classical logic arguments: postulates and properties ⋮ Algorithms for generating arguments and counterarguments in propositional logic ⋮ Dynamics of argumentation systems: a division-based method ⋮ A general framework for sound assumption-based argumentation dialogues ⋮ Preferences and Assumption-Based Argumentation for Conflict-Free Normative Agents ⋮ Revealed preference in argumentation: algorithms and applications ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ Reasoning on the Web with Assumption-Based Argumentation ⋮ Assumption-Based Argumentation for Selection and Composition of Services ⋮ An argument-based approach to reasoning with clinical knowledge ⋮ Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach ⋮ Inconsistency-Tolerant Integrity Checking for Knowledge Assimilation ⋮ A review of the relations between logical argumentation and reasoning with maximal consistency ⋮ An Algorithm for Generating Arguments in Classical Predicate Logic ⋮ Reasoning about Exceptions to Contracts ⋮ Answers that Have Integrity ⋮ Partial Semantics of Argumentation ⋮ Argument-Based Decision Making and Negotiation in E-Business: Contracting a Land Lease for a Computer Assembly Plant ⋮ Evaluating dialectical structures ⋮ Audiences in argumentation frameworks ⋮ Argumentation in artificial intelligence ⋮ Computing ideal sceptical argumentation ⋮ Computational properties of argument systems satisfying graph-theoretic constraints ⋮ Modelling last-act attempted crime in criminal law ⋮ The computational complexity of ideal semantics ⋮ Encoding deductive argumentation in quantified Boolean formulae ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Assumption-based argumentation for extended disjunctive logic programming ⋮ Argument graphs and assumption-based argumentation ⋮ Probabilistic qualification of attack in abstract argumentation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two party immediate response disputes: Properties and efficiency
- Semantical considerations on nonmonotonic logic
- A logical framework for default reasoning
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- An abstract, argumentation-theoretic approach to default reasoning
- Coherence in finite argument systems.
- On the computational complexity of assumption-based argumentation for default reasoning.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Short note preferred extensions are partial stable models
- The well-founded semantics for general logic programs
- Logic programming and negation: A survey
- Transformation of logic programs: Foundations and techniques
- An argumentation-theoretic foundation for logic programming
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- Computing argumentation in logic programming
- Computing the acceptability semantics
- Abductive Logic Programming
This page was built for publication: Dialectic proof procedures for assumption-based, admissible argumentation
