- Table View
- List View
Formal Concept Analysis: Mathematical Foundations
by Bernhard Ganter Rudolf WilleThis first textbook on formal concept analysis gives a systematic presentation of the mathematical foundations and their relations to applications in computer science, especially in data analysis and knowledge processing. Above all, it presents graphical methods for representing conceptual systems that have proved themselves in communicating knowledge. The mathematical foundations are treated thoroughly and are illuminated by means of numerous examples, making the basic theory readily accessible in compact form.
Formal Concept Analysis: Mathematical Foundations
by Bernhard Ganter Rudolf WilleFormal Concept Analysis is a field of applied mathematics based on the mathematization of concept and conceptual hierarchy. It thereby activates mathematical thinking for conceptual data analysis and knowledge processing. The underlying notion of “concept” evolved early in the philosophical theory of concepts and still has effects today. In mathematics it played a special role during the emergence of mathematical logic in the 19th century. Subsequently, however, it had virtually no impact on mathematical thinking. It was not until 1979 that the topic was revisited and treated more thoroughly. Since then, Formal Concept Analysis has fully emerged, sparking a multitude of publications for which the first edition of this textbook established itself as the standard reference in the literature, with a total of 10000+ citations. This is the second edition, revised and extended, of the textbook published originally in German (1996) and translated into English (1999), giving a systematic presentation of the mathematical foundations while also focusing on their possible applications for data analysis and knowledge processing. In times of digital knowledge processing, formal methods of conceptual analysis are gaining in importance. The book makes the basic theory for such methods accessible in a compact form, and presents graphical methods for representing concept systems that have proved themselves essential in communicating knowledge. The textbook complements each chapter with further notes, references and trends, putting the work in modern context and highlighting potential directions for further research. Additionally, the book contains an entirely new chapter on contextual concept logic, including a section on description logics and relational concept analysis. As such, it should be a valuable resource for students, instructors and researchers at the crossroads of subject areas like Applied and Discrete Mathematics, Logics, Theoretical Computer Science, Knowledge Processing, Data Science, and is meant to be used both for research and in class, as a teaching resource.
Formal Concept Analysis: 12th International Conference, ICFCA 2014, Cluj-Napoca, Romania , June 10-13, 2014. Proceedings (Lecture Notes in Computer Science #8478)
by Cynthia Vera Glodeanu Mehdi Kaytoue Christian SacareaThis book constitutes the refereed proceedings of the 12th International Conference on Formal Concept Analysis, ICFCA 2014, held in Cluj-Napoca, Romania, in June 2014. The 16 regular papers presented together with 3 invited talks were carefully reviewed and selected from 39 submissions. The papers in this volume cover a rich range of FCA aspects, such as theory, enhanced FCA. Knowledge discovery and knowledge spaces, as well as methods and applications. In addition the book contains a reprint of the first publication "Sub direct decomposition of concept lattices" by Rudolf Wille.
Formal Concept Analysis: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings (Lecture Notes in Computer Science #3403)
by Robert Godin Bernhard GanterThis volume contains the Proceedings of ICFCA 2005, the 3rd International Conference on Formal Concept Analysis. The ICFCA conference series aims to be the premier forum for the publication of advances in applied lattice and order theory, and in particular scienti?c advances related to formal concept analysis. Formal concept analysis is a ?eld of applied mathematics with its mat- matical root in order theory, in particular in the theory of complete lattices. Researchers had long been aware of the fact that these ?elds have many - tential applications. Formal concept analysis emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathe- tization of concept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical com- nity and an increasing number of applications in data and knowledge processing, including data visualization, information retrieval, machine learning, data an- ysis and knowledge management. ICFCA2005re?ectedbothpracticalbene?tsandprogressinthefoundational theory of formal concept analysis. Algorithmic aspects were discussed as well as e?orts to broaden the ?eld. All regular papers appearing in this volume were refereed by at least two, in most cases three independent reviewers. The ?nal decision to accept the papers was arbitrated by the Program Chairs based on the referee reports. It was the involvement of the Program Committee and the Editorial Board that ensured the scienti?c quality of these proceedings.
Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings (Lecture Notes in Computer Science #10308)
by Karell Bertet, Daniel Borchmann, Peggy Cellier and Sébastien FerréThis book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally published in “Die Klassifkation und ihr Umfeld”, edited by P. O. Degens, H. J. Hermes, and O. Opitz, Indeks-Verlag, Frankfurt, 1986.The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.
Formal Concept Analysis: 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings (Lecture Notes in Computer Science #4390)
by Sergei O. Kuznetsov Stefan SchmidtThis 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.
Formal Concept Analysis: 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010, Procedings (Lecture Notes in Computer Science #5986)
by Léonard Kwuida Baris SertkayaThis volume contains selected papers presented at ICFCA 2010, the 8th Int- national Conference on Formal Concept Analysis. The ICFCA conference series aims to be the prime forum for dissemination of advances in applied lattice and order theory, and in particular advances in theory and applications of Formal Concept Analysis. Formal Concept Analysis (FCA) is a ?eld of applied mathematics with its mathematical root in order theory, in particular the theory of complete lattices. Researchershadlongbeenawareofthefactthatthese?eldshavemanypotential applications.FCAemergedinthe1980sfrome?ortstorestructurelattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathematical formalization of c- cept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical community and an - creasingnumberofapplicationsindataandknowledgeprocessingincludingdata visualization, information retrieval, machine learning, sofware engineering, data analysis, data mining in Web 2.0, analysis of social networks, concept graphs, contextual logic and description logics. ICFCA 2010 took place during March 15–18, 2010 in Agadir, Morocco. We received 37 high-quality submissions out of which 17 were chosen as regular papers in these proceedings after a competitive selection process. Less mature works that were still considered valuable for discussion at the conference were collected in the supplementary proceedings. The papers in the present volume coveradvancesinvariousaspectsofFCArangingfromitstheoreticalfoundations to its applications in numerous other ?elds. In addition to the regular papers, thisvolumealsocontainsfourkeynotepapersarisingfromtheseveninvitedtalks given at the conference. We are also delighted to include a reprint of Bernhard Ganter’sseminalpaper on hiswell-knownalgorithmfor enumerating closedsets.
Formal Concept Analysis: 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings (Lecture Notes in Computer Science #4933)
by Raoul Medina Sergei ObiedkovFormal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptualhierarchyleadingtomethodsforconceptuallyanalyzingdataandkno- edge. The theoryitselfstronglyreliesonorderandlatticetheory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning, and, over the last years, the range of applicationshaskeptgrowing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data. Then, they realized that this data, just rough information for them, might become a real treasure if turned into knowledge. FCA is particularly well suited for this purpose. From relational data, FCA can extract implications, - pendencies, concepts and hierarchies of concepts, and thus capture part of the knowledge hidden in the data. The ICFCA conference series gathers researchers from all over the world, being the main forum to present new results in FCA and related ?elds. These results range from theoretical novelties to advances in FCA-related algorithmic issues, as well as application domains of FCA. ICFCA 2008 was in the same vein as its predecessors: high-quality papers and presentations, the place of real debate and exchange of ideas. ICFCA 2008 contributed to strengthening the links between theory and applications. The high quality of the presentations was the result of the remarkable work of the authors and the reviewers. We wish to thank the reviewers for all their valuable comments, which helped the authors to improve their presentations.
Formal Concept Analysis: 4th International Conference, ICFCA 2006, Dresden, Germany, Feburary 13-17, 2006, Proceedings (Lecture Notes in Computer Science #3874)
by Rokia Missaoui Jürg SchmidThis book constitutes the refereed proceedings of the 4th International Conference on Formal Concept Analysis, held in February 2006. The 17 revised full papers presented together with four invited papers were carefully reviewed and selected for inclusion in the book. The papers show advances in applied lattice and order theory and in particular scientific advances related to formal concept analysis and its practical applications: data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management.
Formal Concept Analysis: 9th International Conference, ICFCA 2011, Nicosia, Cyprus, May 2-6, 2011, Proceedings (Lecture Notes in Computer Science #6628)
by Petko Valtchev Robert JäschkeThis book constitutes the refereed proceedings of the 9th International Conference on Formal Concept Analysis, ICFCA 2011, held in Nicosia, Cyprus, in May 2011. The 16 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 49 submissions. The central theme was the mathematical formalization of concept and conceptual hierarchy. The field has developed into a constantly growing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including disciplines such as data visualization, information retrieval, machine learning, software engineering, data analysis, data mining, social networks analysis, etc.
Formal Concept Analysis of Social Networks (Lecture Notes in Social Networks)
by Rokia Missaoui Sergei O. Kuznetsov Sergei ObiedkovThe book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge communities, individuality computation, other types of FCA-based analysis of bipartite graphs (two-mode networks), multimodal clustering, community detection and description in one-mode and multi-mode networks, adaptation of the dual-projection approach to weighted bipartite graphs, extensions to the Kleinberg's HITS algorithm as well as attributed graph analysis.
Formal Correctness of Security Protocols (Information Security and Cryptography)
by Giampaolo BellaThe author investigates proofs of correctness of realistic security protocols in a formal, intuitive setting. The protocols examined include Kerberos versions, smartcard protocols, non-repudiation protocols, and certified email protocols. The method of analysis turns out to be both powerful and flexible. This research advances significant extensions to the method of analysis, while the findings on the protocols analysed are novel and illuminating.
Formal Description Techniques and Protocol Specification, Testing and Verification: FORTE XI/PSTV XVIII’98 IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII) 3–6 November 1998, Paris, France (IFIP Advances in Information and Communication Technology #6)
by Stan Budkowski Ana Cavalli Elie NajmFormal Description Techniques and Protocol Specification, Testing and Verification addresses formal description techniques (FDTs) applicable to distributed systems and communication protocols. It aims to present the state of the art in theory, application, tools and industrialization of FDTs. Among the important features presented are: FDT-based system and protocol engineering; FDT-application to distributed systems; Protocol engineering; Practical experience and case studies. Formal Description Techniques and Protocol Specification, Testing and Verification comprises the proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification, sponsored by the International Federation for Information Processing, held in November 1998, Paris, France. Formal Description Techniques and Protocol Specification, Testing and Verification is suitable as a secondary text for a graduate-level course on Distributed Systems or Communications, and as a reference for researchers and practitioners in industry.
Formal Description Techniques and Protocol Specification, Testing and Verification: FORTE X / PSTV XVII ’97 (IFIP Advances in Information and Communication Technology)
by Atsushi Togashi Tadanori Mizuno Norio Shiratori Teruo HigashinoFORTE/PSTV '97 addresses Formal Description Techniques (FDTs) applicable to Distributed Systems and Communication Protocols (such as Estelle, LOTOS, SDL, ASN.1, TTCN, Z, Automata, Process Algebra, Logic). The conference is a forum for presentation of the state-of-the-art in theory, application, tools and industrialization of FDTs, and provides an excellent orientation for newcomers.
Formal Description Techniques, IV: Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols, FORTE '91, Sydney, Australia, 19-22 November 1991 (IFIP Transactions C: Communication Systems #Volume 2)
by K. R. Parker G. A. RoseFormality is becoming accepted as essential in the development of complex systems such as multi-layer communications protocols and distributed systems. Formality is mandatory for mathematical verification, a procedure being imposed on safety-critical system development. Standard documents are also becoming increasingly formalised in order to capture notions precisely and unambiguously. This FORTE '91 proceedings volume has focussed on the standardised languages SDL, Estelle and LOTOS while, as with earlier conferences, remaining open to other notations and techniques, thus encouraging the continuous evolution of formal techniques. This useful volume contains 29 submitted papers, three invited papers, four industry reports, and four tool reports organised to correspond with the conference sessions.
Formal Description Techniques IX: Theory, application and tools (IFIP Advances in Information and Communication Technology)
by R. Gotzhein J. BrederekeThis book is the combined proceedings of the latest IFIP Formal Description Techniques (FDTs) and Protocol Specification, Testing and Verification (PSTV) series. It addresses FDTs applicable to communication protocols and distributed systems, with special emphasis on standardised FDTs. It features state-of-the-art in theory, application, tools and industrialisation of formal description.
Formal Description Techniques VII (IFIP Advances in Information and Communication Technology)
by D. Hogrefe S. LeueThis book presents the latest research in formal techniques for distributed systems, including material on theory, applications, tools and industrial usage of formal techniques.
Formal Description Techniques VIII (IFIP Advances in Information and Communication Technology)
by Gregor Von Bochmann Rachida Dssouli Omar RafiqThis volume contains the latest worldwide research results on formal description techniques applicable to telecommunications, covering their theoretical foundations, industrial applications and practical usage. The book presents the selected proceedings of the eighth International Conference on Formal Description Techniques, arranged by the International Federation for Information Processing and held in Montreal, Canada, October 1995.
Formal Development of a Network-Centric RTOS: Software Engineering for Reliable Embedded Systems
by Eric Verhulst Raymond T. Boute José Miguel Faria Bernhard H.C. Sputh Vitaliy MezhuyevMany systems, devices and appliances used routinely in everyday life, ranging from cell phones to cars, contain significant amounts of software that is not directly visible to the user and is therefore called "embedded". For coordinating the various software components and allowing them to communicate with each other, support software is needed, called an operating system (OS). Because embedded software must function in real time (RT), a RTOS is needed. This book describes a formally developed, network-centric Real-Time Operating System, OpenComRTOS. One of the first in its kind, OpenComRTOS was originally developed to verify the usefulness of formal methods in the context of embedded software engineering. Using the formal methods described in this book produces results that are more reliable while delivering higher performance. The result is a unique real-time concurrent programming system that supports heterogeneous systems with just 5 Kbytes/node. It is compatible with safety related engineering standards, such as IEC61508.
Formal Engineering for Industrial Software Development: Using the SOFL Method
by Shaoying LiuIn any serious engineering discipline, it would be unthinkable to construct a large system without having a precise notion of what is to be built and without verifying how the system is expected to function. Software engineering is no different in this respect. Formal methods involve the use of mathematical notation and calculus in software development; such methods are difficult to apply to large-scale systems with practical constraints (e.g., limited developer skills, time and budget restrictions, changing requirements). Here Liu claims that formal engineering methods may bridge this gap. He advocates the incorporation of mathematical notation into the software engineering process, thus substantially improving the rigor, comprehensibility and effectiveness of the methods commonly used in industry. This book provides an introduction to the SOFL (Structured Object-Oriented Formal Language) method that was designed and industry-tested by the author. Written in a style suitable for lecture courses or for use by professionals, there are numerous exercises and a significant real-world case study, so the readers are provided with all the knowledge and examples needed to successfully apply the method in their own projects.
Formal Equivalence Checking and Design Debugging (Frontiers in Electronic Testing #12)
by Shi-Yu Huang Kwang-Ting (Tim) ChengFormal Equivalence Checking and Design Debugging covers two major topics in design verification: logic equivalence checking and design debugging. The first part of the book reviews the design problems that require logic equivalence checking and describes the underlying technologies that are used to solve them. Some novel approaches to the problems of verifying design revisions after intensive sequential transformations such as retiming are described in detail. The second part of the book gives a thorough survey of previous and recent literature on design error diagnosis and design error correction. This part also provides an in-depth analysis of the algorithms used in two logic debugging software programs, ErrorTracer and AutoFix, developed by the authors. From the Foreword: `With the adoption of the static sign-off approach to verifying circuit implementations the application-specific integrated circuit (ASIC) industry will experience the first radical methodological revolution since the adoption of logic synthesis. Equivalence checking is one of the two critical elements of this methodological revolution. This book is timely for either the designer seeking to better understand the mechanics of equivalence checking or for the CAD researcher who wishes to investigate well-motivated research problems such as equivalence checking of retimed designs or error diagnosis in sequential circuits.' Kurt Keutzer, University of California, Berkeley
Formal Foundations of Reuse and Domain Engineering: 11th International Conference on Software Reuse, ICSR 2009, Falls Church, VA, USA, September 27-30, 2009. Proceedings (Lecture Notes in Computer Science #5791)
by Stephen H. Edwards Gregory KulczyckiICSR is the premier international conference in the ?eld of software reuse. The main goal of ICSR is to present the advances and improvements within the software reuse domain, as well as to promote interaction between researchers and practitioners. The 11th International Conference on Software Reuse (ICSR 2009) was held during September 27–30, 2009 in Falls Church, VA, USA. 2009 was the year that ICSR went back to its roots. The theme was “Formal Foundations of Reuse and Domain Engineering.” We explored the theory and formal foundations that underlie current reuse and domain engineering practice and looked at current advancements to get an idea of where the ?eld of reuse was headed. Manyof the papers in these proceedings directly re?ect that theme. The following workshops were held in conjunction with ICSR 2009: – Second Workshop on Knowledge Reuse (KREUSE 2009) – RESOLVE 2009: Software Veri?cation – the Cornerstone of Reuse – First International Workshop on Software Ecosystems – International Workshop on Software Reuse and Safety (RESAFE 2009) Aside from these workshops and the papers found here, the conference also included ?ve tutorials, eight tool demos, and a doctoral symposium. Links to all of this information and more can be found at the ICSR 11 conference website at icsr11.isase.org.
Formal Grammar: 24th International Conference, FG 2019, Riga, Latvia, August 11, 2019, Proceedings (Lecture Notes in Computer Science #11668)
by Raffaella Bernardi Greg Kobele Sylvain PogodallaEdited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 24th International Conference on Formal Grammar, FG 2019, held in Riga, Latvia, in August 2019, in conjunction with the 31st European Summer School in Logic, Language and Information, ESSLI 2019.The 7 full papers presented were carefully reviewed and selected from 11 submissions. They present new and original research on formal grammar, mathematical linguistics, and the application of formal and mathematical methods to the study of natural language and focus on topics such as formal and computational phonology, morphology, syntax, semantics, and pragmatics; model-theoretic and proof-theoretic methods in linguistics; logical aspects of linguistic structure; constraint-based and resource-sensitive approaches to grammar; learnability of formal grammar; integration of stochastic and symbolic models of grammar; foundational, methodological, and architectural issues in grammar and linguistics; and mathematical foundations of statistical approaches to linguistic analysis.
Formal Grammar: 20th and 21st International Conferences, FG 2015, Barcelona, Spain, August 2015, Revised Selected Papers. FG 2016, Bozen, Italy, August 2016, Proceedings (Lecture Notes in Computer Science #9804)
by Annie Foret Glyn Morrill Reinhard Muskens Rainer Osswald Sylvain PogodallaThis book constitutes the refereed proceedings of the 20th and 21st International Conference on Formal Grammar 2015 and 2016, collocated with the European Summer School in Logic, Language and Information in August 2015/2016. The 19 revised full papers presented together with 2 invited talks were carefully reviewed and selected from a total of 34 submissions.The focus of papers are as follows:Formal and computational phonology, morphology, syntax, semantics and pragmaticsModel-theoretic and proof-theoretic methods in linguisticsLogical aspects of linguistic structureConstraint-based and resource-sensitive approaches to grammarLearnability of formal grammarIntegration of stochastic and symbolic models of grammarFoundational, methodological and architectural issues in grammar and linguisticsMathematical foundations of statistical approaches to linguistic analysis
Formal Grammar: 22nd International Conference, FG 2017, Toulouse, France, July 22-23, 2017, Revised Selected Papers (Lecture Notes in Computer Science #10686)
by Annie Foret Reinhard Muskens Sylvain PogodallaEdited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the refereed proceedings of the 22nd International Conference on Formal Grammar, FG 2017, collocated with the European Summer School in Logic, Language and Information in July 2017. The 9 contributed papers were carefully reviewed and selected from 14 submissions.The focus of papers are as follows: Formal and computational phonology, morphology, syntax, semantics and pragmatics Model-theoretic and proof-theoretic methods in linguistics Logical aspects of linguistic structure Constraint-based and resource-sensitive approaches to grammar Learnability of formal grammar Integration of stochastic and symbolic models of grammar Foundational, methodological and architectural issues in grammar and linguistics Mathematical foundations of statistical approaches to linguistic analysis