The semantics of incomplete databases as an expression of preferences
type: Item
instance of: scholarly article
title: The semantics of incomplete databases as an expression of preferences
zbMATH Open document ID: 0716.68029
DOI: 10.1016/0304-3975(51)90005-9
author: Véronique Royer
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 4180784
zbMATH Keywords: declarative semantics
zbMATH Keywords: incomplete information
zbMATH Keywords: deductive databases
zbMATH Keywords: operational semantics
MaRDI profile type: Publication
full work available at URL: 0304-3975(51)90005-9
OpenAlex ID: W2052188443
cites work: Saturation, nonmonotonic reasoning and the closed-world assumption
cites work: Q3829533
cites work: Q5679729
cites work: An efficient strategy for non-Horn deductive databases
cites work: On the relationship between circumscription and negation as failure
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: Closed-world databases and circumscription
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3829532
cites work: Q3939270
cites work: A fixpoint semantics for disjunctive logic programs
cites work: Q3820058
cites work: Q3348437
cites work: On the declarative and procedural semantics of logic programs
cites work: An algorithm to compute circumscription
cites work: A logic for default reasoning
cites work: The Alexander Method - a technique for the processing of recursive axioms in deductive databases
cites work: Q3969890
description: scientific article; zbMATH DE number 4180784