1 option
Formal Concept Analysis : 4th International Conference, ICFCA 2006, Dresden, Germany, Feburary 13-17, 2006, Proceedings / edited by Rokia Missaoui, Jürg Schmid.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 3874.
- Lecture Notes in Artificial Intelligence ; 3874
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Computer science--Mathematics.
- Computer science.
- Logic, Symbolic and mathematical.
- 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.
- Local Subjects:
- Artificial Intelligence.
- Discrete Mathematics in Computer Science.
- Mathematical Logic and Formal Languages.
- Software Engineering.
- Information Storage and Retrieval.
- Order, Lattices, Ordered Algebraic Structures.
- Physical Description:
- 1 online resource (X, 314 pages).
- Edition:
- First edition 2006.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
- System Details:
- text file PDF
- Contents:
- 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 Generalisation 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-32204-7
- 9783540322047
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.