Paraconsistent Stable Semantics for Extended Disjunctive Programs
From MaRDI portal
Publication:4835533
Recommendations
Cited in
(27)- Ordering default theories and nonmonotonic logic programs
- On logics and semantics for general logic programs
- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- Modular paracoherent answer sets
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- On deductive bases for paraconsistent answer set semantics
- An encompassing framework for paraconsistent logic programs
- Quasi-classical reasoning in paraconsistent databases
- Interpreting disjunctive logic programs based on a strong sense of disjunction
- Dependency semantics for sequences of extended logic programs
- Paraconsistent declarative semantics for extended logic programs
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Semi-equilibrium models for paracoherent answer set programs
- Semantics for possibilistic disjunctive programs
- Stable classes and operator pairs for disjunctive programs
- Paracoherent answer set computation
- Witnesses for Answer Sets of Logic Programs
- Logical foundations and complexity of 4QL, a query language with unrestricted negation
- Assumption-based argumentation for extended disjunctive logic programming
- Data repair of inconsistent nonmonotonic description logic programs
- Determining inference semantics for disjunctive logic programs
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Equilibrium logic
- scientific article; zbMATH DE number 4026795 (Why is no real title available?)
- Solving problems in the polynomial hierarchy with ASP(Q)
- Stable-unstable semantics: Beyond NP with normal logic programs
This page was built for publication: Paraconsistent Stable Semantics for Extended Disjunctive Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835533)
