01159nem0-2200373---450-99000950074040332120111213103458.0000950074FED01000950074(Aleph)000950074FED0100095007420111206d1971----km-y0itay50------baitaITba-------bl--aa-aabb----------a1:100000o0040000o0033000n0444000n0442000GenovaDocumento cartograficoServizio geologico d'Italia2. ed.1:100000 (O4°-O3°30'/N44°40'-N44°20')RomaStab. L. Salomone19711 cartacolor40 x 37 cm su foglio 77 x 59 cmCarta geologica d'Italia82Il meridiano di riferimento è M. Mario, RomaFoglio 82LiguriaCarte geologicheServizio geologico nazionale434454ITUNINARICAUNIMARCMP990009500740403321MP Cass.2. Geol. 100 (082)I.G. s.i.ILFGEILFGEGenova851329UNINA03736nam 22006375 450 99646594910331620200629142222.03-540-48064-110.1007/BFb0103291(CKB)1000000000548770(SSID)ssj0000327256(PQKBManifestationID)11232917(PQKBTitleCode)TC0000327256(PQKBWorkID)10298933(PQKB)10710936(DE-He213)978-3-540-48064-8(PPN)155202669(EXLCZ)99100000000054877020121227d1999 u| 0engurnn|008mamaatxtccrA Tight, Practical Integration of Relations and Functions[electronic resource] /by Harold Boley1st ed. 1999.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1999.1 online resource (XII, 176 p.) Lecture Notes in Artificial Intelligence ;1712Bibliographic Level Mode of Issuance: Monograph3-540-66644-3 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.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.Lecture Notes in Artificial Intelligence ;1712Artificial intelligenceProgramming languages (Electronic computers)Mathematical logicComputer logicArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XArtificial intelligence.Programming languages (Electronic computers).Mathematical logic.Computer logic.Artificial Intelligence.Programming Languages, Compilers, Interpreters.Mathematical Logic and Formal Languages.Logics and Meanings of Programs.005.74Boley Haroldauthttp://id.loc.gov/vocabulary/relators/aut747095BOOK996465949103316A Tight, Practical Integration of Relations and Functions2262775UNISA00924nam0 22002533i 450 VAN007100520230118121527.79978-18-480-0130-520090723d2008 |0itac50 baengDE|||| |||||Handbook of performability engineeringKrishna B. MisraLondraSpringer2008XLVIII, 1316 p.ill.26 cmGBLondonVANL000015MisraKrishna B.VANV055916Springer <editore>VANV108073650ITSOL20240614RICABIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIAIT-CE0100VAN05VAN0071005BIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIA05PREST L II 099 05 5373 20090723 BuonoHandbook of performability engineering1414546UNICAMPANIA