Sciweavers

3032 search results - page 568 / 607
» Description Logic Rules
Sort
View
STACS
2007
Springer
14 years 3 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
MIDDLEWARE
2007
Springer
14 years 3 months ago
Combining ontology queries with key word search in the GloServ service discovery system
GloServ is a global service discovery system which aggregates different types of services in a globally distributed network. It improves on current service discovery systems by sc...
Knarig Arabshian, Henning Schulzrinne
OOPSLA
2007
Springer
14 years 3 months ago
A rewriting approach to the design and evolution of object-oriented languages
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
Mark Hills, Grigore Rosu
SPIN
2007
Springer
14 years 3 months ago
Tutorial: Parallel Model Checking
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
Lubos Brim, Jiri Barnat