- Autor
- Ligęza Antoni (AGH University of Science and Technology, Poland)
- Tytuł
- Models and Tools for Improving Efficiency in Constraint Logic Programming
- Źródło
- Decision Making in Manufacturing and Services, 2011, vol. 5, nr 1/2, s. 69-78, rys., bibliogr. 7 poz.
- Słowa kluczowe
- Programowanie matematyczne, Przetwarzanie danych, Algorytmy
Mathematical programming, Data processing, Algorithms - Uwagi
- summ.
- Abstrakt
- Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of constraints is presented and an outline of strategy planning approach focused on entropy minimization is put forward. An example cryptoaritmetic problem is explored in order to explain the proposed approach. (original abstract)
- Pełny tekst
- Pokaż
- Bibliografia
- Apt, K.R., 2006. Principles of Constraint Programming. Cambridge University Press, Cambridge, UK.
- Bratko, I., 2000. Prolog Programming for Artificial Intelligence. Addison Wesley, 3rd edition.
- Dechter, R., 2003. Constraint Processing. Morgan Kaufmann Publishers, San Francisco, CA.
- Ligęza, A. 2009a. And-or graph with knowledge propagation rules as a model for constraint satisfaction problems. Automatyka, 13(2), 411-419.
- Ligęza, A. 2009b. A constraint satisfaction framework for diagnostic problems. In Zdzisław Kowalczuk, editor, Diagnosis of processes and systems, volume 7 of Control and Computer Science : information technology, control theory, fault and system diagnosis, Pomeranian Science and Technology Publishers PWNT, Gdańsk, Poland, pp. 255-262.
- Ligęza, A., Kościelny, J. M., 2008. A new approach to multiple fault diagnosis. combination of diagnostic matrices, graphs, algebraic and rule-based models. the case of two-layer models. Int. J. Appl. Math. Comput. Sci., 18(4), 465-476.
- Russell, S., Norvig, P., 2003. Artificial Intelligence: A Modern Approach. Prentice-Hall, 2nd edition.
- Cytowane przez
- ISSN
- 2300-7087
- Język
- eng
- URI / DOI
- http://dx.doi.org/10.7494/dmms.2011.5.1.69