Sciweavers

371 search results - page 49 / 75
» Partition Theorems and Computability Theory
Sort
View
KR
2010
Springer
15 years 2 months ago
Decomposing Description Logic Ontologies
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed ...
Boris Konev, Carsten Lutz, Denis Ponomaryov, Frank...
ICCS
1995
Springer
15 years 1 months ago
Syntax, Semantics, and Pragmatics of Contexts
Thenotion of context is indispensable in discussions of meaning,but the wordcontext has often beenusedin conflicting senses. In logic, the first representation of contextas a forma...
John F. Sowa
74
Voted
PPOPP
2010
ACM
15 years 7 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
JACM
2010
116views more  JACM 2010»
14 years 8 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
CONCUR
2009
Springer
15 years 4 months ago
Weighted Bisimulation in Linear Algebraic Form
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
Michele Boreale