Journal of Computer and System Sciences

Paper

01 Jan 1994

Datalog vs first-order logic

View publication

Abstract

Our main result is that every datalog query expressible in first-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for finite structures. In addition, we give some counter-examples delimiting the main result. © 1994 by Academic Press, Inc.

Related

Conference paper

Growth and transport properties of multilayer superconducting films of Nd_1.83Ce_0.17CuO_x / YBa₂Cu₃O_7-δ

A. Gupta, R. Gross, et al.

SPIE Advances in Semiconductors and Superconductors 1990

Paper

A remark on an algorithm for best L^p approximation

Charles Micchelli

Journal of Approximation Theory

Conference paper

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Frank R. Libsch, Takatoshi Tsujimura

Active Matrix Liquid Crystal Displays Technology and Applications 1997

Conference paper

Self-assembling materials for lithographic patterning: Overview, status and moving forward

William Hinsberg, Joy Cheng, et al.

SPIE Advanced Lithography 2010

View all publications