GRS-Prolog: Applying Different Resolution Strategies to Prolog Programs

P. Kefalas and E.Tzelali

Abstract: We present a logic language which is designed to meet the specific requirements of search algorithms in Artificial Intelligence. Guided Resolution Strategy Prolog is a combination of pure Prolog and control directives which are expressed in terms of a meta-program. Logic program and resolution strategy are naturally separated, introducing a new programming discipline; controlling the execution can be seen as a distinct programming activity which could overwrite the default depth-first resolution strategy to any other type of search. We show how a set of primitive directives could be combined, leading in effect to application of different search algorithms over the same state space. We demonstrate the effectiveness of GRS-Prolog by writing different meta-programs which  produce different results if applied to the same logic program, thus enabling the selection of the most suitable resolution strategy.

Keywords: Logic Programming, Prolog, Resolution Strategies, Meta-Programming, Search Algorithms, Artificial Intelligence

Appeared in: Proceedings of the 5th Panhellenic Conference on Information Techology, Athens, December 1995.

Available: Hardcopy on request from the authors. .

Back to Dept. of Computer Science, CITY Liberal Studies
Back to Petros Kefalas home page