We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
We describe the combination of OWL and F-Logic for the architecture of Semantic Web application nodes. The approach has been implemented by combining an existing Jena-based archite...
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...
The IA-64 architecture defers floating point and integer division to software. To ensure correctness and maximum efficiency, Intel provides a number of recommended algorithms which...
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...