Sciweavers

3 search results - page 1 / 1
» B and D Are Enough to Make the Halpern-Shoham Logic Undecida...
Sort
View
ICALP
2010
Springer
13 years 6 months ago
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kie...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 7 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
ERLANG
2008
ACM
13 years 6 months ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna