1581 search results - page 148 / 317 » Domain semantics of possibility computations |
123
Voted
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
104
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Determining if a group of proteins are functionally associated among themselves is an open problem in molecular biology. Within our long term goal of applying Genetic Programming ...
116
click to vote
APIN
2008
15 years 3 months ago
2008
This paper presents a data-driven approach for feature selection to address the common problem of dealing with high-dimensional data. This approach is able to handle the real-valu...
133
Voted
JAIR
2010
15 years 2 months ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
105
Voted
CONCUR
2005
Springer
15 years 9 months ago
2005
Springer
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...