How to reason defeasibly

DOI10.1016/0004-3702(92)90103-5zbMath0763.68056OpenAlexW2029665446MaRDI QIDQ1199924

Publication date: 17 January 1993

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(92)90103-5

zbMATH Keywords

defeasible reasoning OSCAR

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (48)

Justification and defeat ⋮ Backdoors to Satisfaction ⋮ Argumentation through a distributed self-stabilizing approach ⋮ Deontic logic as founded on nonmonotonic logic ⋮ Building an Epistemic Logic for Argumentation ⋮ An argumentation system for defeasible reasoning ⋮ Minimal hypotheses: extension-based semantics to argumentation ⋮ When is argumentation deductive? ⋮ Belief revision and computational argumentation: a critical comparison ⋮ Logical argumentation by dynamic proof systems ⋮ Weakest link in formal argumentation: lookahead and principle-based analysis ⋮ Dynamic reasoning with qualified syllogisms ⋮ Abstract argumentation systems ⋮ Generating possible intentions with constrained argumentation systems ⋮ The Logical Handling of Threats, Rewards, Tips, and Warnings ⋮ Instantiating abstract argumentation with classical logic arguments: postulates and properties ⋮ Algorithms and complexity results for persuasive argumentation ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ A neural cognitive model of argumentation with application to legal inference and decision making ⋮ Valued preference-based instantiation of argumentation frameworks with varied strength defeats ⋮ Postulates for logic-based argumentation systems ⋮ SCC-recursiveness: a general schema for argumentation semantics ⋮ Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems ⋮ Inductive inference and argumentation methods in modern intelligent decision support systems ⋮ Deductive argumentation by enhanced sequent calculi and dynamic derivations ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ A characterization of types of support between structured arguments and their relationship with support in abstract argumentation ⋮ An Approach to Human-Level Commonsense Reasoning ⋮ Epistemic entrenchment and arithmetical hierarchy ⋮ The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself ⋮ A formal account of Socratic-style argumentation ⋮ Augmenting tractable fragments of abstract argumentation ⋮ Cost-bounded argumentation ⋮ I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation ⋮ A logic-based theory of deductive arguments ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ Evaluation of arguments in weighted bipolar graphs ⋮ A review of the relations between logical argumentation and reasoning with maximal consistency ⋮ OSCAR ⋮ Reaching agreements through argumentation: a logical model and implementation ⋮ On the evaluation of argumentation formalisms ⋮ Argumentation in artificial intelligence ⋮ On principle-based evaluation of extension-based argumentation semantics ⋮ Handling controversial arguments ⋮ A new approach for preference-based argumentation frameworks ⋮ Extending abstract argumentation systems theory ⋮ Abductive inference in defeasible reasoning: a model for research programmes ⋮ On three-valued acceptance conditions of abstract dialectical frameworks

Cites Work

This page was built for publication: How to reason defeasibly