700 search results - page 86 / 140 » On Termination of Constraint Logic Programs |
100
click to vote
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
CADE
2006
Springer
15 years 11 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
EPIA
2007
Springer
15 years 5 months ago
2007
Springer
This paper shows how moral decisions can be drawn computationally by using prospective logic programs. These are employed to model moral dilemmas, as they are able to prospectively...
CP
2005
Springer
15 years 4 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
TPHOL
2003
IEEE
15 years 4 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...