LEADER 01502nam 2200361 n 450 001 996394886503316 005 20200824121240.0 035 $a(CKB)3810000000009561 035 $a(EEBO)2240866063 035 $a(UnM)99829145e 035 $a(UnM)99829145 035 $a(EXLCZ)993810000000009561 100 $a19950524d1679 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 14$athe happy greeting of Iohn and Betty, or, Nothing better than true love$b[electronic resource] $eJohn declares that Betty is his dear, and few there be that can with her compare; for Nell and Prue, Jone and Mary, There's none of these can please him for to marry. But Betty is the girl that's civil and chast, and none but her alone he will imbrace. The tune is, Celia's my foe. By L.W 210 $a[London] $cPrinted for F. Coles, T. Vere, J. Wright, and J. Clarke$d[1674-1679] 215 $a1 sheet ([1] p.) $cill. (woodcuts) 300 $aVerse - "Come sit down my dear,". 300 $aPlace of publication from and date estimated by Wing. 300 $aReproduction of the original in the Bodleian Library. 330 $aeebo-0014 606 $aBallads, English$y17th century 615 0$aBallads, English 700 $aL. W$01001507 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996394886503316 996 $aThe happy greeting of Iohn and Betty, or, Nothing better than true love$92421702 997 $aUNISA LEADER 04742nam 22009015 450 001 9910767528903321 005 20251226202132.0 010 $a1-280-90217-5 010 $a9786610902170 010 $a3-540-70901-0 024 7 $a10.1007/978-3-540-70901-5 035 $a(CKB)1000000000284097 035 $a(SSID)ssj0000296710 035 $a(PQKBManifestationID)11267042 035 $a(PQKBTitleCode)TC0000296710 035 $a(PQKBWorkID)10327212 035 $a(PQKB)11078670 035 $a(DE-He213)978-3-540-70901-5 035 $a(MiAaPQ)EBC3036654 035 $a(MiAaPQ)EBC6408055 035 $a(PPN)123160154 035 $a(MiAaPQ)EBC302133 035 $a(BIP)14117684 035 $a(EXLCZ)991000000000284097 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFormal Concept Analysis $e5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings /$fedited by Sergei O. Kuznetsov, Stefan Schmidt 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (X, 329 p.) 225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v4390 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-70828-6 320 $aIncludes bibliographical references and index. 327 $aRelational Galois Connections -- Semantology as Basis for Conceptual Knowledge Processing -- A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets -- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data -- Computing Intensions of Digital Library Collections -- Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis -- The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees -- A Parameterized Algorithm for Exploring Concept Lattices -- About the Lossless Reduction of the Minimal Generator Family of a Context -- Some Notes on Pseudo-closed Sets -- Performances of Galois Sub-hierarchy-building Algorithms -- Galois Connections Between Semimodules and Applications in Data Mining -- On Multi-adjoint Concept Lattices: Definition and Representation Theorem -- Base Points, Non-unit Implications, and Convex Geometries -- Lattices of Relatively Axiomatizable Classes -- A Solution of the Word Problem for Free Double Boolean Algebras -- On the MacNeille Completion of Weakly Dicomplemented Lattices -- Polynomial Embeddings and Representations -- The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices -- Bipartite Ferrers-Graphs and Planar Concept Lattices. 330 $aThis book constitutes the refereed proceedings of the 5th International Conference on Formal Concept Analysis, ICFCA 2007, held in Clermont-Ferrand, France in February 2007. The 19 revised full papers presented together with 1 invited lecture comprise state of the art research from foundational to applied lattice theory and related fields, all of which involve methods and techniques of formal concept analysis. 410 0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v4390 606 $aArtificial intelligence 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aMachine theory 606 $aSoftware engineering 606 $aData mining 606 $aAlgebra 606 $aArtificial Intelligence 606 $aDiscrete Mathematics in Computer Science 606 $aFormal Languages and Automata Theory 606 $aSoftware Engineering 606 $aData Mining and Knowledge Discovery 606 $aOrder, Lattices, Ordered Algebraic Structures 615 0$aArtificial intelligence. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aMachine theory. 615 0$aSoftware engineering. 615 0$aData mining. 615 0$aAlgebra. 615 14$aArtificial Intelligence. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aFormal Languages and Automata Theory. 615 24$aSoftware Engineering. 615 24$aData Mining and Knowledge Discovery. 615 24$aOrder, Lattices, Ordered Algebraic Structures. 676 $a511.33 702 $aKuznetsov$b Sergei O. 702 $aSchmidt$b Stefan E. 712 12$aInternational Conference on Formal Concept Analysis 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767528903321 996 $aFormal Concept Analysis$9772457 997 $aUNINA