Thumbnail
Access Restriction
Subscribed

Author Gottlob, Georg
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword NP ♦ Autoepistemic logic ♦ Bounded query computation ♦ Epistemic logic ♦ Modal logic ♦ Oracle ♦ Trees
Abstract In this paper we consider problems and complexity classes definable by interdependent queries to an oracle in NP. How the queries depend on each other is specified by a directed graph G. We first study the class of problems where G is a general dag and show that this class coincides with $D^{p}2$ . We show that such graphs are easily expressible in autoepistemic logic. Finally, we generalize our complexity results to higher classes of the polynomial-time hierarchy.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 2
Page Count 37
Starting Page 421
Ending Page 457


Open content in new tab

   Open content in new tab
Source: ACM Digital Library