scientific article; zbMATH DE number 6934384
From MaRDI portal
Publication:4585837
zbMath1395.03005MaRDI QIDQ4585837
No author found.
Publication date: 10 September 2018
Full work available at URL: http://formalargumentation.org/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Philosophy of mathematics (00A30) Collections of articles of miscellaneous specific interest (00B15) Philosophical and critical aspects of logic and foundations (03A05) Logic in computer science (03B70) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Related Items (36)
An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ The degrees of monotony-dilemma in abstract argumentation ⋮ Constrained incomplete argumentation frameworks ⋮ Generalizing complete semantics to bipolar argumentation frameworks ⋮ Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Argument strength in probabilistic argumentation based on defeasible rules ⋮ Logic Programming, Argumentation and Human Reasoning ⋮ Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation ⋮ A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ Belief revision and computational argumentation: a critical comparison ⋮ Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework ⋮ Integrated preference argumentation and applications in consumer behaviour analyses ⋮ Logical argumentation by dynamic proof systems ⋮ A postulate-driven study of logical argumentation ⋮ On incompleteness in abstract argumentation: complexity and expressiveness ⋮ A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation ⋮ Topological conditions and solutions for repairing argumentation frameworks ⋮ Audience irrelevance in strategic argumentation games ⋮ Representing abstract dialectical frameworks with binary decision diagrams ⋮ The burden of persuasion in abstract argumentation ⋮ Extension-based semantics for incomplete argumentation frameworks ⋮ Inconsistency Measurement ⋮ Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study ⋮ Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability ⋮ Argumentative explanations for interactive recommendations ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ Realizability of three-valued semantics for abstract dialectical frameworks ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ A Comparative Study of Some Central Notions of ASPIC+ and DeLP ⋮ A review of the relations between logical argumentation and reasoning with maximal consistency ⋮ EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface ⋮ Probabilistic argumentation: an approach based on conditional probability. A preliminary report ⋮ On the graded acceptability of arguments in abstract and instantiated argumentation ⋮ A general notion of equivalence for abstract argumentation ⋮ Paraconsistent inference relations induced from inconsistency measures ⋮ Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence
This page was built for publication:
