Semantic-based construction of arguments: an answer set programming approach

DOI10.1016/j.ijar.2015.06.009zbMath1344.68222OpenAlexW1884320465MaRDI QIDQ899190

Juan Carlos Nieves, Helena Lindgren, Esteban Guerrero

Publication date: 21 December 2015

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2015.06.009

zbMATH Keywords

well-founded semanticslogic programmingargumentationanswer set programmingstable model semanticsargumentation tools

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (1)

Approximating agreements in formal argumentation dialogues1

Uses Software

• XSB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general account of argumentation with preferences
• Algorithms for generating arguments and counterarguments in propositional logic
• Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
• On the evaluation of argumentation formalisms
• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• An abstract, argumentation-theoretic approach to default reasoning
• A reasoning model based on the production of acceptable arguments
• Fixpoint semantics for logic programming a survey
• On the declarative and procedural semantics of logic programs
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Dialectic proof procedures for assumption-based, admissible argumentation
• Closure and Consistency In Logic-Associated Argumentation
• XSB: Extending Prolog with Tabled Logic Programming
• Argumentation and Answer Set Programming
• Argument-based extended logic programming with defeasible priorities
• Logics with Common Weak Completions
• A kripke-kleene semantics for logic programs*
• Negation in logic programming
• Negation as failure using tight derivations for general logic programs
• Nonmonotonic Logic II
• The well-founded semantics for general logic programs
• Logic programming and knowledge representation
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Transformation-based bottom-up computation of the well-founded model
• Justifying answer sets using argumentation
• Argumentation Semantics for Defeasible Logic
• Defeasible logic programming: an argumentative approach
• Why are there so many loop formulas?
• Abductive Logic Programming
• On the Equivalence between Logic Programming Semantics and Argumentation Semantics
• Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
• A general theory of confluent rewriting systems for logic programming and its applications

This page was built for publication: Semantic-based construction of arguments: an answer set programming approach