Chomicki, J., Subrahmanian, V.S., "Generalized Closed World Assumption Is \Pi 2 0 - Complete," IPL (34), 1990, pp. 289-291.  Home/Search   Document Not in Database   Summary   Related Articles

....of clauses in a database is ground and contains no negative clauses. For a discussion on intractable problems, interested readers please refer to [6] Under the assumptions that function symbols are allowed and databases are stratifiable, the same problem has been shown to be Pi 0 2 complete [3]. 7 Theorem 3.5 Let DB be consistent and contains only positive and mixed ground clasues. Let A be a ground atom. Determining if :A is inferred under GCWA is co NP hard. Proof ] By Theorem 3.4, A is derivable iff A is not in any minimal model of DB. We will prove that determining if A is in ....

Chomicki, J., Subrahmanian, V.S., "Generalized Closed World Assumption Is \Pi 2 0 - Complete," IPL (34), 1990, pp. 289-291.

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