Full Text Available
Access Full Text at Repository
Search Results - Information Science
-
Ground interpolation for the theory of equality
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
On completeness of reducibility candidates as a semantics of strong normalization
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
A type reduction theory for systems with replicated components
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Published in Logical Methods in Computer Science (2012)Subjects: “…Computer Science & Information Science…”
Get full text
-
A note on the expressive power of linear orders
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Timed Parity Games: Complexity and Robustness
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Rooted Phylogeny Problems
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Proof-irrelevant model of CC with predicative induction and judgmental equality
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
A decidable characterization of locally testable tree languages
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computational Models of Certain Hyperspaces of Quasi-metric Spaces
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Power of Randomization in Automata on Infinite Strings
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Formalization of Abstract State Transition Systems for SAT
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Nested Hoare Triples and Frame Rules for Higher-order Store
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Kripke Semantics for Martin-Löf's Extensional Type Theory
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text