Sciweavers

2022 search results - page 203 / 405
» Complexity of Non-Monotonic Logics
Sort
View
FOSSACS
2007
Springer
16 years 20 days ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
FPL
2007
Springer
176views Hardware» more  FPL 2007»
16 years 20 days ago
ReconOS: An RTOS supporting Hard- and Software Threads
Modern platform FPGAs integrate fine-grained reconfigurable logic with processor cores and allow the creation of complete configurable systems-on-chip. However, design methodol...
Enno Lübbers, Marco Platzner
ICALP
2007
Springer
16 years 20 days ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
RR
2007
Springer
16 years 19 days ago
Evaluating Formalisms for Modular Ontologies in Distributed Information Systems
Modern semantic technology is one of the necessary supports for the infrastructure of next generation information systems. In particular, large international organizations, which u...
Yimin Wang, Jie Bao, Peter Haase, Guilin Qi
DDECS
2006
IEEE
79views Hardware» more  DDECS 2006»
16 years 17 days ago
Multiple-Vector Column-Matching BIST Design Method
- Extension of a BIST design algorithm is proposed in this paper. The method is based on a synthesis of a combinational block - the decoder, transforming pseudo-random code words i...
Petr Fiser, Hana Kubatova