LEADER 03736nam  22006375  450 
001 996465949103316
005 20200629142222.0
010   $a3-540-48064-1
024 7 $a10.1007/BFb0103291
035   $a(CKB)1000000000548770
035   $a(SSID)ssj0000327256
035   $a(PQKBManifestationID)11232917
035   $a(PQKBTitleCode)TC0000327256
035   $a(PQKBWorkID)10298933
035   $a(PQKB)10710936
035   $a(DE-He213)978-3-540-48064-8
035   $a(PPN)155202669
035   $a(EXLCZ)991000000000548770
100   $a20121227d1999      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 12$aA Tight, Practical Integration of Relations and Functions$b[electronic resource] /$fby Harold Boley
205   $a1st ed. 1999.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1999.
215   $a1 online resource (XII, 176 p.) 
225 1 $aLecture Notes in Artificial Intelligence ;$v1712
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-66644-3 
327   $aAn 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.
330   $aAs 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.
410  0$aLecture Notes in Artificial Intelligence ;$v1712
606   $aArtificial intelligence
606   $aProgramming languages (Electronic computers)
606   $aMathematical logic
606   $aComputer logic
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
615  0$aArtificial intelligence.
615  0$aProgramming languages (Electronic computers).
615  0$aMathematical logic.
615  0$aComputer logic.
615 14$aArtificial Intelligence.
615 24$aProgramming Languages, Compilers, Interpreters.
615 24$aMathematical Logic and Formal Languages.
615 24$aLogics and Meanings of Programs.
676   $a005.74
700   $aBoley$b Harold$4aut$4http://id.loc.gov/vocabulary/relators/aut$0747095
906   $aBOOK
912   $a996465949103316
996   $aA Tight, Practical Integration of Relations and Functions$92262775
997   $aUNISA