Please use this identifier to cite or link to this item:
|Title:||An interpolation method for CLP traversal||Authors:||Jaffar, J.
|Issue Date:||2009||Citation:||Jaffar, J.,Santosa, A.E.,Voicu, R. (2009). An interpolation method for CLP traversal. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5732 LNCS : 454-469. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-04244-7_37||Abstract:||We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate exploration. Typically, only actually traversed goals are memoed in the table. In this paper we present a method where, upon the successful traversal of a subgoal, a generalization of the subgoal is memoed. This enlarges the record of already traversed goals, thus providing more pruning in the subsequent search process. The key feature is that the abstraction computed is guaranteed not to give rise to a spurious path that might violate the target property. A driving application area is the use of CLP to model the behavior of other programs. We demonstrate the performance of our method on a benchmark of program verfication problems. © 2009 Springer Berlin Heidelberg.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/41103||ISBN:||3642042430||ISSN:||03029743||DOI:||10.1007/978-3-642-04244-7_37|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2019
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.