On Termination of Binary CLP Programs | Zendy

Alexander Serebrenik | Zendy; Fred Mesnard | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Termination of Binary CLP Programs

Author(s) -

Alexander Serebrenik,

Fred Mesnard

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-26655-0

DOI - 10.1007/11506676_15

Subject(s) - decidability , computer science , tuple , piecewise linear function , binary number , class (philosophy) , mathematical proof , programming language , algorithm , binary decision diagram , theoretical computer science , discrete mathematics , mathematics , arithmetic , artificial intelligence , geometry

Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to the fact that some of the recent approaches to termination of logic programs abstract the input program to a binary CLP program and conclude termination of the input program from termination of the abstracted program. In this paper we introduce a class of binary CLP programs such that their termination can be proved by using linear level mappings. We show that membership to this class is decidable and present a decision procedure. Further, we extend this class to programs such that their termination proofs require a combination of linear functions. In particular we consider as level mappings tuples of linear functions and piecewise linear functions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research