Let G=(V, E) be an n-vertex directed acyclic graph (DAG). A lowest common ancestor (LCA)
of two vertices u and v is a common ancestor w of u and v such that no descendant of w has …

One of the basic challenges in developing structural methods for systematic audition on the
quality of biomedical ontologies is the computational cost usually involved in exhaustive sub …

We consider a new variant of the Knapsack Problem with dependencies between items. In
this variant, the set of items is partitioned into subsets with dependencies among them, and …

This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a
generalization of the well-known Conjunctive Normal Form (CNF) where literals are …

Software systems or programs and their properties are often represented by directed or
undirected graphs. However, for these systems to be dependable and trusted, special …

Abstract Order-Sorted Feature (OSF) logic is a Knowledge Representation and Reasoning
(KRR) language originating in Hassan Aït-Kaci's work on designing a calculus of partially …

The book synthesizes research on the analysis of biomedical ontologies using formal
concept analysis, including through auditing, curation, and enhancement. As the evolution of …

Motivation. Ontologies in general, biomedical ontologies in particular, cover a vast range of
topics from philosophical to practical and from principles to applications. This book …

Comparing genomes based on the order of genes provides insights into their evolutionary
history and further allows to identify sets of genes with associated function. In the past two …

There is a large family of graph and geometric problems for which the best known algorithms
use fast matrix multiplication and their complexity is between nω and n3. We call them …