Search Results

Documents authored by Byrd, William E.


Document
A Simple Complete Search for Logic Programming

Authors: Jason Hemann, Daniel P. Friedman, William E. Byrd, and Matthew Might

Published in: OASIcs, Volume 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)


Abstract
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.

Cite as

Jason Hemann, Daniel P. Friedman, William E. Byrd, and Matthew Might. A Simple Complete Search for Logic Programming. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 14:1-14:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@InProceedings{hemann_et_al:OASIcs.ICLP.2017.14,
  author =	{Hemann, Jason and Friedman, Daniel P. and Byrd, William E. and Might, Matthew},
  title =	{{A Simple Complete Search for Logic Programming}},
  booktitle =	{Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
  pages =	{14:1--14:8},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-058-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{58},
  editor =	{Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.14},
  URN =		{urn:nbn:de:0030-drops-84676},
  doi =		{10.4230/OASIcs.ICLP.2017.14},
  annote =	{Keywords: logic programming, streams, search, Racket, backtracking, relational programming}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail