Sciweavers

2152 search results - page 82 / 431
» On Automating the Calculus of Relations
Sort
View
126
Voted
DLOG
2001
15 years 2 months ago
Combining Tableaux and Algebraic Methods for Reasoning with Qualified Number Restrictions
This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...
Volker Haarslev, Martina Timmann, Ralf Möller
DLOG
2010
14 years 10 months ago
Orel: Database-Driven Reasoning for OWL 2 Profiles
We describe Orel, a reasoning system for an ontology language which subsumes both the EL and the RL profile of the recently standardised web ontology language OWL 2. Orel performs ...
Markus Krötzsch, Anees Mehdi, Sebastian Rudol...
98
Voted
AIIDE
2008
15 years 3 months ago
Recombinable Game Mechanics for Automated Design Support
Systems that provide automated game-design support-whether fully automated game generators, or tools to assist human designers--must be able to maintain a representation of a game...
Mark J. Nelson, Michael Mateas
105
Voted
TCS
2008
15 years 18 days ago
Semantic subtyping for the pi-calculus
Subtyping relations for the -calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to d...
Giuseppe Castagna, Rocco De Nicola, Daniele Varacc...
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 5 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt