Paper:
Language: English:

Constraint Solving Specializations for Equality on an Interval-Variable Domain

Hiroshi Mabuchi^, Kiyoshi Akama^, Katsunori Miura^, and Takahiko Ishikawa^****

^Faculty of Software and Information Science, Iwate Prefectural University, Iwate, Japan
^Information Initiative Center, Hokkaido University, Sapporo, Japan
^Information Initiative Center, Hokkaido University, Sapporo, Japan
^****Faculty of Health and Welfare Science, Nayoro City University, Nayoro, Japan

Received: May 15, 2006

Accepted: July 5, 2006

Keywords: specialization, equality constraint, equivalent transformation, interval variable

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.11, No.2 pp. 210-219, 2007

Abstract

In the equivalent transformation (ET) model, where computation is regarded as ET using rules that constitute a program, this paper develops a theory for equality-constraint solving which unification does in the theory of logic programming. This paper clarifies the relationship between Constraint Solving Specializations for Equality (CSSEs) and unifiers. The concept of CSSE can be used to solve equality constraint in a clause, and promotes component-based programming. An algorithm for finding CSSEs in the domain including interval variables is constructed by combining simpler ET rules. Termination and correctness of the algorithm is proven.

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here: