On deductive bases for paraconsistent answer set semantics
From MaRDI portal
Publication:4583312
DOI10.1080/11663081.2013.798971zbMath1400.68050OpenAlexW2006628898MaRDI QIDQ4583312
N. V. Mayatskiy, Sergei P. Odintsov
Publication date: 28 August 2018
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.2013.798971
Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17) Paraconsistent logics (03B53)
Related Items (1)
Cites Work
- Generalized Kripke semantics for Nelson's logic
- The class of extensions of Nelson's paraconsistent logic
- An algebraic approach to non-classical logics
- Semantical analyses of propositional systems of Fitch and Nelson
- Intuitionistic logic with strong negation
- Intuitive semantics for first-degree entailments and `coupled trees'
- On the representation of \(\mathbf{N4}\)-lattices
- N-lattices and constructive logic with strong negation
- Constructible falsity and inexact predicates
- Natural 3-valued logics—characterization and proof theory
- Algebraic Semantics for Paraconsistent Nelson's Logic
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Logic programming with strong negation
- Logic Programming and Nonmonotonic Reasoning
- A semantical study of constructible falsity
- Strongly equivalent logic programs
- Constructible falsity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On deductive bases for paraconsistent answer set semantics
