Closed-world databases and circumscription
type: Item
instance of: scholarly article
title: Closed-world databases and circumscription
zbMATH Open document ID: 0596.68062
DOI: 10.1016/0004-3702(85)90055-4
author: Vladimir Lifschitz
published in: Artificial Intelligence
publication date: 1985-01-01T00:00:00Z
review text: There is a similarity between the closed-world assumption and circumscribing predicate symbols in the sense of predicate ''minimization''. The purpose of the paper is to investigate under what conditions the closed-world assumption and the result of circumscribing all predicates are equivalent. Closed-world assumption is shown to be equivalent to a special case of circumscription. Reasons are given why circumscription is a substantially more powerful form of non-monotonic reasoning.
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 3961014
zbMATH Keywords: closed-world assumption
zbMATH Keywords: circumscription
zbMATH Keywords: non-monotonic reasoning
Wikidata QID: Q29035663
MaRDI profile type: Publication
full work available at URL: 0004-3702(85)90055-4
OpenAlex ID: W2000141049
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Circumscription and implicit definability
cites work: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
cites work: Equality and Domain Closure in First-Order Databases
cites work: Q5633670
DBLP publication ID: journals/ai/Lifschitz85
description: scientific article; zbMATH DE number 3961014