8 citations · 19 across the 13 of their papers we have counts for
18 papers
Beyond Memorization: Distinguishing Between Pattern-Based and Epistemic Reasoning in LLMs Using Epistemic Puzzles
Adi Gabay, Gabriel Stanovsky, Liat Peterfreund
Epistemic reasoning requires agents to infer the state of the world from partial observations and information about other agents' knowledge. Prior work evaluating LLMs on epistemic…
Database Theory in Action: From Inexpressibility to Efficiency in GQL's Order-Constrained Paths
Hadar Rotschield, Liat Peterfreund
Pattern matching of core GQL, the new ISO standard for querying property graphs, cannot check whether edge values are increasing along a path, as established in recent work. We pre…
On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
Hadar Rotschield, Liat Peterfreund
SQL/PGQ is the emerging ISO standard for querying property graphs defined as views over relational data. We formalize its expressive power across three fragments: the read-only cor…
Towards Cross-Model Efficiency in SQL/PGQ
Hadar Rotschield, Liat Peterfreund
SQL/PGQ is a new standard that integrates graph querying into relational systems, allowing users to freely switch between graph patterns and SQL. Our experiments show performance g…
Rel: A Programming Language for Relational Data
Molham Aref, Paolo Guagliardo, George Kastrinis +12
From the moment of their inception, languages for relational data have been described as sublanguages embedded in a host programming language. Rel is a new relational language whos…
GQL and SQL/PGQ: Theoretical Models and Expressive Power
Amélie Gheerbrant, Leonid Libkin, Liat Peterfreund +1
SQL/PGQ and GQL are very recent international standards for querying property graphs: SQL/PGQ specifies how to query relational representations of property graphs in SQL, while GQL…
Complexity of Evaluating GQL Queries
Diego Figueira, Anthony W. Lin, Liat Peterfreund
GQL has recently emerged as the standard query language over graph databases (particularly, the property graph model). Indeed, this is analogous to the role of SQL for relational d…
Querying Incomplete Numerical Data: Between Certain and Possible Answers
Marco Console, Leonid Libkin, Liat Peterfreund
Queries with aggregation and arithmetic operations, as well as incomplete data, are common in real-world database, but we lack a good understanding of how they should interact. On…
GPC: A Pattern Calculus for Property Graphs
Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo +7
The development of practical query languages for graph databases runs well ahead of the underlying theory. The ISO committee in charge of database query languages is currently deve…
Revisiting Semiring Provenance for Datalog
Camille Bourgaux, Pierre Bourhis, Liat Peterfreund +1
Data provenance consists in bookkeeping meta information during query evaluation, in order to enrich query results with their trust level, likelihood, evaluation cost, and more. Th…
Handling SQL Nulls with Two-Valued Logic
Leonid Libkin, Liat Peterfreund
The design of SQL is based on a three-valued logic (3VL), rather than the familiar Boolean logic. 3VL adds a truth value unknown to true and false to handle nulls. Viewed as indisp…
Grammars for Document Spanners
Liat Peterfreund
We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting…
The theory of concatenation over finite models
Dominik D. Freydenberger, Liat Peterfreund
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of con…
Weight Annotation in Information Extraction
Johannes Doleschal, Benny Kimelfeld, Wim Martens +1
The framework of document spanners abstracts the task of information extraction from text as a function that maps every document (a string) into a relation over the document's span…
Complexity Bounds for Relational Algebra over Document Spanners
Liat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld +1
We investigate the complexity of evaluating queries in Relational Algebra (RA) over the relations extracted by regex formulas (i.e., regular expressions with capture variables) ove…
Recursive Programs for Document Spanners
Liat Peterfreund, Balder ten Cate, Ronald Fagin +1
A document spanner models a program for Information Extraction (IE) as a function that takes as input a text document (string over a finite alphabet) and produces a relation of spa…
Joining Extractions of Regular Expressions
Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund
Regular expressions with capture variables, also known as "regex formulas," extract relations of spans (interval positions) from text. These relations can be further manipulated vi…
Unambiguous Prioritized Repairing of Databases
Benny Kimelfeld, Ester Livshits, Liat Peterfreund
In its traditional definition, a repair of an inconsistent database is a consistent database that differs from the inconsistent one in a "minimal way". Often, repairs are not equal…