Eingang zum Volltext in SciDok
Lizenz
Report (Bericht) zugänglich unter
A direct semantic characterization of RELFUN
URN: urn:nbn:de:bsz:291-scidok-36967
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3696/
Quelle:
(1992) Kaiserslautern ; Saarbrücken : DFKI, 1992
pdf-Format:
Dokument 1.pdf (379 KB)
SWD-Schlagwörter:
Künstliche Intelligenz
Institut:
DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe:
Informatik
Dokumentart:
Report (Bericht)
Schriftenreihe:
Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer:
92-54
Sprache:
Englisch
Erstellungsjahr:
1992
Publikationsdatum:
28.06.2011
Kurzfassung auf Englisch:
This paper attempts a direct semantic formalization of first-order relational-functional languages (the characteristic RELFUN subset) in terms of a generalized model concept. Function-defining conditional equations (or, footed clauses) and active call-by-value expressions (in clause premises) are integrated into first-order theories. Herbrand models are accommodated to relational-functional programs by not only containing ground atoms but also ground molecules, i.e. specific function applications paired with values. Extending SLD-resolution toward innermost conditional narrowing of relational-functional clauses, SLV-resolution is introduced, which, e.g., flattens active expressions. The Tp-operator is generalized analogously, e.g. by unnesting ground-clause premises. Soundness and completeness proofs for SLV-resolution naturally extend the corresponding results in logic programming.
Lizenz:
Standard-Veröffentlichungsvertrag