Sciweavers

124 search results - page 16 / 25
» Automata can show PSpace results for description logics
Sort
View
LICS
2009
IEEE
14 years 2 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
KR
2000
Springer
13 years 11 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
FPGA
1997
ACM
118views FPGA» more  FPGA 1997»
13 years 11 months ago
Module Generation of Complex Macros for Logic-Emulation Applications
Logic emulation is a technique that uses dynamically reprogrammable systems for prototyping and design veri cation. Using an emulator, designers can realize designs through a soft...
Wen-Jong Fang, Allen C.-H. Wu, Duan-Ping Chen
PODS
2010
ACM
181views Database» more  PODS 2010»
14 years 22 days ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick