Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
Deborah L. McGuinness, Pavel Shvaiko, Fausto Giunc...
Background: Formal classification of a large collection of protein structures aids the understanding of evolutionary relationships among them. Classifications involving manual ste...
Vichetra Sam, Chin-Hsien Tai, Jean Garnier, Jean-F...