Legality concepts for three-valued logic programs
The authors consider three-valued propositional logic and interpret the third truth degree (besides 0 and 1) as ``illegal or ``unacceptable. With reference to a background in computer science they get (unusual) truth tables for an implication and -- noncommutative (!) -- conjunction and disjunction connectives. And they add a ``legality connective indicating that some formula has a ``legal truth degree, i.e. one of the degrees 0,1. For this logic they study Horn clauses and logic programs, introduce Herbrand models and fixpoint semantics. For the class of ``legal three- valued logic programs the use of the SLD resolution algorithm is proven to be sound, and it is shown that this algorithm too can be used for a legality check.
- A basis for deductive database systems
- A kripke-kleene semantics for logic programs*
- A polymorphic type system for Prolog
- A RING-THEORETIC BASIS FOR LOGIC PROGRAMMING
- Eine dreiwertige Logik zur Verarbeitung partieller Information. (A three- valued logic for partial information processing)
- scientific article; zbMATH DE number 3866574 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 549969 (Why is no real title available?)
- scientific article; zbMATH DE number 1442964 (Why is no real title available?)
- Integrity constraint checking in stratified databases
- Logic for improving integrity checking in relational data bases
- Making prolog more expressive
- Paraconsistent logic programming
- Programming in three-valued logic
This page was built for publication: Legality concepts for three-valued logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689286)