An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic-Reference-Cited by-同舟云学术

An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic

Author:

Sagiv Yehoshua¹,Delobel Claude²,Parker D. Scott³,Fagin Ronald⁴

Affiliation:

1. Department of Computer Science, 222 Digital Computer Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois

2. Computer Laboratory, University of Grenoble, Boite Postale 53, 38041 Grenoble Cedex, Grenoble, France

3. Computer Science Department, School of Engineering and Applied Science, University of California at Los Angeles, Los Angeles, California

4. IBM Research Laboratory, K52/282, 5600 Cottle Road, San Jose, California

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference24 articles.

Cited by 105 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hypergraph Horn Functions;SIAM Journal on Discrete Mathematics;2024-05-02

3. The Programming of Algebra;Electronic Proceedings in Theoretical Computer Science;2022-06-30