Semantic-based construction of arguments: an answer set programming approach
From MaRDI portal
Publication:899190
DOI10.1016/J.IJAR.2015.06.009zbMATH Open1344.68222OpenAlexW1884320465MaRDI QIDQ899190FDOQ899190
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
answer set programmingargumentationlogic programmingwell-founded semanticsstable model semanticsargumentation tools
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- XSB: extending Prolog with tabled logic programming
- An abstract, argumentation-theoretic approach to default reasoning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Dialectic proof procedures for assumption-based, admissible argumentation
- A general account of argumentation with preferences
- The well-founded semantics for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Defeasible logic programming: an argumentative approach
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
- Abductive Logic Programming
- A logic for default reasoning
- Logics with Common Weak Completions
- On the evaluation of argumentation formalisms
- Semantical considerations on nonmonotonic logic
- Circumscription - a form of non-monotonic reasoning
- A reasoning model based on the production of acceptable arguments
- Argument-based extended logic programming with defeasible priorities
- Argumentation Semantics for Defeasible Logic
- A kripke-kleene semantics for logic programs*
- Fixpoint semantics for logic programming a survey
- Logic programming and knowledge representation
- Algorithms for generating arguments and counterarguments in propositional logic
- On the declarative and procedural semantics of logic programs
- Negation in logic programming
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Argumentation and Answer Set Programming
- Nonmonotonic Logic II
- Why are there so many loop formulas?
- Negation as failure using tight derivations for general logic programs
- Transformation-based bottom-up computation of the well-founded model
- Closure and consistency in logic-associated argumentation
- Justifying answer sets using argumentation
- On the Equivalence between Logic Programming Semantics and Argumentation Semantics
- A general theory of confluent rewriting systems for logic programming and its applications
Cited In (4)
Uses Software
This page was built for publication: Semantic-based construction of arguments: an answer set programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899190)