Semantic-based construction of arguments: an answer set programming approach
type: Item
instance of: scholarly article
title: Semantic-based construction of arguments: an answer set programming approach
zbMATH Open document ID: 1344.68222
author: Esteban Guerrero
author: Juan Carlos Nieves
author: Helena Lindgren
published in: International Journal of Approximate Reasoning
publication date: 2015-12-21T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 6523024
zbMATH Keywords: argumentation
zbMATH Keywords: logic programming
zbMATH Keywords: well-founded semantics
zbMATH Keywords: argumentation tools
zbMATH Keywords: stable model semantics
zbMATH Keywords: answer set programming
describes a project that uses: XSB
MaRDI profile type: Publication
full work available at URL: j.ijar.2015.06.009
OpenAlex ID: W1884320465
cites work: Q5633670
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Nonmonotonic Logic II
cites work: Semantical considerations on nonmonotonic logic
cites work: A logic for default reasoning
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: An abstract, argumentation-theoretic approach to default reasoning
cites work: A reasoning model based on the production of acceptable arguments
cites work: Algorithms for generating arguments and counterarguments in propositional logic
cites work: Defeasible logic programming: an argumentative approach
cites work: Q3983043
cites work: Q4391449
cites work: Abductive Logic Programming
cites work: Q4420273
cites work: The well-founded semantics for general logic programs
cites work: Q4386939
cites work: Knowledge Representation, Reasoning and Declarative Problem Solving
cites work: Fixpoint semantics for logic programming a survey
cites work: On the evaluation of argumentation formalisms
cites work: Closure and consistency in logic-associated argumentation
cites work: A kripke-kleene semantics for logic programs*
cites work: On the declarative and procedural semantics of logic programs
cites work: Logics with Common Weak Completions
cites work: Q4327612
cites work: Negation as failure using tight derivations for general logic programs
cites work: Why are there so many loop formulas?
cites work: Q4327611
cites work: A general theory of confluent rewriting systems for logic programming and its applications
cites work: Transformation-based bottom-up computation of the well-founded model
cites work: Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
cites work: Negation in logic programming
cites work: XSB: extending Prolog with tabled logic programming
cites work: Logic programming and knowledge representation
cites work: Q4225120
cites work: Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
cites work: Argumentation and Answer Set Programming
cites work: A general account of argumentation with preferences
cites work: Dialectic proof procedures for assumption-based, admissible argumentation
cites work: Justifying answer sets using argumentation
cites work: Complete extensions in argumentation coincide with 3-valued stable models in logic programming
cites work: On the Equivalence between Logic Programming Semantics and Argumentation Semantics
cites work: Argument-based extended logic programming with defeasible priorities
cites work: Argumentation Semantics for Defeasible Logic
DOI: 10.1016/J.IJAR.2015.06.009
description: scientific article; zbMATH DE number 6523024