118 search results - page 17 / 24 » Constraint Functional Logic Programming over Finite Domains |
ICFEM
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
101
click to vote
ICLP
2004
Springer
15 years 2 months ago
2004
Springer
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
102
Voted
CIE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
FCT
2007
Springer
15 years 3 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...
AAAI
2010
14 years 11 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...