4401 search results - page 521 / 881 » Computing with Default Logic |
158
click to vote
WOLLIC
2009
Springer
16 years 1 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...
190
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic a...
183
click to vote
ICMT
2009
Springer
16 years 1 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...
166
click to vote
CISIS
2008
IEEE
16 years 1 months ago
2008
IEEE
—Techniques for detecting synthetic lethal mutations in double gene deletion experiments are emerging as powerful tool for analysing genes in parallel or overlapping pathways wit...
190
click to vote
TIME
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...