Paraconsistent Stable Semantics for Extended Disjunctive Programs

DOI10.1093/logcom/5.3.265zbMath0827.68070MaRDI QIDQ4835533

Katsumi Inoue, Chiaki Sakama

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

zbMATH Keywords

disjunctive logic programs; declarative semantics; paraconsistent semantics

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68N17: Logic programming

03B53: Paraconsistent logics

Related Items

On deductive bases for paraconsistent answer set semantics, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Better Paracoherent Answer Sets with Less Resources, Witnesses for Answer Sets of Logic Programs, Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Semi-equilibrium models for paracoherent answer set programs, Data repair of inconsistent nonmonotonic description logic programs, Ordering default theories and nonmonotonic logic programs, Equilibrium logic, Quasi-classical reasoning in paraconsistent databases, Assumption-based argumentation for extended disjunctive logic programming, Paracoherent answer set computation, Determining inference semantics for disjunctive logic programs, Solving problems in the polynomial hierarchy with ASP(Q), Logical foundations and complexity of 4QL, a query language with unrestricted negation, Modular Paracoherent Answer Sets