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

Compression scheme for digital cinema application

Ligang Lu, Jack L. Kouloheris

IS&T/SPIE Electronic Imaging 2002

Paper

Output distribution of the burrows-wheeler transform

Karthik Visweswariah, Sanjeev Kulkarni, et al.

IEEE International Symposium on Information Theory - Proceedings

Conference paper

Strategies for registering range images from unknown camera positions

Fausto Bernardini, Holly Rushmeier

Proceedings of SPIE - The International Society for Optical Engineering

Paper

Stabilizer-based symmetry breaking constraints for mathematical programs

Leo Liberti, James Ostrowski

Journal of Global Optimization

View all publications