Search

The book synthesizes research on the analysis of biomedical ontologies using formal concept analysis, including through auditing, curation, and enhancement. As the evolution of biomedical ontologies almost inevitably involves manual work, formal methods are a particularly useful tool for ontological engineering and practice, particularly in uncovering unexpected'bugs'and content materials. The book first introduces simple but formalized strategies for discovering undesired and incoherent patterns in ontologies before exploring the application of formal concept analysis for semantic completeness. The book then turns to formal concept analysis, a classical approach used in the mathematical treatment of orders and lattices, as an ontological engineering principle, focusing on the structural property of ontologies with respect to its conformation to lattice or not (non-lattice). The book helpfully covers the development of more efficient algorithms for non-latticedetection and extraction required by exhaustive lattice/non-lattice analysis. The book goes on to highlight the power and utility of uncovering non-lattice structure for debugging ontologies and describes methods that leverage the linguistic information in concept names (labels) for ontological analysis. It also addresses visualization and performance evaluation issues before closing with an overview and forward-looking perspectives on the field. This book is intended for graduate students and researchers interested in biomedical ontologies and their applications. It can be a useful supplement for courses on knowledge representation and engineering and also provide readers with a reference for related scientific publications and literature to assist in identifying potential research topics. All mathematical concepts and notations used in this book can be found in standard discrete mathematics textbooks, and the appendix at the end of the book provides a list of key ontological resources, as well as annotated non-lattice and lattice examples that were discovered using the authors'methods, demonstrating how'bugs are fixed'by converting non-lattices to lattices with minimal edit changes.

Domains are mathematical structures for information and approximation; they combine order-theoretic, logical, and topological ideas and provide a natural framework for modelling and reasoning about computation. The theory of domains has proved to be a useful tool for programming languages and other areas of computer science, and for applications in mathematics. Included in this proceedings volume are selected papers of original research presented at the 2nd International Symposium on Domain Theory in Chengdu, China. With authors from France, Germany, Great Britain, Ireland, Mexico, and China, the papers cover the latest research in these sub-areas: domains and computation, topology and convergence, domains, lattices, and continuity, and representations of domains as event and logical structures. Researchers and students in theoretical computer science should find this a valuable source of reference. The survey papers at the beginning should be of particular interest to those who wish to gain an understanding of some general ideas and techniques in this area.

Domain theory is a rich interdisciplinary area at the intersection of logic, computer science, and mathematics. This volume contains selected papers presented at the International Symposium on Domain Theory which took place in Shanghai in October 1999. Topics of papers range from the encounters between topology and domain theory, sober spaces, Lawson topology, real number computability and continuous functionals to fuzzy modelling, logic programming, and pi-calculi. This book is a valuable reference for researchers and students interested in this rapidly developing area of theoretical computer science.