Generating plans from proofs. The interpolation-based approach to query reformulation

DOI10.2200/S00703ED1V01Y201602DTM043MaRDI QIDQ2799047zbMATH OpenOpenAlexWikidataFDO

Authors Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura

Publication date 8 April 2016

Published in Synthesis Lectures on Data Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2200/s00703ed1v01y201602dtm043

zbMATH Keywords

interpolationquery reformulationtranslations between logic-based queries

Mathematics Subject Classification ID

Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Database theory (68P15)

Recommendations

• Generating plans from proofs
• scientific article; zbMATH DE number 1980936
• Generating plans in linear logic. I: Actions as proofs
• scientific article; zbMATH DE number 1467489
• Towards learning new methods in proof planning
• scientific article; zbMATH DE number 1305704
• A proof-planning framework with explicit abstractions based on indexed formulas
• A propositional theorem prover to solve planning and other problems
• Adaptation of declaratively represented methods in proof planning
• scientific article; zbMATH DE number 2090054

Cited in

(18)

• A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
• Craig interpolation with clausal first-order tableaux
• On enumerating query plans using analytic tableau
• Expanding queries to incomplete databases by interpolating general logic programs
• scientific article; zbMATH DE number 1759710 (Why is no real title available?)
• Generating plans from proofs
• When can we answer queries using result-bounded data interfaces?
• On Monotonic Determinacy and Rewritability for Recursive Queries and Views
• Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
• Range-restricted and Horn interpolation through clausal tableaux
• Executable first-order queries in the logic of information flows
• Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
• Craig interpolation for decidable first-order fragments
• Craig interpolation for decidable fragments of first-order logic (invited talk)
• Deciding the existence of interpolants and definitions in first-order modal logic
• Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
• Input-output disjointness for forward expressions in the logic of information flows
• Agent interpolation in distributed systems

This page was built for publication: Generating plans from proofs. The interpolation-based approach to query reformulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799047)