The complexity of predicate default logic over a countable domain
type: Item
instance of: scholarly article
title: The complexity of predicate default logic over a countable domain
zbMATH Open document ID: 1016.03023
DOI: 10.1016/S0168-0072(02)00064-7
author: Robert Saxon Milnikel
published in: Annals of Pure and Applied Logic
publication date: 2003-03-16T00:00:00Z
Mathematics Subject Classification ID: 03B60
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1882254
zbMATH Keywords: default logic
zbMATH Keywords: circumscription
zbMATH Keywords: computability theoretic complexity
MaRDI profile type: Publication
cites work: Q3773876
cites work: A comparative study of open default theories
cites work: Extensions for open default theories via the domain closure assumption
cites work: Closed-world databases and circumscription
cites work: Q5750390
cites work: Q3486550
cites work: A logic of knowledge and justified assumption
cites work: A theory of nonmonotonic rule systems I
cites work: A theory of nonmonotonic rule systems. II
cites work: Q4273952
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Non-monotonic logic. I
cites work: A logic for default reasoning
cites work: Q5573961
cites work: Decidability and definability with circumscription
description: scientific article; zbMATH DE number 1882254