Semi-equilibrium models for paracoherent answer set programs
From MaRDI portal
(Redirected from Publication:253992)
Recommendations
Cites work
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4147465 (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?)
- A three-valued semantics for deductive databases and logic programs
- An abductive framework for computing knowledge base updates
- Approved Models for Normal Logic Programs
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- Depth-First Search and Linear Graph Algorithms
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Equilibrium logic
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
- Logic programs, well-orderings, and forward chaining
- Logical Weak Completions of Paraconsistent Logics
- Magic Sets and their application to data integration
- Modular nonmonotonic logic programming revisited
- Modular paracoherent answer sets
- Modularity aspects of disjunctive stable models
- Nested expressions in logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- On the partial semantics for disjunctive deductive databases
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Paraconsistent logic programming
- Partial equilibrium logic
- Propositional semantics for disjunctive logic programs
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Reasoning with inconsistencies in hybrid MKNF knowledge bases
- Stepwise debugging of description-logic programs
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The alternating fixpoint of logic programs with negation
- The well-founded semantics for general logic programs
- Weight constraints as nested expressions
Cited in
(16)- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Paracoherent answer set computation
- Modular paracoherent answer sets
- The Seventh Answer Set Programming Competition: Design and Results
- Witnesses for Answer Sets of Logic Programs
- Autoepistemic answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Refining the semantics of epistemic specifications
- Approximating operators and semantics for abstract dialectical frameworks
- Determining inference semantics for disjunctive logic programs
- Weakening and extending \(\mathbb{Z}\)
- Solving problems in the polynomial hierarchy with ASP(Q)
This page was built for publication: Semi-equilibrium models for paracoherent answer set programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q253992)
