Preprocessing of intractable problems

Information and Computation

Volumn 176, Issue 2, 2002, Pages 89-120

  Cadoli, Marco ^a   Donini, Francesco M ^a,b   Liberatore, Paolo ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b POLITECNICO DI BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; KNOWLEDGE BASED SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

COMPILATION; POLYNOMIAL-TIME ON-LINE ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0036707242     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3043     Document Type: Article

References (40)

1. Abrahamson, K. A., Downey, R. G., and Fellows, M. F. (1995), Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues, Annals of Pure and Applied Logics 73, 235-276.
2. Abrahamson, K. R., Ellis, J. A., Fellows, M. R., and Mata, M. E. (1989), On the complexity of fixed parameter problems, in "Proceedings of the Thirtieth Annual Symposium on the Foundations of Computer Science (FOCS'89)," pp. 210-215.
3. Ben-Eliyahu, R., and Dechter, R. (1996), Default reasoning using classical logic, Artificial Intelligence 84, 113-150.
4. Boppana, R., and Sipser, M. (1990), The complexity of finite functions, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. A, Chap. 14, pp. 757-804, Elsevier Science Publishers (North-Holland), Amsterdam.
5. Borgida, A., Brachman, R. J., Etherington, D. W., and Kautz, H. A. (1989), Vivid knowledge and tractable reasoning: Preliminary report, in "Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI'89)," pp. 1146-1152.
6. Buchheit, M., Donini, F. M., and Schaerf, A. (1993), Decidable reasoning in terminological knowledge representation systems, J. Artificial Intelligence Res. 1, 109-138.
7. Cadoli, M. (1992). The complexity of model checking for circumscriptive formulae, Inf. Process. Lett. 44, 113-118.
8. Cadoli, M., Donini, F., Liberatore, P., and Schaerf, M. (1996), Comparing space efficiency of propositional knowledge representation formalisms, in "Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR'96)," pp. 364-373.
9. Cadoli, M., and Donini, F. M. (1997), A survey on knowledge compilation, AI Communications-The European Journal on Artificial Intelligence 10, 137-150.
10. Cadoli, M., Donini, F. M., Liberatore, P., and Schaerf, M. (1996), Feasibility and unfeasibility of off-line processing, in "Proceedings of the Fourth Israeli Symposium on Theory of Computing and Systems (ISTCS'96)," pp. 100-109, IEEE Computer Society Press, available at ftp://ftp.dis.uniroma1.it/PUB/AI/papers/cado-etal-96.ps.gz.
11. Cadoli, M., Donini, F. M., Liberatore, P., and Schaerf, M. (1997), "Preprocessing of Intractable Problems," Technical Report DIS 24-97, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza," available at http://ftp.dis.uniroma1.it/PUB/AI/papers/cado-etal-97-d- REVISED.ps.gz.
12. Cadoli, M., Donini, F.M., Liberatore, P., and Schaerf, M. (1999), The size of a revised knowledge base, Artificial Intelligence 115, 25-64.
13. Cadoli, M., Donini, F. M., and Schaerf, M. (1996). Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence 88, 215-251.
14. Cadoli, M., Donini, F. M., Schaerf, M., and Silvestri, R. (1997), On compact representations of propositional circumscription, Theor. Comput. Sci. 182, 183-202.
15. Downey, R. G., and Fellows, M. F. (1995), Fixed-parameter tractability and completeness I: Basic results, SIAM J. Comput. 24, 873-921.
16. Downey, R. G., and Fellows, M. F. (1995), Fixed-parameter tractability and completeness II: On completeness for W[1]. Theor. Comput. Sci. 141, 109-131.
17. Downey, R. G., and Fellows, M. F. (1999), "Parameterized Complexity," Springer-Verlag, Berlin.
18. ρ-complete, Theor. Comput. Sci. 114, 231-245.
19. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," W. H. Freeman and Company, San Francisco, CA.
20. Gelfond, M., Przymusinska, H., and Przymusinsky, T. (1989), On the relationship between circumscription and negation as failure, Artificial Intelligence 38, 49-73.
21. Gogic, G., Kautz, H. A., Papadimitriou, C., and Selman, B. (1995), The comparative linguistics of knowledge representation, in "Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95)," pp. 862-869.
22. Gottlob, G. (1996), Complexity and expressive power of KR formalisms, in "Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR'96)," pp. 647-649.
23. Johnson, D. S. (1990), A catalog of complexity classes, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. A, Chap. 2, pp. 67-161, Elsevier Science Publishers (North-Holland), Amsterdam.
24. Karp, R. M., and Lipton, R. J. (1980), Some connections between non-uniform and uniform complexity classes, in "Proceedings of the Twelfth ACM Symposium on Theory of Computing (STOC'80)," pp. 302-309.
25. Kautz, H. A., and Selman, B. (1992), Forming concepts for fast inference, in "Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92)," pp. 786-793.
26. Levesque, H. J. (1986), Making believers out of computers, Artificial Intelligence 30, 81-108.
27. Liberatore, P. (1995), Compact representation of revision of Horn clauses, in "Proceedings of the Eighth Australian Joint Artificial Intelligence Conference (AI'95)" (Xin Yao, Ed.), pp. 347-354, World Scientific, River Edge, NJ.
28. Liberatore, P. (1998), "Compilation of Intractable Problems and its Application to Artificial Intelligence," Ph.D. thesis, Dipartimento di Informatica e Sistemistica, Universitá di Roma "La Sapienza," available at ftp://ftp.dis.uniroma1.it/pub/AI/papers/libe-98-c.ps.gz.
29. Liberatore, P., and Schaerf, M. (1997), Reducing belief revision to circumscription (and vice versa), Artificial Intelligence 93, 261-296.
30. McCarthy, J. (1980), Circumscription-A form of non-monotonic reasoning, Artificial Intelligence 13, 27-39.
31. Minker, J. (1982), On indefinite databases and the closed world assumption, in "Proceedings of the Sixth International Conference on Automated Deduction (CADE'82)," pp. 292-308.
32. Moses, Y., and Tennenholtz, M. (1996), Off-line reasoning for on-line efficiency: Knowledge bases, Artificial Intelligence 83, 229-239.
33. Nerode, A., Ng, R. T., and Subrahmanian, V. S. (1995), Computing circumscriptive databases. I: Theory and algorithms, Information and Computation 116, 58-80.
34. Reiter, R. (1987), A theory of diagnosis from first principles, Artificial Intelligence 32, 57-95.
35. Schrag, R., and Crawford, J. (1996), Implicates and prime implicates in random 3SAT, Artificial Intelligence 81, 199-222.
36. Selman, B., and Kautz, H. A. (1991), Knowledge compilation using Horn approximations, in "Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI'91)," pp. 904-909.
37. Selman, B., and Kautz, H. A. (1996), Knowledge compilation and theory approximation. J. ACM 43, 193-224.
38. Stockmeyer, L. J. (1976), The polynomial-time hierarchy, Theor. Comput. Sci. 3, 1-22.
39. Tarjan, R. E. (1985), Amortized computational complexity, SIAM J. Algebraic Discrete Meth. 6, 306-318.
40. Yap, C. K. (1983), Some consequences of non-uniform conditions on uniform classes, Theoret. Comput. Sci. 26, 287-300.