Search strategies for functional logic programming
| dc.contributor.author | Hanus, Michael | |
| dc.contributor.author | Peemöller, Björn | |
| dc.contributor.author | Reck, Fabian | |
| dc.contributor.editor | Jähnichen, Stefan | |
| dc.contributor.editor | Rumpe, Bernhard | |
| dc.contributor.editor | Schlingloff, Holger | |
| dc.date.accessioned | 2018-11-19T13:30:01Z | |
| dc.date.available | 2018-11-19T13:30:01Z | |
| dc.date.issued | 2012 | |
| dc.description.abstract | In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages. | en |
| dc.identifier.isbn | 978-3-88579-293-2 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/18376 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software Engineering 2012. Workshopband | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-199 | |
| dc.title | Search strategies for functional logic programming | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 74 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 61 | |
| gi.conference.date | 27. Februar - 2. März 2012 | |
| gi.conference.location | Berlin | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1