A Simple Complete Search for Logic Programming
Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018
Here, we present a family of complete interleaving depth-first search strategies for embedded, domain-specific logic languages. We derive our search family from a stream-based implementation of incomplete depth-first search. The DSL's programs' texts induce particular strategies guaranteed to be complete.