2035 search results - page 199 / 407 » On the complexity of stratified logics |
149
click to vote
CIE
2007
Springer
16 years 20 days ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
186
click to vote
CSL
2007
Springer
16 years 20 days ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
171
click to vote
FOSSACS
2007
Springer
16 years 20 days ago
2007
Springer
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...
187
click to vote
FPL
2007
Springer
16 years 20 days ago
2007
Springer
Modern platform FPGAs integrate fine-grained reconfigurable logic with processor cores and allow the creation of complete configurable systems-on-chip. However, design methodol...
185
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
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...