Arrays, bounded quantification and iteration in logic and constraint logic programming
We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification.
|Logic Programming (acm D.1.6), Language Constructs and Features (acm D.3.3), Studies of Program Constructs (acm F.3.3), Deduction and Theorem Proving (acm I.2.3)|
|Theory of computing (msc 68Qxx), Theorem proving (deduction, resolution, etc.) (msc 68T15)|
|Department of Computer Science [CS]|
|Organisation||Logic and language|
Apt, K.R. (1995). Arrays, bounded quantification and iteration in logic and constraint logic programming. Department of Computer Science [CS]. CWI.