241 search results - page 4 / 49 » Bounded Nondeterminism of Logic Programs |
AAAI
2006
14 years 11 months ago
2006
Several forms of reasoning in AI
ARTS
1999
Springer
15 years 1 months ago
1999
Springer
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...
ENTCS
2007
14 years 9 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
ASIAN
2006
Springer
15 years 1 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
PPDP
2007
Springer
15 years 3 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...