1032 search results - page 123 / 207 » Extended Computation Tree Logic |
116
click to vote
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
138
click to vote
ICMT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...
134
click to vote
ICTAC
2004
Springer
15 years 9 months ago
2004
Springer
Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...
111
click to vote
ACL
1992
15 years 4 months ago
1992
Aspects of semantic interpretation, such as quantifier scoping and reference resolution, are often realised computationally by non-monotonic operations involving loss of informati...
126
click to vote
SCL
2010
14 years 10 months ago
2010
The input-state incidence matrix of control Boolean network is proposed. It is shown that this matrix contains complete information of the input-state mapping. Using it, an easily...