Paracoherent answer set computation
From MaRDI portal
Publication:2238696
DOI10.1016/J.ARTINT.2021.103519OpenAlexW3157980852MaRDI QIDQ2238696
Francesco Ricca, Wolfgang Faber, Giovanni Amendola, Carmine Dodaro
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
Related Items (3)
ASP and subset minimality: enumeration, cautious reasoning and MUSes ⋮ Enumeration of minimal models and MUSes in WASP ⋮ Solving problems in the polynomial hierarchy with ASP(Q)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-equilibrium models for paracoherent answer set programs
- On the query complexity of selecting minimal sets for monotone predicates
- On the tractability of minimal model computation for some CNF theories
- Automatic construction of parallel portfolios via algorithm configuration
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Solving satisfiability problems with preferences
- Equilibrium logic
- Ordered completion for logic programs with aggregates
- Design and results of the Fifth Answer Set Programming Competition
- Reasoning with minimal models: efficient algorithms and applications
- Logic programming and knowledge representation. 3rd international workshop, LPKR '97, Port Jefferson, NY, USA, October 17, 1997. Proceedings
- A three-valued semantics for deductive databases and logic programs
- On the partial semantics for disjunctive deductive databases
- Positive unit hyperresolution tableaux and their application to minimal model generation
- Extending and implementing the stable model semantics
- An encompassing framework for paraconsistent logic programs
- Propositional semantics for disjunctive logic programs
- Explanation in artificial intelligence: insights from the social sciences
- Web reasoning and rule systems. 9th international conference, RR 2015, Berlin, Germany, August 4--5, 2015. Proceedings
- \textsc{lp2normal} -- a normalization tool for extended logic programs
- Anytime Computation of Cautious Consequences in Answer Set Programming
- Improving the Normalization of Weight Rules in Answer Set Programs
- Modular Paracoherent Answer Sets
- Optimum stable model search: algorithms and implementation
- Advances in WASP
- Progress in clasp Series 3
- The Design of the Sixth Answer Set Programming Competition
- Approved Models for Normal Logic Programs
- Logical Weak Completions of Paraconsistent Logics
- Answer Set Programming: A Primer
- The well-founded semantics for general logic programs
- Logic programming and knowledge representation
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation
- Algorithms for computing backbones of propositional formulae
- Improved answer-set programming encodings for abstract argumentation
- 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)
- A tableau calculus for minimal model reasoning
- Answer sets for consistent query answering in inconsistent databases
- Tight logic programs
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- The Seventh Answer Set Programming Competition: Design and Results
- The External Interface for Extending WASP
- Paracoherent Answer Set Semantics meets Argumentation Frameworks
- The Sixth Answer Set Programming Competition
- Unsatisfiability-based optimization in clasp
- Head-Elementary-Set-Free Logic Programs
- On Solving the Partial MAX-SAT Problem
This page was built for publication: Paracoherent answer set computation
