Paraconsistent Stable Semantics for Extended Disjunctive Programs
From MaRDI portal
Publication:4835533
DOI10.1093/LOGCOM/5.3.265zbMATH Open0827.68070OpenAlexW1985161451MaRDI QIDQ4835533FDOQ4835533
Authors: Chiaki Sakama, Katsumi Inoue
Publication date: 6 June 1995
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0678163b9cc337f1a8d9e085f093f5ee620e7ca2
Recommendations
Paraconsistent logics (03B53) Logic programming (68N17) Semantics in the theory of computing (68Q55)
Cited In (27)
- Semi-equilibrium models for paracoherent answer set programs
- On deductive bases for paraconsistent answer set semantics
- Assumption-based argumentation for extended disjunctive logic programming
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Stable classes and operator pairs for disjunctive programs
- Equilibrium logic
- Stable-unstable semantics: Beyond NP with normal logic programs
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Logical foundations and complexity of 4QL, a query language with unrestricted negation
- Ordering default theories and nonmonotonic logic programs
- Dependency semantics for sequences of extended logic programs
- Paracoherent answer set computation
- Modular paracoherent answer sets
- Witnesses for Answer Sets of Logic Programs
- Quasi-classical reasoning in paraconsistent databases
- Interpreting disjunctive logic programs based on a strong sense of disjunction
- An encompassing framework for paraconsistent logic programs
- Data repair of inconsistent nonmonotonic description logic programs
- On logics and semantics for general logic programs
- Determining inference semantics for disjunctive logic programs
- Paraconsistent declarative semantics for extended logic programs
- Better Paracoherent Answer Sets with Less Resources
- Paracoherent Answer Set Semantics meets Argumentation Frameworks
- Solving problems in the polynomial hierarchy with ASP(Q)
- Title not available (Why is that?)
- Semantics for possibilistic disjunctive 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)