933 search results - page 149 / 187 » Extending Forward Checking |
197
click to vote
FOSSACS
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
195
Voted
IFL
2005
Springer
16 years 13 days ago
2005
Springer
Polytypic functional programming has the advantage that it can derive code for generic functions automatically. However, it is not clear whether it is useful for anything other tha...
166
click to vote
LPNMR
2005
Springer
16 years 13 days ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
170
click to vote
ISSTA
2004
ACM
16 years 11 days ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
202
click to vote
CAV
2004
Springer
16 years 10 days ago
2004
Springer
SAL 2 augments the specification language and explicit-state model checker of SAL 1 with high-performance symbolic and bounded model checkers, and with novel infinite bounded and...