Programming in three-valued logic

DOI10.1016/0304-3975(51)90008-4zbMath0716.68022OpenAlexW2067116405MaRDI QIDQ753474

V. Thibau, Jean-Paul Delahaye

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(51)90008-4

zbMATH Keywords

deductive databaseslogic programs with negation

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17) Many-valued logic (03B50)

Related Items (4)

A kind of logical compilation for knowledge bases ⋮ Institutions of variable truth values: An approach in the ordered style ⋮ QUANTUM COMPUTATIONAL FINITE-VALUED LOGICS ⋮ Legality concepts for three-valued logic programs

Cites Work

• Optimal fixedpoints of logic programs
• Notes on the mathematical aspects of Kripke's theory of truth
• Partial models and logic programming
• A sound and complete semantics for a version of negation as failure
• A kripke-kleene semantics for logic programs*
• Negation as inconsistency. I
• Quantitative deduction and its fixpoint theory
• Clausal intuitionistic logic I. fixed-point semantics
• Complete logic programs with domain-closure axiom
• Negation in logic programming
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• The Theoretical Aspects of the Optimal Fixedpoint
• The optimal approach to recursive programs
• Axiom schemes for m-valued propositions calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Programming in three-valued logic