John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Paper
Datalog vs first-order logic
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
Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Simeon Furrer, Dirk Dahlhaus
ISIT 2005