Paracoherent answer set computation
From MaRDI portal
Publication:2238696
DOI10.1016/J.ARTINT.2021.103519OpenAlexW3157980852MaRDI QIDQ2238696FDOQ2238696
Authors: Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, F. Ricca 
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2021.103519
Recommendations
- Algorithm selection for paracoherent answer set computation
- Modular paracoherent answer sets
- Semi-equilibrium models for paracoherent answer set programs
- Cooperating Answer Set Programming
- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- Coordination in answer set programming
- On deductive bases for paraconsistent answer set semantics
- A multiparametric view on answer set programming
Cites Work
- Title not available (Why is that?)
- Advances in WASP
- \textsc{lp2normal} -- a normalization tool for extended logic programs
- A three-valued semantics for deductive databases and logic programs
- On the partial semantics for disjunctive deductive databases
- Extending and implementing the stable model semantics
- Propositional semantics for disjunctive logic programs
- Semi-equilibrium models for paracoherent answer set programs
- On the query complexity of selecting minimal sets for monotone predicates
- Modular paracoherent answer sets
- Approved Models for Normal Logic Programs
- Logical Weak Completions of Paraconsistent Logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Algorithms for computing backbones of propositional formulae
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Solving satisfiability problems with preferences
- Equilibrium logic
- SATzilla: portfolio-based algorithm selection for SAT
- Answer sets for consistent query answering in inconsistent databases
- On Solving the Partial MAX-SAT Problem
- Reasoning with minimal models: efficient algorithms and applications
- Handbook of knowledge representation.
- Title not available (Why is that?)
- Logic programming and knowledge representation
- Title not available (Why is that?)
- On the tractability of minimal model computation for some CNF theories
- Head-Elementary-Set-Free Logic Programs
- Automatic construction of parallel portfolios via algorithm configuration
- Unsatisfiability-based optimization in clasp
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Tight logic programs
- Title not available (Why is that?)
- Explanation in artificial intelligence: insights from the social sciences
- Positive unit hyperresolution tableaux and their application to minimal model generation
- A tableau calculus for minimal model reasoning
- Ordered completion for logic programs with aggregates
- The Design of the Sixth Answer Set Programming Competition
- Answer Set Programming: A Primer
- The Seventh Answer Set Programming Competition: Design and Results
- The Sixth Answer Set Programming Competition
- Design and results of the Fifth Answer Set Programming Competition
- Optimum stable model search: algorithms and implementation
- Logic programming and knowledge representation. 3rd international workshop, LPKR '97, Port Jefferson, NY, USA, October 17, 1997. Proceedings
- An encompassing framework for paraconsistent logic programs
- Progress in clasp series 3
- Taming primary key violations to query large inconsistent data via ASP
- Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
- Title not available (Why is that?)
- Anytime computation of cautious consequences in answer set programming
- Improving the normalization of weight rules in answer set programs
- Solving set optimization problems by cardinality optimization with an application to argumentation
- Improved answer-set programming encodings for abstract argumentation
- The External Interface for Extending WASP
- Paracoherent answer set semantics meets argumentation frameworks
Cited In (7)
- Semi-equilibrium models for paracoherent answer set programs
- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Modular paracoherent answer sets
- Enumeration of minimal models and MUSes in WASP
- Solving problems in the polynomial hierarchy with ASP(Q)
Uses Software
This page was built for publication: Paracoherent answer set computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238696)
