257 search results - page 29 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
75
Voted
SETN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
110
click to vote
NMR
2004
Springer
15 years 3 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...