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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Solving Constraint-Satisfaction Problems In Prolog Language


    Contributors:

    Published in:

    Publication date :

    1991-11-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English





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

    Chew, Tat-Leong / David, J.M. / Nguyen, A. et al. | Tema Archive | 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