On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
From MaRDI portal
Publication:1855240
DOI10.1016/0004-3702(94)00041-XzbMATH Open1013.68556WikidataQ56551822 ScholiaQ56551822MaRDI QIDQ1855240
Publication date: 4 February 2003
Published in: Artificial Intelligence (Search for Journal in Brave)
Other nonclassical logic (03B60) Logic programming (68N17) Logic in artificial intelligence (68T27) (n)-person games, (n>2) (91A06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- The well-founded semantics for general logic programs
- Abductive Logic Programming
- A mathematical treatment of defeasible reasoning and its implementation.
- A logic for default reasoning
- Non-monotonic logic. I
- Semantical considerations on nonmonotonic logic
- Circumscription - a form of non-monotonic reasoning
- A kripke-kleene semantics for logic programs*
- A logical framework for default reasoning
- The effect of knowledge on belief: Conditioning, specificity and the lottery paradox in default reasoning
- Negation in logic programming
- On the relation between default and autoepistemic logic
- Short note preferred extensions are partial stable models
- On the relations between stable and well-founded semantics of logic programs
- A theory of nonmonotonic rule systems I
- Completed logic programs and their consistency
- Justification and defeat
Cited In (only showing first 100 items - show all)
- On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics
- Probabilistic Abstract Dialectical Frameworks
- Defining stage argumentation semantics in terms of an abducible semantics
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
- A multi attack argumentation framework
- Foundations for a logic of arguments
- On the equivalence between logic programming semantics and argumentation semantics
- Abduction in argumentation frameworks
- Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
- Petitio principii and circular argumentation as seen from a theory of dialectical structures
- Probabilistic legal reasoning in CHRiSM
- Combining argumentation and Bayesian nets for breast cancer prognosis
- Semantics for a theory of defeasible reasoning
- Justifying answer sets using argumentation
- A system for defeasible argumentation, with defeasible priorities
- A labelling framework for probabilistic argumentation
- Conflict-Tolerant Semantics for Argumentation Frameworks
- Simple contrapositive assumption-based argumentation frameworks
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
- Argument strength in probabilistic argumentation based on defeasible rules
- Enumerating maximal consistent closed sets in closure systems
- Rich preference-based argumentation frameworks
- Logical limits of abstract argumentation frameworks
- Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks
- An argument-based approach to reasoning with specificity
- Grounded fixpoints and their applications in knowledge representation
- Interlinking logic programs and argumentation frameworks
- Defeasible inheritance with doubt index and its axiomatic characterization
- Equilibrium states in numerical argumentation networks
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Law and logic: a review from an argumentation perspective
- An axiomatic analysis of structured argumentation with priorities
- Semantic-based construction of arguments: an answer set programming approach
- Value-based argumentation framework built from prioritized qualitative choice logic
- Extending abstract argumentation systems theory
- Coalitions of arguments: A tool for handling bipolar argumentation frameworks
- An executable specification of a formal argumentation protocol
- An approach to abstract argumentation with recursive attack and support
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
- An argumentation framework for merging conflicting knowledge bases
- Bipolarity in argumentation graphs: towards a better understanding
- Labellings for assumption-based and abstract argumentation
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
- Jumping to Conclusions
- Addressing moral problems through practical reasoning
- REACTIVE PREFERENTIAL STRUCTURES AND NONMONOTONIC CONSEQUENCE
- Encoding deductive argumentation in quantified Boolean formulae
- Modelling defeasible and prioritized support in bipolar argumentation
- Argumentation Framework Based on Evidence Theory
- Valid attacks in argumentation frameworks with recursive attacks
- Argumentation frameworks as constraint satisfaction problems
- Graded labellings for abstract argumentation
- Explaining Bayesian Networks Using Argumentation
- Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs
- Verification in incomplete argumentation frameworks
- How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)?
- Multiple criteria group decision support through the usage of argumentation-based multi-agent systems: an overview
- A model of legal reasoning with cases incorporating theories and values
- Iterative belief revision in extended logic programming
- Goal-Driven Structured Argumentation for Patient Management in a Multimorbidity Setting
- A model building framework for answer set programming with external computations
- A Relaxation of Internal Conflict and Defence in Weighted Argumentation Frameworks
- An argumentation-based approach for identifying and dealing with incompatibilities among procedural goals
- Assessing the accuracy of diagnostic probability estimation: evidence for defeasible modus ponens
- From fine-grained properties to broad principles for gradual argumentation: a principled spectrum
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
- Revision of defeasible preferences
- A unifying view for logic programming with non-monotonic reasoning
- Normality, non-contamination and logical depth in classical natural deduction
- On Well-Founded Set-Inductions and Locally Monotone Operators
- Equivalence for the \(G_3^\prime\)-stable models semantics
- Simple contrapositive assumption-based argumentation. II: Reasoning with preferences
- Understanding the Abstract Dialectical Framework
- Dialectical Proof Procedures for Probabilistic Abstract Argumentation
- The Logical Handling of Threats, Rewards, Tips, and Warnings
- The foundations of DeLP: Defeating relations, games and truth values
- A generalized proof-theoretic approach to logical argumentation based on hypersequents
- Argumentation for Practical Reasoning: An Axiomatic Approach
- Computation as social agency: what, how and who
- Logical argumentation by dynamic proof systems
- Arguing about informant credibility in open multi-agent systems
- Safe inductions and their applications in knowledge representation
- Fixpoint semantics for active integrity constraints
- Argumentation through a distributed self-stabilizing approach
- A neural cognitive model of argumentation with application to legal inference and decision making
- Message exchange games in strategic contexts
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
- Subjective logic and arguing with evidence
- Range-based argumentation semantics as two-valued models
- I donβt care, I donβt know β¦ I know too much! On Incompleteness and Undecidedness in Abstract Argumentation
- An argumentation system for defeasible reasoning
- Inference procedures and engine for probabilistic argumentation
- Logic-based argumentation with existential rules
- Practical Normative Reasoning with Defeasible Deontic Logic
- Generalized additive games
- Flexible Approximators for Approximating Fixpoint Theory
- Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics
- A novel weighted defence and its relaxation in abstract argumentation
- On the impact of configuration on abstract argumentation automated reasoning
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Acceptance in incomplete argumentation frameworks π π
- A nonmonotonic modal formalization of the logic of acceptance and rejection π π
- On the links between argumentation-based reasoning and nonmonotonic reasoning π π
- A Dialectical Proof Theory for Universal Acceptance in Coherent Logic-based Argumentation Frameworks π π
- On the graded acceptability of arguments in abstract and instantiated argumentation π π
- From logic programming and non-monotonic reasoning to computational argumentation and beyond π π
- Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria π π
This page was built for publication: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855240)