Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
A relational approach to logic programming: the extended Alexander method
Theoretical Computer Science
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
Artificial intelligence (3rd ed.)
Artificial intelligence (3rd ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
SLT-Resolution for the Well-Founded Semantics
Journal of Automated Reasoning
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
A Generalized QSQR Evaluation Method for Horn Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed search methods with their well-known deficiencies are prone to compromise declarativity, the primary concern of rule languages. The paper presents a new family of uninformed search algorithms that combine the advantages of the traditional ones while avoiding their shortcomings. Moreover, the paper introduces a formal framework based on partial orderings, which allows precise and elegant analysis of such algorithms.