Paper Info
Title
Declarative constraint programming with definitional trees
Abstract
The new generic scheme CFLP($\mathcal{D}$) has been recently proposed in [14] as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain $\mathcal{D}$. Further, [15] presented a Constrained Lazy Narrowing Calculus $CLNC(\mathcal{D})$ as a convenient computation mechanism for solving goals for CFLP($\mathcal{D}$)-programs, which was proved sound and strongly complete with respect to CFLP($\mathcal{D}$)'s semantics. Now, in order to provide a formal foundation for an efficient implementation of goal solving methods in existing systems such as Curry [8] and $\mathcal{TOY}$ [13,6], this paper enriches the CFLP($\mathcal{D}$) framework by presenting an optimization of the CLNC($\mathcal{D}$) calculus by means of definitional trees to efficiently control the computation. We prove that this new Constrained Demanded Narrowing Calculus CDNC($\mathcal({D}$) preserves the soundness and completeness properties of CLNC($\mathcal{D}$) and maintains the good properties shown for needed and demand-driven narrowing strategies [4,11,17].
Year
DOI
Venue
2005
10.1007/11559306_10
FroCos
Keywords
Field
DocType
completeness property,new generic scheme,convenient computation mechanism,constrained lazy,demand-driven narrowing strategy,calculus cdnc,declarative constraint programming,efficient implementation,semantic framework,definitional tree,constraint domain,functional logic programming,computational mechanics,constraint programming
Constraint satisfaction,Discrete mathematics,Constraint programming,Algorithm,Constraint satisfaction problem,Primitive element,Soundness,Declarative programming,Constraint logic programming,Completeness (order theory),Mathematics
Conference
ISBN
Citations 
PageRank 
3-540-29051-6
11
0.64
References 
Authors
14
2
Name
Order
Citations
PageRank
Rafael del Vado V́ırseda19713.26
rafael2110.97