Preprocessing of intractable problems
type: Item
instance of: scholarly article
title: Preprocessing of intractable problems
zbMATH Open document ID: 1012.68082
author: Marco Cadoli
author: F. M. Donini
author: Paolo Liberatore
author: Marco Schaerf
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 1853273
MaRDI profile type: Publication
full work available at URL: inco.2001.3043
OpenAlex ID: W2085393535
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Default reasoning using classical logic
cites work: Q4385519
cites work: Q3200589
cites work: Q4386924
cites work: The complexity of model checking for circumscriptive formulae
cites work: The size of a revised knowledge base
cites work: Is intractability of nonmonotonic reasoning a real drawback?
cites work: On compact representations of propositional circumscription
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4393480
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: Q4198056
cites work: An algorithm to compute circumscription
cites work: Q4385525
cites work: Reducing belief revision to circumscription (and vice versa)
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3939270
cites work: Off-line reasoning for on-line efficiency: knowledge bases
cites work: Computing circumscriptive databases
cites work: A theory of diagnosis from first principles
cites work: Implicates and prime implicates in random 3-SAT
cites work: Knowledge compilation and theory approximation
cites work: The polynomial-time hierarchy
cites work: Amortized Computational Complexity
cites work: Some consequences of non-uniform conditions on uniform classes
DOI: 10.1006/INCO.2001.3043
description: scientific article; zbMATH DE number 1853273