TY - JOUR
T1 - Generalized semantics and abstract interpretation for constraint logic programs
AU - Giacobazzi, Roberto
AU - Debray, Saumya K.
AU - Levi, Giorgio
N1 - Funding Information:
*Partly supported by the EEC Human Capital and Mobility individual grant: "Semantic Definitions, Abstract Interpretation and Constraint Reasoning," N. ERB4001GT930817 and partly by the Esprit Basic Research Action 3012--Compulog I. tpartly supported by the National Science Foundation under grants CCR-8901283 and CCR-9123520. SPartly supported by "Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo" of C.N.R. under grant 9100880.PF69. Address correspondence to Roberto Giacobazzi, Dipartimento di Informatica, Universit~ di Pisa, Corso Italia 40, 56125 Pisa, Italy. E-mail: {giaco}~di.unipi.it. Received October 1993; revised June 1994; accepted February 1995.
PY - 1995/12
Y1 - 1995/12
N2 - We present simple and powerful generalized algebraic semantics for constraint logic programs that are parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any-possibly nonstandard-semantic definition. In constraint logic programming, this corresponds to a suitable definition of the constraint system supporting the semantic definition. An algebraic structure is introduced to formalize the notion of a constraint system, thus making classical mathematical results applicable. Both top-down and bottom-up semantics are considered. Nonstandard semantics for constraint logic programs can then be formally specified using the same techniques used to define standard semantics. Different nonstandard semantics for constraint logic languages can be specified in this framework. In particular, abstract interpretation of constraint logic programs can be viewed as an instance of the constraint logic programming framework itself.
AB - We present simple and powerful generalized algebraic semantics for constraint logic programs that are parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any-possibly nonstandard-semantic definition. In constraint logic programming, this corresponds to a suitable definition of the constraint system supporting the semantic definition. An algebraic structure is introduced to formalize the notion of a constraint system, thus making classical mathematical results applicable. Both top-down and bottom-up semantics are considered. Nonstandard semantics for constraint logic programs can then be formally specified using the same techniques used to define standard semantics. Different nonstandard semantics for constraint logic languages can be specified in this framework. In particular, abstract interpretation of constraint logic programs can be viewed as an instance of the constraint logic programming framework itself.
UR - http://www.scopus.com/inward/record.url?scp=0029488860&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029488860&partnerID=8YFLogxK
U2 - 10.1016/0743-1066(95)00038-0
DO - 10.1016/0743-1066(95)00038-0
M3 - Article
AN - SCOPUS:0029488860
SN - 0743-1066
VL - 25
SP - 191
EP - 247
JO - The Journal of Logic Programming
JF - The Journal of Logic Programming
IS - 3
ER -