504 search results - page 39 / 101 » The Complexity of Symmetry-Breaking Formulas |
124
click to vote
LMCS
2007
15 years 4 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
178
Voted
SIAMCOMP
2010
15 years 2 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
113
click to vote
AIML
2004
15 years 5 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
176
click to vote
MM
2003
ACM
15 years 9 months ago
2003
ACM
This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes bot...
128
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...