Abstract
Constraint Logic Programming (CLP) is an extension of Logic Programming to include constraints. In the presence, CLP is a powerful theoretical concept solving problems with constraints. However, most CLP languages allow the programmer to specify only constraints that must hold strictly. In many applications, such as machine scheduling, image recognition and interactive graphics, it is necessary to express preferences as well as strict requirements. To describe such preferences declaratively, HCLP has been proposed. HCLP is a logic language that introduces preference constraint as constraints with label of its strength. Unfortunately the computation method for HCLP proposed in [5] cannot calculate the most desirable answers that satisfy preferences. If we compute the best answers by using the method, it must compute all the answers one by one. In this paper we propose efficient algorithm for HCLP using preference constraints positively. Our algorithm is guaranteed to compute only a subset of all the answers, to obtain the best answers. We also proof the least fixed point characterization and the termination of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aiba, A. and Furukawa, K.: On Constraint Programming—Principally Constraint Logic Programming, Journal of Japanese Society for Artificial Intelligence, Vol. 6, No. 1, pp. 47–59, 1991 (in Japanese).
Bancilhon, F.: Naive Evaluation of Recursively Defined Relations, On Knowledge Base Management Systems—Integrating Database and AI Systems, Brodie and Mylopoulus, Eds., Springer-Verlag.
Beeri, C. and Ramakrishnan,R.: On the Power of Magic, Proc. 6th PODS., pp. 269–283, San Diego, 1987.
Bird, R. S.: The Promotion and Accumulation Strategies in Transformational Programming, ACM Transaction on Programming Languages and Systems, Vol. 6, No. 4, pp. 487–504, 1984.
Borning, A., et. al.: Constraint Hierarchies and Logic Programming, Proc. of ICLP'89, pp. 149–164, 1989.
Cohen, J.: Constraint Logic Programming Languages, Comm. ACM, Vol. 33, No. 7, pp. 52–68, 1990.
Colmerauer, A.: An Introduction of PrologIII, Comm. ACM, Vol. 33, No. 7, pp. 69–90, 1990.
Dincbas, M., et. al.: The Constraint Logic Programming Language CHIP, Proc. of FGCS'88, pp. 693–702, 1988.
Fox, M. S.: Constraint—Directed Search: A Case Study of Job-Shop Scheduling, Morgan Kaufmann pub., 1987.
Hattori, Takashi: Constraint Logic Programming with Priority., Computer Software (Journal of Japan Society for Software Science and Technology), Vol. 9, No. 6, pp. 48–57, 1992(in Japanese).
Ito, Kenji et. al.: A Scheduling System for Berth Assignments Based on a Hierarchical Constraint—Directed Search, Journal of Japanese Society for Artificial Intelligence, Vol. 6, No. 1, pp. 60–71, 1991 (in Japanese).
Kemp, D. B., et. al.: Propagating Constraints in Recursive Deductive Databases, North American Logic Programming Conference, 1989.
Le Provost, T. and Wallace, M.: Domain Independent Propagation, Proc. of FGCS'92, pp. 1004–1011, 1992.
Ostroff, J. S.: Constraint Logic Programming for Reasoning About Discrete Event Processes, Journal of Logic Programming, Vol. 11, No. 3&4, pp. 243–270, 1991.
Ullman, J. D.: Principles of database and knowledge-base systems vol. 1 and vol. 2, Computer Science Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujio, T. (1994). An efficient algorithm of logic programming with constraint hierarchy. In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016852
Download citation
DOI: https://doi.org/10.1007/BFb0016852
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58403-2
Online ISBN: 978-3-540-48699-2
eBook Packages: Springer Book Archive