Sciweavers

275 search results - page 6 / 55
» Non-Termination Inference of Logic Programs
Sort
View
JAIR
1998
97views more  JAIR 1998»
14 years 9 months ago
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
Oleg Ledeniov, Shaul Markovitch
POPL
2012
ACM
13 years 5 months ago
Syntactic control of interference for separation logic
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
Uday S. Reddy, John C. Reynolds
JMLR
2012
13 years 4 days ago
Markov Logic Mixtures of Gaussian Processes: Towards Machines Reading Regression Data
We propose a novel mixtures of Gaussian processes model in which the gating function is interconnected with a probabilistic logical model, in our case Markov logic networks. In th...
Martin Schiegg, Marion Neumann, Kristian Kersting
SIGMOD
2006
ACM
94views Database» more  SIGMOD 2006»
15 years 9 months ago
Programming for XML
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a ...
Daniela Florescu, Donald Kossmann
PPDP
2009
Springer
15 years 4 months ago
Dependent type inference with interpolants
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Hiroshi Unno, Naoki Kobayashi