Technique for solution of constraint-satisfaction problems uses definite-clause grammars of Prolog computer language. Exploits fact that grammar-rule notation viewed as "state-change notation". Facilitates development of dynamic representation performing informed as well as blind searches. Applicable to design, scheduling, and planning problems.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Solving Constraint-Satisfaction Problems In Prolog Language


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    1991-11-01



    Medientyp :

    Sonstige


    Format :

    Keine Angabe


    Sprache :

    Englisch





    Solving constraint satisfaction problems with simulated annealing: the car sequencing problem revisited

    Chew, Tat-Leong / David, J.M. / Nguyen, A. et al. | Tema Archiv | 1992


    DEPICT: A high-level formal language for modeling constraint satisfaction problems

    Abbas, A. M. / Tsang, E. P. / Nasri, A. H. | British Library Online Contents | 2008


    Application driven inverse type constraint satisfaction problems

    Zhuravlev, Y. I. / Aslanyan, L. / Ryazanov, V. V. et al. | British Library Online Contents | 2017


    Distributed constraint satisfaction problems to model railway scheduling problems

    Tormos, P. / Abril, M. / Salido, M. A. et al. | British Library Conference Proceedings | 2006