Academic Journal
Προβολή σε EDS

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
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://doi.org/10.4230/LIPIcs.SAT.2024.3#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.5D35E29A
RelevancyScore: 960
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 959.983581542969
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Vardi%2C+Moshe+Y%2E%22">Vardi, Moshe Y.</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Moshe Y. Vardi
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2024
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics )
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Logic%22">Logic</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper<br />conference object
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: 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
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.4230/LIPIcs.SAT.2024.3
– Name: URL
  Label: Availability
  Group: URL
  Data: https://doi.org/10.4230/LIPIcs.SAT.2024.3<br />https://nbn-resolving.org/urn:nbn:de:0030-drops-205253<br />https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.3
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: https://creativecommons.org/licenses/by/4.0/legalcode
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.5D35E29A
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.5D35E29A
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.4230/LIPIcs.SAT.2024.3
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Logic
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Vardi, Moshe Y.
      – PersonEntity:
          Name:
            NameFull: Moshe Y. Vardi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1