Academic Journal
Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)
| Title: | Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk) |
|---|---|
| Authors: | Vardi, Moshe Y. |
| Contributors: | Moshe Y. Vardi |
| Publisher Information: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| Publication Year: | 2024 |
| Collection: | DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) |
| Subject Terms: | Logic, Algorithms |
| Description: | 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. |
| Document Type: | article in journal/newspaper conference object |
| File Description: | application/pdf |
| Language: | English |
| Relation: | Is Part Of LIPIcs, Volume 305, 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.3 |
| DOI: | 10.4230/LIPIcs.SAT.2024.3 |
| Availability: | https://doi.org/10.4230/LIPIcs.SAT.2024.3 https://nbn-resolving.org/urn:nbn:de:0030-drops-205253 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.3 |
| Rights: | https://creativecommons.org/licenses/by/4.0/legalcode |
| Accession Number: | edsbas.5D35E29A |
| Database: | BASE |
| DOI: | 10.4230/LIPIcs.SAT.2024.3 |
|---|