3481 search results - page 554 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
114
click to vote
AAAI
1990
15 years 4 months ago
1990
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
140
click to vote
APAL
2008
15 years 3 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
ENTCS
2006
15 years 3 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...
165
Voted
ENTCS
2006
15 years 3 months ago
2006
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked...
128
click to vote
ENTCS
2007
15 years 3 months ago
2007
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...