66 search results - page 7 / 14 » Bounded Model Construction for Monadic Second-Order Logics |
107
click to vote
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
KI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
183
click to vote
POPL
2006
ACM
16 years 18 hour ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
114
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...