A sound and complete semantics for a version of negation as failure
type: Item
instance of: scholarly article
title: A sound and complete semantics for a version of negation as failure
zbMATH Open document ID: 0682.68095
DOI: 10.1016/0304-3975(89)90106-0
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 03B60
zbMATH DE Number: 4117897
zbMATH Keywords: SLDNFS-resolution
zbMATH Keywords: default operator
zbMATH Keywords: least Herbrand
zbMATH Keywords: fixpoint
zbMATH Keywords: weaker consequence relations
zbMATH Keywords: Negation as failure
zbMATH Keywords: closed world assumption
zbMATH Keywords: completed database
zbMATH Keywords: semantics
zbMATH Keywords: soundness
zbMATH Keywords: completeness
zbMATH Keywords: valued logic
zbMATH Keywords: intuitionistic logic
author: John Shepherdson
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90106-0
OpenAlex ID: W1987764156
cites work: Q3032240
cites work: A completeness theorem for SLDNF resolution
cites work: Über Eine Prädikatenlogik mit Partiell Definierten Prädikaten und Funktionen
cites work: A kripke-kleene semantics for logic programs*
cites work: Negation in logic programming
cites work: Q3339245
cites work: Partial evaluation in logic programming
cites work: Q3677149
cites work: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
cites work: Negation as failure. II
cites work: Q5750391
description: scientific article; zbMATH DE number 4117897