2035 search results - page 11 / 407 » On the complexity of stratified logics |
141
click to vote
CORR
2008
Springer
15 years 16 days ago
2008
Springer
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
109
Voted
AIML
2004
15 years 1 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
80
Voted
ECCC
2006
15 years 14 days ago
2006
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
101
Voted
TIME
2005
IEEE
15 years 6 months ago
2005
IEEE
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
CSL
2008
Springer
15 years 2 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...