The relationship between stable, supported, default and autoepistemic semantics for general logic programs
type: Item
instance of: scholarly article
title: The relationship between stable, supported, default and autoepistemic semantics for general logic programs
zbMATH Open document ID: 0753.68062
DOI: 10.1016/0304-3975(92)90019-C
author: V. S. Subrahmanian
author: Wiktor Marek
published in: Theoretical Computer Science
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 94465
zbMATH Keywords: negative information
zbMATH Keywords: circumscription
zbMATH Keywords: default logics
zbMATH Keywords: autoepistemic logics
zbMATH Keywords: completion
MaRDI profile type: Publication
cites work: Results on translating defaults to circumscription
cites work: On the relation between default and autoepistemic logic
cites work: Closed-world databases and circumscription
cites work: Q3339245
cites work: Q3826524
cites work: Autoepistemic logic
cites work: Q3486549
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3348437
cites work: A logic for default reasoning
cites work: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
cites work: Q3348436
description: scientific article; zbMATH DE number 94465