On deductive bases for paraconsistent answer set semantics

DOI10.1080/11663081.2013.798971MaRDI QIDQ4583312zbMATH OpenOpenAlexFDO

Authors N. V. Mayatskiy, S. 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

zbMATH Keywords

paraconsistencystrong negationNelson logiclattice of logicstwist-structuresanswer setdeductive base

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Logic programming (68N17) Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55)

Recommendations

• Logic Programming and Nonmonotonic Reasoning
• scientific article; zbMATH DE number 6290314
• scientific article; zbMATH DE number 4128792
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• scientific article; zbMATH DE number 1241673

Cites work

• scientific article; zbMATH DE number 3648682 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 3412605 (Why is no real title available?)
• scientific article; zbMATH DE number 3074070 (Why is no real title available?)
• scientific article; zbMATH DE number 3074071 (Why is no real title available?)
• A semantical study of constructible falsity
• Algebraic Semantics for Paraconsistent Nelson's Logic
• An algebraic approach to non-classical logics
• Constructible falsity
• Constructible falsity and inexact predicates
• Generalized Kripke semantics for Nelson's logic
• Intuitionistic logic with strong negation
• Intuitive semantics for first-degree entailments and `coupled trees'
• Logic Programming and Nonmonotonic Reasoning
• Logic programming with strong negation
• N-lattices and constructive logic with strong negation
• Natural 3-valued logics—characterization and proof theory
• On extensions of Nelson's logic satisfying Dummett's axiom
• On the representation of \(\mathbf{N4}\)-lattices
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• Semantical analyses of propositional systems of Fitch and Nelson
• Strongly equivalent logic programs
• The class of extensions of Nelson's paraconsistent logic

Cited in

(3)

• Paracoherent answer set computation
• Quasi-classical reasoning in paraconsistent databases
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: On deductive bases for paraconsistent answer set semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583312)