Paraconsistent Stable Semantics for Extended Disjunctive Programs
From MaRDI portal
Publication:4835533
DOI10.1093/logcom/5.3.265zbMath0827.68070OpenAlexW1985161451MaRDI QIDQ4835533
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
Semantics in the theory of computing (68Q55) Logic programming (68N17) Paraconsistent logics (03B53)
Related Items
Witnesses for Answer Sets of Logic Programs, Logical foundations and complexity of 4QL, a query language with unrestricted negation, Data repair of inconsistent nonmonotonic description logic programs, Equilibrium logic, Quasi-classical reasoning in paraconsistent databases, Modular Paracoherent Answer Sets, On deductive bases for paraconsistent answer set semantics, 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 Semantics meets Argumentation Frameworks, Better Paracoherent Answer Sets with Less Resources, Solving problems in the polynomial hierarchy with ASP(Q), Paracoherent answer set computation, Ordering default theories and nonmonotonic logic programs, Determining inference semantics for disjunctive logic programs, Assumption-based argumentation for extended disjunctive logic programming, Semi-equilibrium models for paracoherent answer set programs
