Logics with Common Weak Completions

DOI10.1093/logcom/exl013zbMath1116.03022OpenAlexW2011567991MaRDI QIDQ3431977

José Ramón Enrique Arrazola Ramírez, Verónica Borja Macías, Mauricio Osorio Galindo, Juan Antonio Navarro Pérez

Publication date: 13 April 2007

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exl013

zbMATH Keywords

nonmonotonic reasoningparaconsistent logicmulti-valued logicnormal modal logicsnormal logic programsstable model semantics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Logic in computer science (03B70) Logic programming (68N17) Many-valued logic (03B50) Paraconsistent logics (03B53)

Related Items (14)

An extension of the stable semantics via Lukasiewicz logic ⋮ Revisiting da Costa logic ⋮ Quasi-classical reasoning in paraconsistent databases ⋮ Range-based argumentation semantics as two-valued models ⋮ Fidel Semantics for Propositional and First-Order Version of the Logic of CG’3 ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ Revisiting \(\mathbb Z\) ⋮ Weakening and extending \(\mathbb{Z}\) ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ On paraconsistent extensions of \(C_1\) ⋮ Expressing Extension-Based Semantics Based on Stratified Minimal Models ⋮ Brief study of G'₃ logic ⋮ A family of genuine and non-algebraisable C-systems ⋮ Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

This page was built for publication: Logics with Common Weak Completions