Logic Programming with Strong Negation and Inexact Predicates

DOI10.1093/logcom/1.6.835zbMath0738.68018OpenAlexW2015627330MaRDI QIDQ3988060

Gerd Wagner

Publication date: 28 June 1992

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

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

zbMATH Keywords

model theoryproof theoryinconsistencylogic programs with strong negationnon-wellfounded programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Many-valued logic (03B50)

Related Items

Linear and affine logics with temporal, spatial and epistemic operators, Inconsistency-Tolerant Multi-Agent Calculus, A logic programming system for nonmonotonic reasoning, Semantics-based nonmonotonic inference, Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation, Abduction over 3-valued extended logic programs, Tableaux for logic programming with strong negation, Inconsistency-tolerant temporal reasoning with hierarchical information, Paraconsistent computation tree logic, A variant of Thomason's first-order logic CF based on situations, Combining linear-time temporal logic with constructiveness and paraconsistency, A rule based knowledge transaction model for mobile environments, Phase semantics and Petri net interpretation for resource-sensitive strong negation, A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics, Proof theory of Nelson's paraconsistent logic: a uniform perspective, Logic programming and knowledge representation---The A-Prolog perspective, Gentzen-type methods for bilattice negation, Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic, Informational interpretation of substructural propositional logics