A theory of average-case compilability in knowledge representation

Authors:
Hubie Chen
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 16
Cited 0

Average case complete problems

SIAM Journal on Computing
The NP-completeness column: An ongoing guide

Journal of Algorithms
Structural complexity 1

Structural complexity 1
Average case completeness

Journal of Computer and System Sciences
Horn approximations of empirical data

Artificial Intelligence
Reasoning with models

Artificial Intelligence
Is intractability of nonmonotonic reasoning a real drawback?

Artificial Intelligence
On compact representations of propositional circumscription

Theoretical Computer Science
Average-case computational complexity theory

Complexity theory retrospective II
The size of a revised knowledge base

Artificial Intelligence
Average Case Complexity

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Preprocessing of intractable problems

Information and Computation
The complexity of knowledge representation

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
A personal view of average-case complexity

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Space efficiency of propositional knowledge representation formalisms

Journal of Artificial Intelligence Research
The comparative linguistics of knowledge representation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is closely tied to how accurately data values are predicted at runtime. Caching ...