Developing a declarative rule language for applications in product configuration

Timo Soininen; Ilkka Niemelä

doi:10.1007/3-540-49201-1_21

Developing a declarative rule language for applications in product configuration

Aalto University

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

86 Citations (Scopus)

Abstract

A rule-based language is proposed for product configuration applications. It is equipped with a declarative semantics providing formal definitions for main concepts in product configuration, including configuration models, requirements and valid configurations. The semantics uses Horn clause derivability to guarantee that each element in a configuration has a justification. This leads to favorable computational properties. For example, the validity of a configuration can be decided in linear time and other computational tasks remain in NP. It is shown that CSP and dynamic CSP can be embedded in the proposed language which seems to be more suitable for representing configuration knowledge. The rule language is closely related to normal logic programs with the stable model semantics. This connection is exploited in the first implementation which is based on a translator from rules to normal programs and on an existing high performance implementation of the stable model semantics, the Smodels system.

Original language	English
Title of host publication	PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES
Subtitle of host publication	First International Workshop, PADL’99 San Antonio, Texas, USA, January 18–19, 1999 Proceedings
Editors	G Gupta
Publisher	Springer
Pages	305-319
Number of pages	15
ISBN (Electronic)	978-3-540-49201-6
ISBN (Print)	3-540-65527-1, 978-3-540-65527-5
DOIs	https://doi.org/10.1007/3-540-49201-1_21
Publication status	Published - 1999
MoE publication type	A4 Conference publication
Event	International Workshop on Practical Aspects of Declarative Languages - San Antonio, United States Duration: 18 Jan 1999 → 19 Jan 1999 Conference number: 1

Publication series

Name	Lecture Notes in Computer Science
Publisher	SPRINGER-VERLAG BERLIN
Volume	1551
ISSN (Print)	0302-9743

Workshop

Workshop	International Workshop on Practical Aspects of Declarative Languages
Abbreviated title	PADL
Country/Territory	United States
City	San Antonio
Period	18/01/1999 → 19/01/1999

Keywords

LOGIC

Access to Document

10.1007/3-540-49201-1_21

Cite this

Soininen, T., & Niemelä, I. (1999). Developing a declarative rule language for applications in product configuration. In G. Gupta (Ed.), PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES: First International Workshop, PADL’99 San Antonio, Texas, USA, January 18–19, 1999 Proceedings (pp. 305-319). (Lecture Notes in Computer Science; Vol. 1551). Springer. https://doi.org/10.1007/3-540-49201-1_21

@inproceedings{3059781957ad485f88ff1305edd99b95,

title = "Developing a declarative rule language for applications in product configuration",

abstract = "A rule-based language is proposed for product configuration applications. It is equipped with a declarative semantics providing formal definitions for main concepts in product configuration, including configuration models, requirements and valid configurations. The semantics uses Horn clause derivability to guarantee that each element in a configuration has a justification. This leads to favorable computational properties. For example, the validity of a configuration can be decided in linear time and other computational tasks remain in NP. It is shown that CSP and dynamic CSP can be embedded in the proposed language which seems to be more suitable for representing configuration knowledge. The rule language is closely related to normal logic programs with the stable model semantics. This connection is exploited in the first implementation which is based on a translator from rules to normal programs and on an existing high performance implementation of the stable model semantics, the Smodels system.",

keywords = "LOGIC",

author = "Timo Soininen and Ilkka Niemel{\"a}",

year = "1999",

doi = "10.1007/3-540-49201-1_21",

language = "English",

isbn = "3-540-65527-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "305--319",

editor = "G Gupta",

booktitle = "PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES",

address = "Germany",

note = "International Workshop on Practical Aspects of Declarative Languages, PADL ; Conference date: 18-01-1999 Through 19-01-1999",

}

Soininen, T & Niemelä, I 1999, Developing a declarative rule language for applications in product configuration. in G Gupta (ed.), PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES: First International Workshop, PADL’99 San Antonio, Texas, USA, January 18–19, 1999 Proceedings. Lecture Notes in Computer Science, vol. 1551, Springer, pp. 305-319, International Workshop on Practical Aspects of Declarative Languages, San Antonio, Texas, United States, 18/01/1999. https://doi.org/10.1007/3-540-49201-1_21

Developing a declarative rule language for applications in product configuration. / Soininen, Timo; Niemelä, Ilkka.
PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES: First International Workshop, PADL’99 San Antonio, Texas, USA, January 18–19, 1999 Proceedings. ed. / G Gupta. Springer, 1999. p. 305-319 (Lecture Notes in Computer Science; Vol. 1551).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Developing a declarative rule language for applications in product configuration

AU - Soininen, Timo

AU - Niemelä, Ilkka

N1 - Conference code: 1

PY - 1999

Y1 - 1999

N2 - A rule-based language is proposed for product configuration applications. It is equipped with a declarative semantics providing formal definitions for main concepts in product configuration, including configuration models, requirements and valid configurations. The semantics uses Horn clause derivability to guarantee that each element in a configuration has a justification. This leads to favorable computational properties. For example, the validity of a configuration can be decided in linear time and other computational tasks remain in NP. It is shown that CSP and dynamic CSP can be embedded in the proposed language which seems to be more suitable for representing configuration knowledge. The rule language is closely related to normal logic programs with the stable model semantics. This connection is exploited in the first implementation which is based on a translator from rules to normal programs and on an existing high performance implementation of the stable model semantics, the Smodels system.

AB - A rule-based language is proposed for product configuration applications. It is equipped with a declarative semantics providing formal definitions for main concepts in product configuration, including configuration models, requirements and valid configurations. The semantics uses Horn clause derivability to guarantee that each element in a configuration has a justification. This leads to favorable computational properties. For example, the validity of a configuration can be decided in linear time and other computational tasks remain in NP. It is shown that CSP and dynamic CSP can be embedded in the proposed language which seems to be more suitable for representing configuration knowledge. The rule language is closely related to normal logic programs with the stable model semantics. This connection is exploited in the first implementation which is based on a translator from rules to normal programs and on an existing high performance implementation of the stable model semantics, the Smodels system.

KW - LOGIC

U2 - 10.1007/3-540-49201-1_21

DO - 10.1007/3-540-49201-1_21

M3 - Conference article in proceedings

SN - 3-540-65527-1

SN - 978-3-540-65527-5

T3 - Lecture Notes in Computer Science

SP - 305

EP - 319

BT - PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES

A2 - Gupta, G

PB - Springer

T2 - International Workshop on Practical Aspects of Declarative Languages

Y2 - 18 January 1999 through 19 January 1999

ER -

Developing a declarative rule language for applications in product configuration

Abstract

Publication series

Workshop

Keywords

Access to Document

Fingerprint

Cite this