Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Voets, Dean"'
Autor:
Voets, Dean, De Schreye, Danny
Publikováno v:
TPLP, 2011, volume 11, number 4-5, pages 521 --536
In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is
Externí odkaz:
http://arxiv.org/abs/1109.3256
We present a heuristic framework for attacking the undecidable termination problem of logic programs, as an alternative to current termination/non-termination proof approaches. We introduce an idea of termination prediction, which predicts terminatio
Externí odkaz:
http://arxiv.org/abs/0905.2004
Autor:
Voets, Dean
One of the main advantages of logic programs is that it allows to write declarative programs that very understandable. However, such a declarati ve program can be a very inefficient or even a non-terminating specifica tion of a problem. Therefore, on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1131::83c0594739146bad211639487a983647
https://lirias.kuleuven.be/handle/123456789/423182
https://lirias.kuleuven.be/handle/123456789/423182
We present a new approach to termination analysis of Constraint Handling Rules (CHR). Unlike current approaches, our approach has no restrictions on the kind of rules in the CHR program. We propose a termination condition, that verifies conditions im
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1131::a7f04c522d5b0128a86b196cc8e4c2fa
https://lirias.kuleuven.be/handle/123456789/161884
https://lirias.kuleuven.be/handle/123456789/161884
We present a new approach to termination analysis of Constraint Handling Rules (CHR). Unlike current approaches, our approach has no restrictions on the kind of rules in the CHR program. We propose a termination condition that verifies conditions imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::241b2577d754f257d50191efe2314e71
https://lirias.kuleuven.be/handle/123456789/146255
https://lirias.kuleuven.be/handle/123456789/146255
Autor:
Voets, Dean, De Schreye, Danny
Publikováno v:
Logic Programming (9783642028458); 2009, p220-234, 15p
Publikováno v:
Theory & Practice of Logic Programming; Nov2009, Vol. 9 Issue 6, p751-780, 30p