Sciweavers

555 search results - page 97 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
DEXA
2010
Springer
180views Database» more  DEXA 2010»
13 years 8 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...
ECAI
2010
Springer
13 years 8 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
LOGCOM
2007
97views more  LOGCOM 2007»
13 years 7 months ago
Termination for Hybrid Tableaus
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
Thomas Bolander, Patrick Blackburn
ANSOFT
2002
171views more  ANSOFT 2002»
13 years 7 months ago
OPM/Web - Object-Process Methodology for Developing Web Applications
Web applications can be classified as hybrids between hypermedia and information systems. They have a relatively simple distributed architecture from the user viewpoint, but a comp...
Iris Reinhartz-Berger, Dov Dori, Shmuel Katz
ASPLOS
2006
ACM
14 years 1 months ago
Supporting nested transactional memory in logTM
Nested transactional memory (TM) facilitates software composition by letting one module invoke another without either knowing whether the other uses transactions. Closed nested tr...
Michelle J. Moravan, Jayaram Bobba, Kevin E. Moore...