About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Computer and System Sciences
Paper
On the expressive power of datalog: Tools and a case study
Abstract
We study here the language Datalog (≠), which is the query language obtained from Datalog by allowing equalities and inequalities in the bodies of the rules. We view Datalog (≠) as a fragment of an infinitary logic Lw and show that Lw can be characterized in terms of certain two-person pebble games. This characterization provides us with tools for investigating the expressive power of Datalog (≠). As a case study, we classify the expressibility of fixed subgraph homeomorphism queries on directed graphs. S. Fortune, J. Hopcroft, and J. Wyllie (Theoret. Comput. Sci. 10 (1980), 111-121) classified the computational complexity of these queries by establishing two dichotomies, which are proper only if P ≠ NP. Without using any complexity-theoretic assumptions, we show here that the two dichotomies are indeed proper in terms of expressibility in Datalog (≠). © 1995 by Academic Press, Inc.