Sciweavers

710 search results - page 17 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
ESWS
2008
Springer
13 years 9 months ago
Foundations of RDF Databases
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
Claudio Gutierrez
EACL
2003
ACL Anthology
13 years 9 months ago
Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
Stephan Kepser
APLAS
2011
ACM
12 years 7 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 7 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
JOLLI
2006
101views more  JOLLI 2006»
13 years 7 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke