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...
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...
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...
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...
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...