Feasibility and Unfeasibility of Off-Line Processing

We formally investigate the idea of processing offline part of the input data in order to speed up on-line computing. In particular, we focus on off-line processing for intractable decision problems. To this end, we define new complexity classes and reductions, and find complete problems.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[4]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[6]  Hector J. Levesque,et al.  Making Believers out of Computers , 1986, Artif. Intell..

[7]  Michael R. Fellows,et al.  On the complexity of fixed parameter problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[9]  Bart Selman,et al.  Knowledge Compilation using Horn Approximations , 1991, AAAI.

[10]  Bart Selman,et al.  Forming Concepts for Fast Inference , 1992, AAAI.

[11]  Moshe Tennenholtz,et al.  Off-line Reasoning for On-line Efficiency , 1993, IJCAI.

[12]  G. Gottlob,et al.  Propositional circumscription and extended closed-world reasoning are ΠP2-complete , 1993 .

[13]  Francesco M. Donini,et al.  Is Intractability of Non-Monotonic Reasoning a Real Drawback? , 1994, AAAI.

[14]  Bart Selman,et al.  The Comparative Linguistics of Knowledge Representation , 1995, IJCAI.

[15]  Francesco M. Donini,et al.  The size of a revised knowledge base , 1995, PODS '95.

[16]  Bart Selman,et al.  Knowledge compilation and theory approximation , 1996, JACM.

[17]  Francesco M. Donini,et al.  On Compact Representations of Propositional Circumscription , 1995, STACS.