On the complexity of extension checking in default logic
type: Item
instance of: scholarly article
title: On the complexity of extension checking in default logic
zbMATH Open document ID: 1187.68584
author: Paolo Liberatore
published in: Information Processing Letters
publication date: 2010-01-18T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5659903
zbMATH Keywords: default logic
zbMATH Keywords: knowledge representation
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.12.005
OpenAlex ID: W2042523249
cites work: Operational concepts of nonmonotonic logics. I: Default logic
cites work: Propositional default logics made easier: computational complexity of model checking.
cites work: Alternative approaches to default logic
cites work: Q4244306
cites work: Q4273952
cites work: A logic for default reasoning
DOI: 10.1016/J.IPL.2005.12.005
Recommended article: Q4796540
Recommended article: Q4282499
Recommended article: A correct logic programming computation of default logic extensions
Recommended article: Propositional default logics made easier: computational complexity of model checking.
Recommended article: On extensibility of proof checkers
Recommended article: Q4025925
Recommended article: The complexity of reasoning for fragments of default logic
Recommended article: The Complexity of Reasoning for Fragments of Default Logic
Recommended article: Proof Complexity of Propositional Default Logic
Recommended article: Proof complexity of propositional default logic
description: scientific article; zbMATH DE number 5659903