LEADER 03580nam 2200637 a 450 001 9910483079403321 005 20200520144314.0 010 $a3-540-32204-3 024 7 $a10.1007/11671404 035 $a(CKB)1000000000232812 035 $a(SSID)ssj0000317699 035 $a(PQKBManifestationID)11248520 035 $a(PQKBTitleCode)TC0000317699 035 $a(PQKBWorkID)10294557 035 $a(PQKB)10995801 035 $a(DE-He213)978-3-540-32204-7 035 $a(MiAaPQ)EBC3067607 035 $a(PPN)123131375 035 $a(EXLCZ)991000000000232812 100 $a20060112d2006 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFormal concept analysis $e4th international conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006 : proceedings /$fRokia Missaoui, Jurg Schmid (eds.) 205 $a1st ed. 2006. 210 $aBerlin $cSpringer$dc2006 215 $a1 online resource (X, 314 p.) 225 1 $aLecture notes in computer science. Lecture notes in artificial intelligence,$x0302-9743 ;$v3874 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-32203-5 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Methods of Conceptual Knowledge Processing -- An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms -- Attribute Implications in a Fuzzy Setting -- The Assessment of Knowledge, in Theory and in Practice -- Regular Papers -- The Basic Theorem on Preconcept Lattices -- The Tensor Product as a Lattice of Regular Galois Connections -- Two Instances of Peirce?s Reduction Thesis -- Very Fast Instances for Concept Generation -- Negation, Opposition, and Possibility in Logical Concept Analysis -- A Note on Negation: A PCS-Completion of Semilattices -- Towards a Generalization of Formal Concept Analysis for Data Mining Purposes -- Interactive Association Rules Discovery -- About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base -- Spatial Indexing for Scalability in FCA -- Homograph Disambiguation Using Formal Concept Analysis -- Using Concept Lattices to Uncover Causal Dependencies in Software -- An FCA Interpretation of Relation Algebra -- Spring-Based Lattice Drawing Highlighting Conceptual Similarity -- Characterizing Planar Lattices Using Left-Relations -- Automated Layout of Small Lattices Using Layer Diagrams -- Counting Pseudo-intents and #P-completeness. 410 0$aLecture notes in computer science.$pLecture notes in artificial intelligence ;$v3874. 606 $aLattice theory$vCongresses 606 $aComprehension (Theory of knowledge)$xMathematical models$vCongresses 606 $aInformation theory$vCongresses 606 $aArtificial intelligence$xMathematical models$vCongresses 606 $aLogic, Symbolic and mathematical$vCongresses 615 0$aLattice theory 615 0$aComprehension (Theory of knowledge)$xMathematical models 615 0$aInformation theory 615 0$aArtificial intelligence$xMathematical models 615 0$aLogic, Symbolic and mathematical 676 $a006.3 701 $aMissaoui$b R$01757040 701 $aSchmid$b Jurg$f1944-$01757041 712 12$aInternational Conference on Formal Concept Analysis 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483079403321 996 $aFormal concept analysis$94194679 997 $aUNINA