211 search results - page 1 / 43 » Ground Reducibility is EXPTIME-Complete |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
EMNLP
2011
12 years 7 months ago
2011
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...