Is intractability of nonmonotonic reasoning a real drawback?
type: Item
instance of: scholarly article
title: Is intractability of nonmonotonic reasoning a real drawback?
zbMATH Open document ID: 0907.68182
DOI: 10.1016/S0004-3702(96)00009-4
author: Marco Cadoli
author: F. M. Donini
author: Marco Schaerf
published in: Artificial Intelligence
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 1178622
zbMATH Keywords: knowledge representation
zbMATH Keywords: nonmonotonic reasoning
zbMATH Keywords: computational complexity
zbMATH Keywords: compact representations
Wikidata QID: Q58006985
MaRDI profile type: Publication
cites work: Q3493324
cites work: Semantical and computational aspects of Horn approximations
cites work: The size of a revised knowledge base
cites work: On compact representations of propositional circumscription
cites work: The complexity of propositional closed world reasoning and circumscription
cites work: A survey of complexity results for non-monotonic logics
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4198056
cites work: Negation as failure: careful closure procedure
cites work: On the relationship between circumscription and negation as failure
cites work: Complexity Results for Nonmonotonic Logics
cites work: Incomplete deductive databases
cites work: Q4385525
cites work: Hard problems for simple default logics
cites work: Reasoning with models
cites work: Foundations of a functional approach to knowledge representation
cites work: Closed-world databases and circumscription
cites work: Q3939270
cites work: Off-line reasoning for on-line efficiency: knowledge bases
cites work: Computing circumscriptive databases
cites work: Q4298260
cites work: Weak generalized closed world assumption
cites work: A logic for default reasoning
cites work: Decidability and definability with circumscription
cites work: Q3742689
cites work: The well-founded semantics for general logic programs
cites work: The decision problem for database dependencies
cites work: Deduction in non-Horn databases
cites work: Some consequences of non-uniform conditions on uniform classes
full work available at URL: s0004-3702(96)00009-4
OpenAlex ID: W2017956822
description: scientific article; zbMATH DE number 1178622