2026-08-10T17:38:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8467 2024-03-06T10:30:11Z ddc:004 open_access

A Simple Complete Search for Logic Programming Hemann, Jason Friedman, Daniel P. Byrd, William E. Might, Matthew logic programming streams search Racket backtracking relational programming 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jason Hemann and Daniel P. Friedman and William E. Byrd and Matthew Might 2018 Is Part Of OASIcs, Volume 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2017.14 urn:nbn:de:0030-drops-84676 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.14 eng https://creativecommons.org/licenses/by/3.0/legalcode