Generalized semantics and abstract interpretation for constraint logic programs

Roberto Giacobazzi, Saumya K Debray, Giorgio Levi

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)191-247
Number of pages57
JournalJournal of Logic Programming
Volume25
Issue number3
DOIs
StatePublished - 1995
Externally publishedYes

Fingerprint

Abstract Interpretation
Logic Programs
Semantics
Constraint Logic Programming
Logic programming
Algebraic Semantics
Bottom-up
Algebraic Structure
Logic

ASJC Scopus subject areas

  • Logic

Cite this

Generalized semantics and abstract interpretation for constraint logic programs. / Giacobazzi, Roberto; Debray, Saumya K; Levi, Giorgio.

In: Journal of Logic Programming, Vol. 25, No. 3, 1995, p. 191-247.

Research output: Contribution to journalArticle

@article{4a004c006354474289b32d13a2fcd092,
title = "Generalized semantics and abstract interpretation for constraint logic programs",
abstract = "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.",
author = "Roberto Giacobazzi and Debray, {Saumya K} and Giorgio Levi",
year = "1995",
doi = "10.1016/0743-1066(95)00038-0",
language = "English (US)",
volume = "25",
pages = "191--247",
journal = "Journal of Logic Programming",
issn = "1567-8326",
publisher = "Elsevier Inc.",
number = "3",

}

TY - JOUR

T1 - Generalized semantics and abstract interpretation for constraint logic programs

AU - Giacobazzi, Roberto

AU - Debray, Saumya K

AU - Levi, Giorgio

PY - 1995

Y1 - 1995

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

VL - 25

SP - 191

EP - 247

JO - Journal of Logic Programming

JF - Journal of Logic Programming

SN - 1567-8326

IS - 3

ER -