6167 search results - page 153 / 1234 » Can Refinement be Automated |
143
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
140
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
168
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
133
click to vote
TIME
2007
IEEE
15 years 10 months ago
2007
IEEE
Forty-four relations are found between an interval and an interval with a gap ( rIIg ), capturing semantics that are distinct from those of the sets of constituting intervals and ...
139
click to vote
ISSRE
2006
IEEE
15 years 10 months ago
2006
IEEE
In a Model-Driven Development context (MDE), model transformations allow memorizing and reusing design know-how, and thus automate parts of the design and refinement steps of a so...