LEADER 04654nam 22007935 450 001 996466152203316 005 20220318183408.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 $a20100419d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFormal Concept Analysis$b[electronic resource] $e4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006, Proceedings /$fedited by Rokia Missaoui, Jürg Schmid 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (X, 314 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$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 Artificial Intelligence ;$v3874 606 $aArtificial intelligence 606 $aComputer science?Mathematics 606 $aMathematical logic 606 $aSoftware engineering 606 $aInformation storage and retrieval 606 $aAlgebra 606 $aOrdered algebraic structures 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aOrder, Lattices, Ordered Algebraic Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/M11124 615 0$aArtificial intelligence. 615 0$aComputer science?Mathematics. 615 0$aMathematical logic. 615 0$aSoftware engineering. 615 0$aInformation storage and retrieval. 615 0$aAlgebra. 615 0$aOrdered algebraic structures. 615 14$aArtificial Intelligence. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aMathematical Logic and Formal Languages. 615 24$aSoftware Engineering. 615 24$aInformation Storage and Retrieval. 615 24$aOrder, Lattices, Ordered Algebraic Structures. 676 $a006.3 702 $aMissaoui$b Rokia$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchmid$b Jürg$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Formal Concept Analysis 906 $aBOOK 912 $a996466152203316 996 $aFormal Concept Analysis$9772457 997 $aUNISA