700 search results - page 82 / 140 » On Termination of Constraint Logic Programs |
107
click to vote
FLOPS
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
74
Voted
LFCS
2007
Springer
15 years 5 months ago
2007
Springer
We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation...
CTRS
1987
15 years 2 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
ICTAI
1996
IEEE
15 years 3 months ago
1996
IEEE
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...