On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
From MaRDI portal
(Redirected from Publication:1855240)
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
Recommendations
- From logic programming and non-monotonic reasoning to computational argumentation and beyond
- On computing the set of acceptable arguments in abstract argumentation
- Explaining non-acceptability in abstract argumentation
- Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
- Acceptance in incomplete argumentation frameworks
- On the links between argumentation-based reasoning and nonmonotonic reasoning
- On the graded acceptability of arguments in abstract and instantiated argumentation
- A nonmonotonic modal formalization of the logic of acceptance and rejection
- A dialectical proof theory for universal acceptance in coherent logic-based argumentation frameworks
- scientific article; zbMATH DE number 994060
Cites work
- scientific article; zbMATH DE number 3843676 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4166925 (Why is no real title available?)
- scientific article; zbMATH DE number 5719290 (Why is no real title available?)
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 41230 (Why is no real title available?)
- scientific article; zbMATH DE number 108390 (Why is no real title available?)
- scientific article; zbMATH DE number 140387 (Why is no real title available?)
- scientific article; zbMATH DE number 140416 (Why is no real title available?)
- scientific article; zbMATH DE number 194618 (Why is no real title available?)
- scientific article; zbMATH DE number 1568685 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A kripke-kleene semantics for logic programs*
- A logic for default reasoning
- A logical framework for default reasoning
- A mathematical treatment of defeasible reasoning and its implementation.
- A theory of nonmonotonic rule systems I
- Abductive Logic Programming
- Circumscription - a form of non-monotonic reasoning
- Completed logic programs and their consistency
- Justification and defeat
- Negation in logic programming
- Non-monotonic logic. I
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the relation between default and autoepistemic logic
- On the relations between stable and well-founded semantics of logic programs
- Semantical considerations on nonmonotonic logic
- Short note preferred extensions are partial stable models
- The effect of knowledge on belief: Conditioning, specificity and the lottery paradox in default reasoning
- The well-founded semantics for general logic programs
Cited in
(only showing first 100 items - show all)- Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
- Extracting the Core of a Persuasion Dialog to Evaluate Its Quality
- Augmenting tractable fragments of abstract argumentation
- On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics
- A Dynamic Approach for Combining Abstract Argumentation Semantics
- Argument graphs and assumption-based argumentation
- Domain expansion for ASP-programs with external sources
- Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support
- Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks
- Argumentation and answer set programming
- Abductive inference in defeasible reasoning: a model for research programmes
- Probabilistic causal bipolar abstract argumentation: an approach based on credal networks
- Goal-Driven Structured Argumentation for Patient Management in a Multimorbidity Setting
- Argumentation-based semantics for logic programs with first-order formulae
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Reduction-based approaches to implement Modgil's extended argumentation 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
- Metalogical contributions to the nonmonotonic theory of abstract argumentation
- A belief revision approach for argumentation-based negotiation agents
- A model building framework for answer set programming with external computations
- A multi attack argumentation framework
- A Hybrid Argumentation of Symbolic and Neural Net Argumentation (Part II)
- A Persuasion Dialog for Gaining Access to Information
- A paradox of expert rights in abstract argumentation
- 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
- The logic of group decisions: judgment aggregation
- Conflict-tolerant semantics for argumentation frameworks
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Mind the divide surrounding knowledge representation
- Assumption-based argumentation for extended disjunctive logic programming
- A unifying view for logic programming with non-monotonic reasoning
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- Strong equivalence for argumentation semantics based on conflict-free sets
- Two roles of preferences in argumentation frameworks
- Co-argumentation Artifact for Agent Societies
- Parameterized splitting: a simple modification-based approach
- Equilibria in social belief removal
- Algorithms for computing the set of acceptable arguments
- Modal provability foundations for argumentation networks
- Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change
- scientific article; zbMATH DE number 2086469 (Why is no real title available?)
- Argument-based extended logic programming with defeasible priorities
- Equivalence in logic-based argumentation
- A postulate-driven study of logical argumentation
- Weakest link in formal argumentation: lookahead and principle-based analysis
- Admissibility in Probabilistic Argumentation
- Initial sets in abstract argumentation frameworks
- Dynamics of knowledge in \textsc{DeLP} through argument theory change
- Foundations for a logic of arguments
- Normality, non-contamination and logical depth in classical natural deduction
- scientific article; zbMATH DE number 7450036 (Why is no real title available?)
- Design and results of the second international competition on computational models of argumentation
- On the equivalence between logic programming semantics and argumentation semantics
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Practical reasoning using values: an argumentative approach based on a hierarchy of values
- A tutorial in proof-theoretic approaches to logical argumentation
- Gödel semantics of fuzzy argumentation frameworks with consistency degrees
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Proximity semantics for topic-based abstract argumentation
- A Formalization of the Slippery Slope Argument
- Broadening Label-Based Argumentation Semantics with May-Must Scales
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Arguing about the trustworthiness of the information sources
- On the graded acceptability of arguments in abstract and instantiated argumentation
- A dialectical formalisation of preferred subtheories reasoning under resource bounds
- Weighted argumentation for analysis of discussions in Twitter
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Expressing Extension-Based Semantics Based on Stratified Minimal Models
- Stability of extensions in incomplete argumentation frameworks
- Towards a dialogue game-based semantics for extended abstract argumentation frameworks based on indecision-blocking
- Integrating user preferences into gradual bipolar argumentation for personalised decision support
- Kernels in digraphs that are not kernel perfect
- From logic programming and non-monotonic reasoning to computational argumentation and beyond
- Equivalence for the G₃^-stable models semantics
- Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
- Modelling last-act attempted crime in criminal law
- Neighborhood-based argumental community support in the context of multi-topic debates
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients
- Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
- Revealed preference in argumentation: algorithms and applications
- Petitio principii and circular argumentation as seen from a theory of dialectical structures
- Logic Programming, Argumentation and Human Reasoning
- Simple contrapositive assumption-based argumentation. II: Reasoning with preferences
- Measures of inconsistency and defaults
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- The computational complexity of ideal semantics
- A QBF-based formalization of abstract argumentation semantics
- On the equivalence between abstract dialectical frameworks and logic programs
- Lakatos-style collaborative mathematics through dialectical, structured and abstract argumentation
- Mathematical arguments and distributed knowledge
- Abduction in argumentation frameworks
- t-DeLP: an argumentation-based temporal defeasible logic programming framework
- A general notion of equivalence for abstract argumentation
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)
