Sciweavers

64 search results - page 9 / 13
» Inductive Logic Programming: Derivations, Successes and Shor...
Sort
View
LICS
1994
IEEE
13 years 11 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
POPL
2006
ACM
14 years 7 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
ICTAC
2004
Springer
14 years 22 days ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
KR
2010
Springer
14 years 4 days ago
Probabilistic Description Logics for Subjective Uncertainty
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
Carsten Lutz, Lutz Schröder
FUIN
2008
142views more  FUIN 2008»
13 years 7 months ago
Relational Transformation-based Tagging for Activity Recognition
Abstract. The ability to recognize human activities from sensory information is essential for developing the next generation of smart devices. Many human activity recognition tasks...
Niels Landwehr, Bernd Gutmann, Ingo Thon, Luc De R...