Sciweavers

322 search results - page 63 / 65
» Practical Reasoning for Expressive Description Logics
Sort
View
CADE
2001
Springer
14 years 10 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
IJBRA
2007
120views more  IJBRA 2007»
13 years 9 months ago
The myGrid ontology: bioinformatics service discovery
: In this paper we explore issues in the development of the my Grid ontology, which is an OWL ontology designed to support service discovery through service annotation. There are c...
Katy Wolstencroft, Pinar Alper, Duncan Hull, Chris...
TOSEM
2002
118views more  TOSEM 2002»
13 years 9 months ago
Modeling software architectures in the Unified Modeling Language
Abstract. The Unified Modeling Language (UML) is a family of design notations that is rapidly becoming a de facto standard software design language. UML provides a variety of usefu...
Nenad Medvidovic, David S. Rosenblum, David F. Red...
CADE
2005
Springer
14 years 10 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard