59 search results - page 8 / 12 » Lifting abstract interpreters to quantified logical domains |
AIPS
2008
13 years 9 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Over the last twenty years AI has undergone a sea change. The oncedominant paradigm of logical inference over symbolic knowledge representations has largely been supplant...
ENTCS
2006
13 years 7 months ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
CAV
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...