A polymorphic type system for PROLOG.
Artificial Intelligence
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Artificial Intelligence
Intractable unifiability problems and backtracking
Proceedings on Third international conference on logic programming
Abstract interpretation of Prolog programs
Proceedings on Third international conference on logic programming
Logic for Problem Solving
Handbook of AI
Efficient Reordering of Prolog Programs
Proceedings of the Fourth International Conference on Data Engineering
Efficient reordering of C-PROLOG
CSC '93 Proceedings of the 1993 ACM conference on Computer science
An optimised semantic web query language implementation in prolog
ICLP'05 Proceedings of the 21st international conference on Logic Programming
| Hi-index | 0.00 |
Prolog programs are often inefficient: execution corresponds to a depth-first traversal of an AND/OR graph; traversing subgraphs in another order can be less expensive. It is shown how the reordering of clauses within Prolog predicates, and especially of goals within clauses, can prevent unnecessary search. The characterization and detection of restrictions on reordering is discussed. A system of calling modes for Prolog, geared to reordering, is proposed, and ways to infer them automatically are discussed. The information needed for safe reordering is summarized, and which types can be inferred automatically and which must be provided by the user are considered. An improved method for determining a good order for the goals of Prolog clauses is presented and used as the basis for a reordering system.