11016 search results - page 1915 / 2204 » Cloud Computing for Science |
161
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
194
click to vote
MICAI
2005
Springer
16 years 5 days ago
2005
Springer
A powerful and useful approach for modeling knowledge and qualitative reasoning is the Cognitive Map. The background of Cognitive Maps is the research about learning environments c...
152
click to vote
RELMICS
2005
Springer
16 years 5 days ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
188
click to vote
TACAS
2005
Springer
16 years 4 days ago
2005
Springer
SAT-based Predicate Abstraction for ANSI-C Edmund Clarke1 Daniel Kroening2 Natasha Sharygina1,3 Karen Yorav4 1 Carnegie Mellon University, School of Computer Science 2 ETH Zuerich,...
172
click to vote
TARK
2005
Springer
16 years 4 days ago
2005
Springer
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...