License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2017.14
URN: urn:nbn:de:0030-drops-84676
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8467/
Go to the corresponding OASIcs Volume Portal

Hemann, Jason ; Friedman, Daniel P. ; Byrd, William E. ; Might, Matthew

A Simple Complete Search for Logic Programming

pdf-format:
OASIcs-ICLP-2017-14.pdf (0.4 MB)

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.

BibTeX - Entry

@InProceedings{hemann_et_al:OASIcs:2018:8467,
  author =	{Jason Hemann and Daniel P. Friedman and William E. Byrd and Matthew Might},
  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 =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-058-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{58},
  editor =	{Ricardo Rocha and Tran Cao Son and Christopher Mears and Neda Saeedloei},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8467},
  URN =		{urn:nbn:de:0030-drops-84676},
  doi =		{10.4230/OASIcs.ICLP.2017.14},
  annote =	{Keywords: logic programming, streams, search,   Racket, backtracking, relational programming}
}

Keywords: logic programming, streams, search, Racket, backtracking, relational programming
Collection: Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)
Issue Date: 2018
Date of publication: 14.02.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI