M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf. Feasibility and unfeasibility of o-line processing. In Proc. of ISTCS'96, pages 100-109. IEEE Computer Society Press, 1996.  Home/Search   Document Not in Database   Summary   Related Articles

....Among other results, they showed that skeptical default logic represents sets of models more succinctly than circumscription. Unfortunately, all the above results are based on ad hoc proofs and do not help us to de ne equivalence classes for the space eciency of KR formalisms. In a recent paper [CDLS96], we have introduced a new complexity measure for decision problems, called compilability. In the present paper we show how this new measure can be directly used to characterize the space eciency of PKR formalisms. Goal. In KR the notion of polynomial time solvability models the concept of ....

....we brie y recall some notions on non uniform computation that are important for what follows. In Section 3 we give basic de nitions and assumptions about PKR formalisms, and we propose two general de nitions about translations between formalisms. In Section 4 we recall compilability classes from [CDLS96]. In Section 5 we show how compilability classes can be used to compare the space eciency of PKR formalisms. 2 Non uniform Computation We assume the reader is familiar with basic complexity classes, such as P, NP and (uniform) classes of the polynomial hierarchy (see, for example, GJ79] Here ....

[Article contains additional citation context not shown here]

M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf. Feasibility and unfeasibility of o-line processing. In Proc. of ISTCS'96, pages 100-109. IEEE Computer Society Press, 1996.

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