Academic Journal
Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)
| Τίτλος: | Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk) |
|---|---|
| Συγγραφείς: | Vardi, Moshe Y. |
| Συνεισφορές: | Moshe Y. Vardi |
| Στοιχεία εκδότη: | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| Έτος έκδοσης: | 2024 |
| Συλλογή: | DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) |
| Θεματικοί όροι: | Logic, Algorithms |
| Περιγραφή: | 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. |
| Τύπος εγγράφου: | article in journal/newspaper conference object |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | 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 |
| Διαθεσιμότητα: | 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 |
| Αριθμός Καταχώρησης: | edsbas.5D35E29A |
| Βάση Δεδομένων: | BASE |
| DOI: | 10.4230/LIPIcs.SAT.2024.3 |
|---|