6740 search results - page 1216 / 1348 » Using Classification as a Programming Language |
139
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
177
click to vote
ICMT
2009
Springer
15 years 11 months ago
2009
Springer
Testing model transformations requires input models which are graphs of inter-connected objects that must conform to a meta-model and meta-constraints from heterogeneous sources su...
127
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
137
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
137
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...