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

Wavefront and caustic surfaces of refractive laser beam shaper

David L. Shealy, John A. Hoffnagle

SPIE Optical Engineering + Applications 2007

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

Placement of multimedia blocks on zoned disks

Renu Tewari, Richard P. King, et al.

IS&T/SPIE Electronic Imaging 1996

Paper

Adaptive solution strategy for solving large systems of p‐type finite element equations

R.B. Morris, Y. Tsuji, et al.

International Journal for Numerical Methods in Engineering

View all publications