Abstract argumentation and answer set programming: two faces of Nelson's logic
From MaRDI portal
Cites work
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- A logic for default reasoning
- A logical account of formal argumentation
- A new logical characterisation of stable models and answer sets
- A QBF-based formalization of abstract argumentation semantics
- A semantical study of constructible falsity
- AFRA: argumentation framework with recursive attacks
- Argumentation and answer set programming
- Characterizing strong equivalence for argumentation frameworks
- Collective Argumentation and Disjunctive Logic Programming
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Computer supported argumentation and collaborative decision making: The HERMES system
- Conflict-driven answer set solving: from theory to practice
- Constructible falsity
- Constructible falsity and inexact predicates
- Constructive predicate logic with strong negation and model theory
- DefLog: on the Logical Interpretation of Prima Facie Justified Assumptions
- Design and implementation of aggregate functions in the DLV system
- Encoding argument graphs in logic
- Equilibrium logic
- scientific article; zbMATH DE number 3139759 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 6407640 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- scientific article; zbMATH DE number 3412605 (Why is no real title available?)
- scientific article; zbMATH DE number 3074070 (Why is no real title available?)
- Inference rules in Nelson's logics, admissibility and weak admissibility
- Intuitionistic logic with strong negation
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming and Nonmonotonic Reasoning
- Logics in Artificial Intelligence
- Mechanizing Mathematical Reasoning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the equivalence between logic programming semantics and argumentation semantics
- On the theory of inconsistent formal systems
- Paracoherent answer set semantics meets argumentation frameworks
- Paraconsistent logic programming
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Partial equilibrium logic
- Preferred extensions as stable models
- Reasoning about preferences in argumentation frameworks
- Reduction-based approaches to implement Modgil's extended argumentation frameworks
- Safe beliefs for propositional theories
- Semantical analyses of propositional systems of Fitch and Nelson
- Semantics for higher level attacks in extended argumentation frames. I: Overview
- Semi-equilibrium models for paracoherent answer set programs
- Semi-stable semantics
- Strongly equivalent logic programs
- The attack as intuitionistic negation
- The attack as strong negation. I
- The class of extensions of Nelson's paraconsistent logic
- Three-valued nonmonotonic formalisms and semantics of logic programs
This page was built for publication: Abstract argumentation and answer set programming: two faces of Nelson's logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027214)