Sciweavers

2138 search results - page 33 / 428
» Logics for the Relational Syllogistic
Sort
View
ICDT
2009
ACM
127views Database» more  ICDT 2009»
16 years 26 days ago
A logical account of uncertain databases based on linear logic
A formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a...
Sungwoo Park, Seung-won Hwang
ICFP
2012
ACM
13 years 8 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
ILP
2007
Springer
16 years 7 days ago
Relational Macros for Transfer in Reinforcement Learning
We describe an application of inductive logic programming to transfer learning. Transfer learning is the use of knowledge learned in a source task to improve learning in a related ...
Lisa Torrey, Jude W. Shavlik, Trevor Walker, Richa...
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 10 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin