2138 search results - page 299 / 428 » Logics for the Relational Syllogistic |
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
CADE
2003
Springer
14 years 9 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
EDBT
2002
ACM
14 years 9 months ago
2002
ACM
One of the major challenges facing scientists dealing with gene expression data is how to integrate, explore and analyze vast quantities of related data, often residing in multiple...
ICFP
2004
ACM
14 years 9 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...