The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
This paper describes the initial stages of building an ontology of bioinformatics and molecular biology. The conceptualisation is encoded using the Ontology Inference Layer (OIL),...
Robert Stevens, Carole A. Goble, Ian Horrocks, Sea...
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...