Legality concepts for three-valued logic programs
type: Item
instance of: scholarly article
title: Legality concepts for three-valued logic programs
zbMATH Open document ID: 0788.68136
DOI: 10.1016/0304-3975(93)90244-N
author: G. Nota
author: S. Orefice
author: F. Ruggiero
author: G. Tortora
author: Giuliano Pacini
published in: Theoretical Computer Science
publication date: 1993-12-20T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B50
zbMATH DE Number: 445056
zbMATH Keywords: logic programming
zbMATH Keywords: three-valued logic
zbMATH Keywords: resolution
reviewed by: Siegfried J. Gottwald
MaRDI profile type: Publication
cites work: Q4951952
cites work: Paraconsistent logic programming
cites work: Programming in three-valued logic
cites work: A kripke-kleene semantics for logic programs*
cites work: Q4287488
cites work: Making prolog more expressive
cites work: A basis for deductive database systems
cites work: Integrity constraint checking in stratified databases
cites work: Q3339245
cites work: A polymorphic type system for Prolog
cites work: Q3334069
cites work: Logic for improving integrity checking in relational data bases
cites work: Eine dreiwertige Logik zur Verarbeitung partieller Information. (A three- valued logic for partial information processing)
cites work: A RING-THEORETIC BASIS FOR LOGIC PROGRAMMING
Wikidata QID: Q126527283
description: scientific article; zbMATH DE number 445056