Paracoherent answer set computation
From MaRDI portal
Publication:2238696
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
- scientific article; zbMATH DE number 1614696 (Why is no real title available?)
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- scientific article; zbMATH DE number 3640922 (Why is no real title available?)
- scientific article; zbMATH DE number 592368 (Why is no real title available?)
- scientific article; zbMATH DE number 1890629 (Why is no real title available?)
- A tableau calculus for minimal model reasoning
- A three-valued semantics for deductive databases and logic programs
- Advances in WASP
- Algorithms for computing backbones of propositional formulae
- An encompassing framework for paraconsistent logic programs
- Answer Set Programming: A Primer
- Answer sets for consistent query answering in inconsistent databases
- Anytime computation of cautious consequences in answer set programming
- Approved Models for Normal Logic Programs
- Automatic construction of parallel portfolios via algorithm configuration
- Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
- Design and results of the Fifth Answer Set Programming Competition
- Equilibrium logic
- Explanation in artificial intelligence: insights from the social sciences
- Extending and implementing the stable model semantics
- Handbook of knowledge representation.
- Head-Elementary-Set-Free Logic Programs
- Improved answer-set programming encodings for abstract argumentation
- Improving the normalization of weight rules in answer set programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programming and knowledge representation
- Logic programming and knowledge representation. 3rd international workshop, LPKR '97, Port Jefferson, NY, USA, October 17, 1997. Proceedings
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Logical Weak Completions of Paraconsistent Logics
- Modular paracoherent answer sets
- On Solving the Partial MAX-SAT Problem
- On the partial semantics for disjunctive deductive databases
- On the query complexity of selecting minimal sets for monotone predicates
- On the tractability of minimal model computation for some CNF theories
- Optimum stable model search: algorithms and implementation
- Ordered completion for logic programs with aggregates
- Paracoherent answer set semantics meets argumentation frameworks
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Positive unit hyperresolution tableaux and their application to minimal model generation
- Progress in clasp series 3
- Propositional semantics for disjunctive logic programs
- Reasoning with minimal models: efficient algorithms and applications
- SATzilla: portfolio-based algorithm selection for SAT
- Semi-equilibrium models for paracoherent answer set programs
- Solving satisfiability problems with preferences
- Solving set optimization problems by cardinality optimization with an application to argumentation
- Taming primary key violations to query large inconsistent data via ASP
- The Design of the Sixth Answer Set Programming Competition
- The External Interface for Extending WASP
- The Seventh Answer Set Programming Competition: Design and Results
- The Sixth Answer Set Programming Competition
- The well-founded semantics for general logic programs
- Tight logic programs
- Unsatisfiability-based optimization in clasp
- 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
Cited in
(7)- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- Modular paracoherent answer sets
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Semi-equilibrium models for paracoherent answer set programs
- Enumeration of minimal models and MUSes in WASP
- Solving problems in the polynomial hierarchy with ASP(Q)
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)
