Sciweavers

887 search results - page 75 / 178
» A Science of Reasoning
Sort
View
LICS
2009
IEEE
14 years 3 months ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
LICS
2009
IEEE
14 years 3 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
LICS
2007
IEEE
14 years 3 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
LICS
2006
IEEE
14 years 3 months ago
On Tractability and Congruence Distributivity
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
Emil W. Kiss, Matthew Valeriote
LICS
2005
IEEE
14 years 2 months ago
Eager Normal Form Bisimulation
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
Soren Lassen