Document Open Access Logo

Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)

Author Moshe Y. Vardi

PDF
Thumbnail PDF

File

LIPIcs.SAT.2024.3.pdf
  • Filesize: 375 kB
  • 1 pages

Document Identifiers

Author Details

Moshe Y. Vardi
  • Rice University, Houston, TX, USA

Funding

Work supported in part by NSF grants IIS-1527668, CCF-1704883, IIS-1830549, CNS-2016656, DoD MURI grant N00014-20-1-2787, and an award from the Maryland Procurement Office.

Cite As Get 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

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)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. 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. Google Scholar
  2. P.G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., 61(2):302-332, 2000. Google Scholar
  3. G. Pan and M.Y. Vardi. Symbolic techniques in satisfiability solving. J. Autom. Reason., 35(1-3):25-50, 2005. Google Scholar
  4. 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.
  5. M.Y. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symposium on Theory of Computing, pages 137-146. ACM, 1982. Google Scholar
  6. M.Y. Vardi. On the complexity of bounded-variable queries. In Proc. 14th ACM Symp. on Principles of Database Systems, pages 266-76, 1995. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact