Finite Domain Constraint Problems and their Relationship with Logic Programming

作者: Ugo Montanari , Francesca Rossi

DOI: 10.1007/978-3-662-02952-7_4

关键词: Functional logic programmingConstraint satisfaction problemMathematical optimizationConstraint logic programmingMathematicsConstraint satisfactionConstraint programmingInductive programmingLogic programmingTheoretical computer scienceConcurrent constraint logic programming

摘要: The paper gives a very informal overview of the main results in area finite domain constraint satisfaction problems (CSPs). Particular attention is put into description local consistency algorithms, which efficiently solve some classes problems, and relationship between CSPs logic programming. In fact, programming, as well other language paradigms were born to extend programming (like concurrent programming) seems be suitable naturally represent CSPs, also use them provide general notion computing with constraints.

参考文章(30)
Ugo Montanari, Francesca Rossi, Perfect Relaxation in Constraint Logic Programming. international conference on lightning protection. pp. 223- 237 ,(1991)
Vasant Dhar, Charles J. Petrie, Francesca Rossi, On the equivalence of constraint satisfaction problems european conference on artificial intelligence. pp. 550- 556 ,(1990)
Klaus Estenfeld, 6th International Conference on Logic Programming. Künstliche Intell.. ,vol. 3, pp. 16- ,(1989)
Ugo Montanari, Francesca Rossi, Fundamental Properties of Networks of Constraints: A New Formulation Search in Artificial Intelligence. pp. 426- 449 ,(1988) , 10.1007/978-1-4613-8788-6_12
Molly Wilson, Michael J. Maher, Amy Martindale, Alan Borning, Constraint Hierarchies and Logic Programming. international conference on lightning protection. pp. 149- 164 ,(1989)
André Vellino, William Older, Extending Prolog with Constraint Arithmetic on Real Intervals In Canadian Conference on Computer & Electrical Engineering (1990). ,(1990)
Ugo Montanari, Francesca Rossi, An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints international workshop on graph grammars and their application to computer science. pp. 440- 457 ,(1986) , 10.1007/3-540-18771-5_69
John Wylie Lloyd, Foundations of logic programming ,(1984)
D. De Schreye, M. Bruynooghe, The compilation of forward checking regimes through meta-interpretation and transformation Meta-programming in logic programming. pp. 217- 231 ,(1989)
Eugene C. Freuder, Backtrack-Free and Backtrack-Bounded Search Search in Artificial Intelligence. pp. 343- 369 ,(1988) , 10.1007/978-1-4613-8788-6_10