04654nam 22007935 450 99646615220331620220318183408.03-540-32204-310.1007/11671404(CKB)1000000000232812(SSID)ssj0000317699(PQKBManifestationID)11248520(PQKBTitleCode)TC0000317699(PQKBWorkID)10294557(PQKB)10995801(DE-He213)978-3-540-32204-7(MiAaPQ)EBC3067607(PPN)123131375(EXLCZ)99100000000023281220100419d2006 u| 0engurnn#008mamaatxtccrFormal Concept Analysis[electronic resource] 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006, Proceedings /edited by Rokia Missaoui, Jürg Schmid1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (X, 314 p.)Lecture Notes in Artificial Intelligence ;3874Bibliographic Level Mode of Issuance: Monograph3-540-32203-5 Includes bibliographical references and index.Invited 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.Lecture Notes in Artificial Intelligence ;3874Artificial intelligenceComputer science—MathematicsMathematical logicSoftware engineeringInformation storage and retrievalAlgebraOrdered algebraic structuresArtificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Information Storage and Retrievalhttps://scigraph.springernature.com/ontologies/product-market-codes/I18032Order, Lattices, Ordered Algebraic Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/M11124Artificial intelligence.Computer science—Mathematics.Mathematical logic.Software engineering.Information storage and retrieval.Algebra.Ordered algebraic structures.Artificial Intelligence.Discrete Mathematics in Computer Science.Mathematical Logic and Formal Languages.Software Engineering.Information Storage and Retrieval.Order, Lattices, Ordered Algebraic Structures.006.3Missaoui Rokiaedthttp://id.loc.gov/vocabulary/relators/edtSchmid Jürgedthttp://id.loc.gov/vocabulary/relators/edtInternational Conference on Formal Concept AnalysisBOOK996466152203316Formal Concept Analysis772457UNISA