Brodt, Simon; Bry, François; Eisinger, Norbert
Search for More Declarativity. Backward Reasoning for Rule Languages Reconsidered.
Third International Conference on Web Reasoning and Rule Systems, 25.- 26. Oktober 2009, Chantilly, Virginia, USA.
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.