Sciweavers

55 search results - page 9 / 11
» Pomset Languages of Finite Step Transition Systems
Sort
View
TABLEAUX
2005
Springer
14 years 29 days ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
SCP
1998
163views more  SCP 1998»
13 years 7 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
ATAL
2003
Springer
14 years 21 days ago
Authoring scenes for adaptive, interactive performances
In this paper, we introduce a toolkit called SceneMaker for authoring scenes for adaptive, interactive performances. These performances are based on automatically generated and pr...
Patrick Gebhard, Michael Kipp, Martin Klesen, Thom...
ICALP
2009
Springer
14 years 7 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
DOCENG
2007
ACM
13 years 11 months ago
A document engineering environment for clinical guidelines
In this paper, we present a document engineering environment for Clinical Guidelines (G-DEE), which are standardized medical documents developed to improve the quality of medical ...
Gersende Georg, Marie-Christine Jaulent