PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Principles of constrain systems and constraint solvers

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this compact overview, we introduce the most common constraint system used in constraint programming lanquages and algorithms to solve them. Constraint systems are the result of taking a data type together with its operations and interpreting the resulting expressions as constraints. These constraint systems use the universal data types of numbers to represent scalar data or terms to represent structured data. Algorithms are presented as logical inference rules that are directly executable in the Constraint Handling Rules language.
Rocznik
Strony
131--159
Opis fizyczny
Bibliogr. 23 poz., tab., wzory
Twórcy
autor
Bibliografia
  • [1] K. APT: Principles of Constraint Programming. Cambridge University Press, Cambridge, UK, 2003.
  • [2] F. BENHAMOU: Interval constraint logic programming. In A. Podelski, (Ed), Constraint Programming: Basics and Trends, LNCS 910, Berlin, Springer, 1995.
  • [3] P. CODOGNET and D. DIAL: Compiling constraints in clp(FD). J. Logic Programming, 27(3), (1996), 185-226.
  • [4] A. COLMERAUER: Prolog and infinite trees. In K. L. Clark and S.-A. Tiirnlund, (Eds), Logic Programming, Academic Press, London, 1982, 231-251.
  • [5] A. COLMERAUER: An introduction to Prolog III. In J. W. Lloyd, (Ed), ComputationalLogic: Symp. Proc., Berlin, Springer, 1990, 37-79.
  • [6] E. DUMBILL: Application of resolution and backtracking to the solution of constraint satisfaction problems. Project report, 1995.
  • [7] M. DINCBAS, P. VAN HENTENRYCK, H. SIMONIS, A. AGGOUN, T. GRAF, and F. BERTHIER: The constraint logic programming language chip. Proc. Int. Conf. on Filth Generation Computer Systems, Institute for New Generation Computer Technology, (1988), 693-702.
  • [8] T. FRUHWIRTH and S. ABDENNADHER: Essentials of Constraint Programming. Springer, 2003.
  • [9] T. FRUHWIRTH: Theory and practice of constraint handling rules. Special issue on constraint logic programming. J. Logic Programming, 37(1-3), (1998), 95-138.
  • [10] T. FRUHWIRTH: As time goes by: Automatic complexity analysis of simplification rules. Proc. 8th Int. Conf. on Principles of Knowledge Representation and Reasoning, Toulouse, France, (2002).
  • [11] T. FRÜHWIRTH: CHR web-pages, www.informatik.unii-ulm.de/pm/mitarbeiter/fruehwirth/chr.html, 2004.
  • [12] M. HÖHFELD and G. SMOLKA: Definite relations over constraint languages. LILOG Report 53, IWBS, IBM Deutschland, Stuttgart, Germany, October 1988.
  • [13] W. HARVEY and P. J. STUCKEY: Improving linear constraint propagation by changing constraint representation. Constraints J., 8(2), (2003), 173-207.
  • [14] J.-L. J. IMBERT; Linear constraint solving in clp-languages. In A. Podelski, (Ed), Constraint Programming: Basics and Trends, LNCS 910, Berlin, Springer, 1995.
  • [15] J. JAFFAR and M. J. MAHER: Constraint logic programming: A survey. J. Logic Programming, 19-20, (1994), 503-581.
  • [16] J. JAFFAR, S. MICHAYLOV, P. J. STUCKEY and R. H. C. YAP: The clp(90 language and system. ACM Transactions on Programming Languages and Systems, 14(3), (1992), 339-395.
  • [17] M. J. MAHER: Complete axiomatizations of the algebras of finite, rational, and infinite trees. Proc. 3rd Annual IEEE Symp. on Logic in Computer Science LICS'88, Los Alamitos, California, IEEE Computer Society Press, (1988), 348-357.
  • [18] R. MOHR and G. MASINI: Good old discrete relaxation. Proc. 8th European Conf on Artificial Intelligence, Munich, Germany, (1988), 651-656.
  • [19] K. MARRIOTT and P. J. STUCKEY: Programming with Constraints: An Introduction. MIT Press, Cambridge, Mass., 1998.
  • [20] S. Menju, K. Sakai, Y. Sato and A. Aiha: A study on boolean constraint solvers. In F. Benhamou and A. Colmerauer, (Ed), Constraint Logic Programming: Selected Research, MIT Press, Cambridge, Mass., 1993, 253-268.
  • [21] T. SCHRIJVERS and T. FRÜHWIRTH: Optimal union-find in constraint handling rules. Theory and Practice of Logic Programming (TPLP), 6(1), (2006).
  • [22] P. VAN HENTENRYCK, Y. DEVILLE and C.-M. TENG: A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57 ( 1992), 291-321.
  • [23] P. VAN HENTENRYCK, V. A. SARASWAT and Y. DEVILLE: Constraint processing in cc(FD). In A. Podelski, (Ed), Constraint Programming: Basics and Trends, LNCS 910, Berlin, Springer, 1995.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BSW3-0025-0008
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.