66 search results - page 7 / 14 » Bounded Model Construction for Monadic Second-Order Logics |
121
click to vote
LPAR
2010
Springer
14 years 11 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...
120
click to vote
KI
2008
Springer
15 years 1 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 ...
211
click to vote
POPL
2006
ACM
16 years 2 months 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...
113
click to vote
FOCS
2009
IEEE
15 years 8 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...
131
click to vote
CORR
2011
Springer
14 years 8 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...