Sciweavers

228 search results - page 12 / 46
» A Theory of Restrictions for Logics and Automata
Sort
View
LATIN
2010
Springer
14 years 3 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
PODS
2010
ACM
181views Database» more  PODS 2010»
14 years 1 months 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
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 8 months ago
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These ...
Dietrich Kuske
IANDC
2008
122views more  IANDC 2008»
13 years 8 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
14 years 23 days ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani