Closed world assumptions having precedence in predicates
type: Item
instance of: scholarly article
title: Closed world assumptions having precedence in predicates
zbMATH Open document ID: 0711.68093
DOI: 10.1007/BF03037516
author: Hirofumi Katsuno
published in: New Generation Computing
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 4170135
zbMATH Keywords: deductive database
zbMATH Keywords: Horn clause
zbMATH Keywords: closed world assumption
zbMATH Keywords: stratified programs
MaRDI profile type: Publication
cites work: Saturation, nonmonotonic reasoning and the closed-world assumption
cites work: Horn clauses and database dependencies
cites work: Q3220545
cites work: Q3340205
cites work: Negation as failure: careful closure procedure
cites work: On the relationship between circumscription and negation as failure
cites work: Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
cites work: Closed-world databases and circumscription
cites work: Q3992908
cites work: Q3962956
cites work: Q3939270
cites work: Equality and Domain Closure in First-Order Databases
cites work: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
cites work: Deduction in non-Horn databases
description: scientific article; zbMATH DE number 4170135