Sciweavers

3394 search results - page 210 / 679
» A Modal Model of Memory
Sort
View
TIME
2009
IEEE
15 years 11 months ago
Model Checking CTL is Almost Always Inherently Sequential
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
148
Voted
PLILP
1998
Springer
15 years 8 months ago
Logic Programming and Model Checking
We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci ca...
Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kum...
CORR
2006
Springer
131views Education» more  CORR 2006»
15 years 4 months ago
Intensional Models for the Theory of Types
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
Reinhard Muskens
ICRA
2010
IEEE
185views Robotics» more  ICRA 2010»
15 years 2 months ago
Heteroscedastic Gaussian processes for data fusion in large scale terrain modeling
This paper presents a novel approach to data fusion for stochastic processes that model spatial data. It addresses the problem of data fusion in the context of large scale terrain ...
Shrihari Vasudevan, Fabio T. Ramos, Eric Nettleton...
LPAR
2010
Springer
15 years 2 months ago
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
Michael Gabbay, Murdoch James Gabbay