Marco Cadoli, Francesco M. Donini, Paolo Liberatore, and Marco Schaerf. Preprocessing of intractable problems. Information and Computation, 176(2):89--120, 2000.  Home/Search   Document Details and Download   Summary   Related Articles

....or typical compilability. The main contribution of this paper is a theoretical framework providing a language and tools for comparing and classifying the compilability of formalisms on average. Our framework is built on notions and insights from the theory of compilability clases due to Cadoli et al. 2000a; 2000b] and the theory of average case time complexity due to Levin [1986] 1.1 Background Compilability. Informally, a formalism A is compilable to a formalism B if for every knowledge base x in formalism A, there is a knowledge base in formalism B representing the same information as x with ....

....initial papers that demonstrated non compilability results [Kautz et al. 1995; Gogic et al. 1995; Khardon and Roth, 1996; Cadoli et al. 1996; 1997; 1999] were based on ad hoc proofs, each of which isolated two particular formalisms and then demonstrated noncompilability of one to the other. In [Cadoli et al. 2000a; 2000b] new complexity classes measuring compilability, called compilability classes, were introduced; for every classical complexity class C, it is possible to define a compilability class analog of C. The theory of compilability classes made it possible to systematize proofs of ....

[Article contains additional citation context not shown here]

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, and Marco Schaerf. Preprocessing of intractable problems. Information and Computation, 176(2):89--120, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC