Please use this identifier to cite or link to this item:
doi:10.22028/D291-24837
Title: | Extended logic-plus-functional programming |
Author(s): | Boley, Harold |
Language: | English |
Year of Publication: | 1992 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1992 |
SWD key words: | Künstliche Intelligenz Sprachverarbeitung Computerlinguistik |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | Extensions of logic and functional programming are integrated in RELFUN. Its valued clauses comprise Horn clauses (true'-valued) and clauses with a distinguished foot' premise (returning arbitrary values). Both the logic and functional components permit LISP-like varying-arity and higher-order operators. The DATAFUN sublanguage of the functional component is shown to be preferable to relational encodings of functions in DATALOG. RELFUN permits non-ground, non-deterministic functions, hence certain functions can be inverted using an is'-primitive generalizing that of PROLOG. For function nestings a strict call-by-value strategy is employed. The reduction of these extensions to a relational sublanguage is discussed and their WAM compilation is sketched. Three examples (serialise', wang', and eval') demonstrate the relational/functional style in use. The list expressions of RELFUN's LISP implementation are presented in an extended PROLOG-like syntax. |
Link to this record: | urn:nbn:de:bsz:291-scidok-35894 hdl:20.500.11880/24893 http://dx.doi.org/10.22028/D291-24837 |
Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
Series volume: | 92-03 |
Date of registration: | 18-May-2011 |
Faculty: | SE - Sonstige Einrichtungen |
Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
RR_92_03.pdf | 17,41 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.