Negation as failure: careful closure procedure
type: Item
instance of: scholarly article
title: Negation as failure: careful closure procedure
zbMATH Open document ID: 0635.68119
DOI: 10.1016/0004-3702(86)90001-9
author: Michael Gelfond
author: Halina Przymusinska
published in: Artificial Intelligence
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 4035218
zbMATH Keywords: closed world assumption
zbMATH Keywords: negation as failure
zbMATH Keywords: closure procedure
zbMATH Keywords: inference engine
zbMATH Keywords: Horn databases
zbMATH Keywords: query evaluation
MaRDI profile type: Publication
full work available at URL: 0004-3702(86)90001-9
OpenAlex ID: W101701348
cites work: Saturation, nonmonotonic reasoning and the closed-world assumption
cites work: On the satisfiability of circumscription
cites work: Q3339245
cites work: Q4139711
cites work: Q3939270
cites work: Q5560259
cites work: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
description: scientific article; zbMATH DE number 4035218