Titlebook: A Tight, Practical Integration of Relations and Functions; Harold Boley Book 1999 Springer-Verlag Berlin Heidelberg 1999 LISP.artificial i

本土

比目魚

呼吸

https://doi.org/10.1007/BFb0103291LISP; artificial intelligence; functional programming; intelligence; logic; programming; programming langu

photopsia

kindred

A Tight, Practical Integration of Relations and Functions978-3-540-48064-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

演講

束縛

Spam and its economic significance,istinguished ‘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

注入

https://doi.org/10.1007/978-3-540-71750-8generalized 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 accomodated to relational-functional programs by not only containing ground atoms but also g

摸索

https://doi.org/10.1007/978-3-540-71750-8non-ground structure which can be later specialized through in-place assignment of some inner variables, it can also be bound to, say, a domain structure which can be specialized later through ‘in-place deletion’ of some of its elements (e.g. by intersection with other domain structures). While fini

持久

https://doi.org/10.1007/978-1-349-08203-2ifying the value sequence to be returned. Functions can thus, relation-like, succeed or fail, enumerate values non-deterministically, return multiple values, and have non-ground arguments and values. Relations act like characteristic functions, permit functionally nested call-by-value arguments, and