LIPIcs.SAT.2024.3.pdf
- Filesize: 375 kB
- 1 pages
Document
Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)
Author
Moshe Y. Vardi 
-
Part of:
Volume:
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Theory and Applications of Satisfiability Testing (SAT) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-08-19
File
Document Identifiers
Author Details
Cite AsGet BibTex
Moshe Y. Vardi. Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk). In 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 305, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SAT.2024.3
https://doi.org/10.4230/LIPIcs.SAT.2024.3
Abstract
The standard approach to algorithm development is to focus on a specific problem and develop for it a specific algorithm. Codd’s introduction of the relational model in 1970 included two fundamental ideas: (1) relations provide a universal data representation formalism, and (2) relational databases can be queried using first-order logic. Realizing these ideas required the development of a meta-algorithm, which takes a declarative query and executes it with respect to a database. In this talk, I will describe this approach, which I call Logical Algorithmics, in detail, and trace a decades-long path from the comoutational complexity theory of relational queries to recent tools for Boolean reasoning.
Subject Classification
ACM Subject Classification
- Theory of computation → Computational complexity and cryptography
- Theory of computation → Design and analysis of algorithms
Keywords
- Logic
- Algorithms
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
J.M. Dudek, Vu Phan, and M.Y. Vardi. ADDMC: weighted model counting with algebraic decision diagrams. In The 34th AAAI Conference on Artificial Intelligence, pages 1468-1476. AAAI Press, 2020.
-
P.G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., 61(2):302-332, 2000.
-
G. Pan and M.Y. Vardi. Symbolic techniques in satisfiability solving. J. Autom. Reason., 35(1-3):25-50, 2005.
- V.H.N. Phan and M.Y. Vardi. DPO: dynamic-programming optimization on hybrid constraints. CoRR, abs/2205.08632, 2022. URL: https://arxiv.org/abs/2205.08632.
-
M.Y. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symposium on Theory of Computing, pages 137-146. ACM, 1982.
-
M.Y. Vardi. On the complexity of bounded-variable queries. In Proc. 14th ACM Symp. on Principles of Database Systems, pages 266-76, 1995.