700 search results - page 112 / 140 » On Termination of Constraint Logic Programs |
ENTCS
2008
14 years 11 months ago
2008
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
RTSS
2005
IEEE
15 years 4 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
SIGSOFT
2005
ACM
15 years 11 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
ICLP
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
JAR
2006
14 years 11 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...