An efficient method for eliminating varying predicates from a circumscription
type: Item
instance of: scholarly article
title: An efficient method for eliminating varying predicates from a circumscription
zbMATH Open document ID: 0762.03013
DOI: 10.1016/0004-3702(92)90051-X
author: Marco Cadoli
author: Thomas Eiter
author: Georg Gottlob
published in: Artificial Intelligence
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 03B80
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 64742
zbMATH Keywords: formalization of common-sense reasoning
Wikidata QID: Q59259770
MaRDI profile type: Publication
cites work: Saturation, nonmonotonic reasoning and the closed-world assumption
cites work: Eliminating the fixed predicates from a circumscription
cites work: Q4692605
cites work: Negation as failure: careful closure procedure
cites work: On the relationship between circumscription and negation as failure
cites work: A circumscriptive theorem prover
cites work: Q3227562
cites work: Closed-world databases and circumscription
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3939270
cites work: An algorithm to compute circumscription
cites work: Decidability and definability with circumscription
cites work: Q4342090
cites work: Deduction in non-Horn databases
description: scientific article; zbMATH DE number 64742