An introduction to partial evaluation

ND Jones - ACM Computing Surveys (CSUR), 1996‏ - dl.acm.org
Partial evaluation provides a unifying paradigm for a broad spectrum of work in program
optimization compiling interpretation and the generation of automatic program generators …

Analysis and transformation of constrained Horn clauses for program verification

E De Angelis, F Fioravanti, JP Gallagher… - Theory and Practice of …, 2022‏ - cambridge.org
This paper surveys recent work on applying analysis and transformation techniques that
originate in the field of constraint logic programming (CLP) to the problem of verifying …

[كتاب][B] Partial evaluation and automatic program generation

ND Jones, CK Gomard, P Sestoft - 1993‏ - books.google.com
Partial evaluation reconciles generality with efficiency by providing automatic specialization
and optimization of programs. Proceeding from a gentle introduction for reaching state-of-the …

Linking data to ontologies

A Poggi, D Lembo, D Calvanese… - Journal on data …, 2008‏ - Springer
Many organizations nowadays face the problem of accessing existing data sources by
means of flexible mechanisms that are both powerful and efficient. Ontologies are widely …

Ontology-Based Data Access: Ontop of Databases

M Rodriguez-Muro, R Kontchakov… - International Semantic …, 2013‏ - Springer
We present the architecture and technologies underpinning the OBDA system Ontop and
taking full advantage of storing data in relational databases. We discuss the theoretical …

Tabled evaluation with delaying for general logic programs

W Chen, DS Warren - Journal of the ACM (JACM), 1996‏ - dl.acm.org
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation
of predicate calculus as a programming language and forms the computational basis for …

Efficient SPARQL-to-SQL with R2RML map**s

M Rodriguez-Muro, M Rezk - Journal of Web Semantics, 2015‏ - Elsevier
Existing SPARQL-to-SQL translation techniques have limitations that reduce their
robustness, efficiency and dependability. These limitations include the generation of …

Closed-form upper bounds in static cost analysis

E Albert, P Arenas, S Genaim, G Puebla - Journal of automated reasoning, 2011‏ - Springer
The classical approach to automatic cost analysis consists of two phases. Given a program
and some measure of cost, the analysis first produces cost relations (CRs), ie, recursive …

[PDF][PDF] Memoing for logic programs

DS Warren - Communications of the ACM, 1992‏ - dl.acm.org
T he power of logic programming (LP) comes from the synergism between the logic
(declarativeness) and the programming (procedurality [13, 37]. From the logic point of view …

Transformation of logic programs: Foundations and techniques

A Pettorossi, M Proietti - The Journal of Logic Programming, 1994‏ - Elsevier
We present an overview of some techniques which have been proposed for the
transformation of logic programs. We consider the so-called “rules+ strategies” approach …