Dialectic proof procedures for assumption-based, admissible argumentation
From MaRDI portal
Publication:2457643
Recommendations
Cites work
- scientific article; zbMATH DE number 1759381 (Why is no real title available?)
- scientific article; zbMATH DE number 1926641 (Why is no real title available?)
- scientific article; zbMATH DE number 1926643 (Why is no real title available?)
- scientific article; zbMATH DE number 783780 (Why is no real title available?)
- A logic for default reasoning
- A logical framework for default reasoning
- Abductive Logic Programming
- An abstract, argumentation-theoretic approach to default reasoning
- An argumentation-theoretic foundation for logic programming
- Circumscription - a form of non-monotonic reasoning
- Coherence in finite argument systems.
- Computing argumentation in logic programming
- Computing the acceptability semantics
- Logic programming and negation: A survey
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the computational complexity of assumption-based argumentation for default reasoning.
- Semantical considerations on nonmonotonic logic
- Short note preferred extensions are partial stable models
- The well-founded semantics for general logic programs
- Transformation of logic programs: Foundations and techniques
- Two party immediate response disputes: Properties and efficiency
Cited in
(57)- Inconsistency-Tolerant Integrity Checking for Knowledge Assimilation
- Argument graphs and assumption-based argumentation
- Assumption-based argumentation for extended disjunctive logic programming
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Modelling last-act attempted crime in criminal law
- Revealed preference in argumentation: algorithms and applications
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- The computational complexity of ideal semantics
- Dialectical Proof Procedures for Probabilistic Abstract Argumentation
- Answers that Have Integrity
- Justifying answer sets using argumentation
- Simple contrapositive assumption-based argumentation frameworks
- Algorithms for generating arguments and counterarguments in propositional logic
- Dynamics of argumentation systems: a division-based method
- Towards a common framework for dialectical proof procedures in abstract argumentation
- Toward justifying logically and socially acceptable reasons with dialectical proof theories
- An Algorithm for Generating Arguments in Classical Predicate Logic
- Logical argumentation by dynamic proof systems
- Dialectical Explanations in Defeasible Argumentation
- A review of the relations between logical argumentation and reasoning with maximal consistency
- An argument-based approach to reasoning with clinical knowledge
- Forecasting with jury-based probabilistic argumentation
- Dialogue games for argumentation frameworks with necessities
- A general framework for sound assumption-based argumentation dialogues
- Deductive Joint Support for Rational Unrestricted Rebuttal
- Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
- Semantic-based construction of arguments: an answer set programming approach
- Collaborative vs. Conflicting Learning, Evolution and Argumentation
- Inference procedures and engine for probabilistic argumentation
- Computational properties of argument systems satisfying graph-theoretic constraints
- Arguments, proofs, and dialogues
- Labellings for assumption-based and abstract argumentation
- DefLog: on the Logical Interpretation of Prima Facie Justified Assumptions
- Approved Models for Normal Logic Programs
- Normal and strong expansion equivalence for argumentation frameworks
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- Argument-Based Decision Making and Negotiation in E-Business: Contracting a Land Lease for a Computer Assembly Plant
- Evaluating dialectical structures
- Reasoning on the web with assumption-based argumentation
- Uses and computation of imprecise probabilities from statistical data and expert arguments
- Preferences and Assumption-Based Argumentation for Conflict-Free Normative Agents
- Fundamental properties of attack relations in structured argumentation with priorities
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- Encoding deductive argumentation in quantified Boolean formulae
- Explanations of non-monotonic inference in admissibility-based abstract argumentation
- Flexible dispute derivations with forward and backward arguments for assumption-based argumentation
- Audiences in argumentation frameworks
- Measure-based inconsistency-tolerant maintenance of database integrity
- Reasoning about exceptions to contracts
- Classical logic, argument and dialectic
- Assumption-Based Argumentation for Selection and Composition of Services
- Minimal strong admissibility: a complexity analysis
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Probabilistic qualification of attack in abstract argumentation
- Change in quantitative bipolar argumentation: sufficient, necessary, and counterfactual explanations
- Partial semantics of argumentation
This page was built for publication: Dialectic proof procedures for assumption-based, admissible argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457643)
