TY  - BOOK
AU  - Boley,Harold
ED  - SpringerLink (Online service)
TI  - A Tight, Practical Integration of Relations and Functions
T2  - Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence,
SN  - 9783540480648
AV  - Q334-342 
U1  - 006.3 23
PY  - 1999///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Logic design
KW  - Artificial intelligence
KW  - Computer Science
KW  - Artificial Intelligence (incl. Robotics)
KW  - Mathematical Logic and Formal Languages
KW  - Logics and Meanings of Programs
N1  - An overview of the relational-functional language RELFUN -- Extended logic-plus-functional programming -- A direct semantic characterization of RELFUN -- Finite domains and exclusions as first-class citizens -- Multiple-valued Horn clauses and their WAM compilation
N2  - As in other fields, in computer science certain objects of study can be synthesized from different basic elements, in different ways, and with different resulting stabilities. In subfields such as artificial intelligence, computational logic, and programming languages various relational and functional ingredients and techniques have been tried for the synthesis of declarative programs. This text considers the notions of relations, as found in logic programming or in relational databases, and of functions, as found in functional programming or in equational languages. We study a declarative integration which is tight, because it takes place right at the level of these notions, and which is still practical, because it preserves the advantages of the widely used relational and functional languages PROLOG and LISP. The resulting relational and functional language, RELFUN, is used here for exemplifying all integration principles
UR  - http://dx.doi.org/10.1007/BFb0103291
ER  -