Mechanizing Mathematical Reasoning

DOI10.1007/B106663MaRDI QIDQ5717463zbMATH OpenOpenAlexFDO

Authors Howard Barringer, John Woods, Dov Gabbay

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106663

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Modal and temporal argumentation networks
• scientific article; zbMATH DE number 7238902
• Introducing equational semantics for argumentation networks
• Logical modes of attack in argumentation networks
• Semantics for higher level attacks in extended argumentation frames. I: Overview

Cited in

(41)

• Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction
• Inference procedures and engine for probabilistic argumentation
• Completeness theorems for reactive modal logics
• Introducing reactive modal tableaux
• A logic of argumentation for specification and verification of abstract argumentation frameworks
• Modelling defeasible and prioritized support in bipolar argumentation
• Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger
• Valid attacks in argumentation frameworks with recursive attacks
• Semantics for higher level attacks in extended argumentation frames. I: Overview
• Meta-argumentation modelling. I: Methodology and techniques
• Modal logics of reactive frames
• Modal provability foundations for argumentation networks
• Logical modes of attack in argumentation networks
• Fibring argumentation frames
• Probabilistic qualification of attack in abstract argumentation
• A neural cognitive model of argumentation with application to legal inference and decision making
• Handling support cycles and collective interactions in the logical encoding of higher-order bipolar argumentation frameworks
• Introducing equational semantics for argumentation networks
• Arguing with valued preference relations
• Optimization of dialectical outcomes in dialogical argumentation
• Principles of Talmudic logic
• Modal and temporal argumentation networks
• Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
• Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
• Valued preference-based instantiation of argumentation frameworks with varied strength defeats
• Weighted argument systems: basic definitions, algorithms, and complexity results
• RAFDivider  : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks
• Integrated preference argumentation and applications in consumer behaviour analyses
• AFRA: argumentation framework with recursive attacks
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• How to manage supports in incomplete argumentation
• Validity of attacks related to argument set in higher-order argumentation frameworks
• Incomplete higher-order abstract argumentation frameworks
• A credulous semantics of higher-order argumentation frameworks based on credulously accepted attacks
• Renovation sets and their applications in higher-order argumentation frameworks
• Aggregation-based operations for reversal fuzzy switch graphs
• Abstract argumentation and answer set programming: two faces of Nelson's logic
• Gradual semantics for weighted higher-order argumentation frameworks
• Reasoning about preferences in argumentation frameworks
• Equilibrium states in numerical argumentation networks
• Resource-origins of nonmonotonicity

This page was built for publication: Mechanizing Mathematical Reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717463)