Exploiting Efficient Control and Data Structures in Logic Programs
暂无分享,去创建一个
[1] Seif Haridi,et al. Programming Paradigms of the Andorra Kernel Language , 1991, ISLP.
[2] Rong Yang,et al. Performance of the Compiler-Based Andorra-I System , 1993, ICLP.
[3] David Sankoff,et al. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .
[4] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[5] Bart Demoen,et al. Hybrid Tree Search in the Andorra Model , 1994, ICLP.
[6] John S. Conery. Parallel Execution of Logic Programs , 1987 .
[7] Eugene C. Freuder,et al. The Complexity of Constraint Satisfaction Revisited , 1993, Artif. Intell..
[8] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[9] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.
[10] Rong Yang,et al. The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model , 1991, ICLP.
[11] Inês de Castro Dutra,et al. A Flexible Scheduler for the Andorra-I System , 1991, ICLP Workshop on Parallel Execution of Logic Programs.
[12] Pascal Van Hentenryck,et al. A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..
[13] Rong Yang,et al. The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model , 1991, ICLP.