700 search results - page 57 / 140 » On Termination of Constraint Logic Programs |
112
click to vote
CSCLP
2004
Springer
15 years 4 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
POPL
2012
ACM
13 years 6 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
115
click to vote
DAC
2006
ACM
16 years 5 days ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
104
click to vote
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
102
click to vote
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...