8094 search results - page 66 / 1619 » Improvements in Formula Generalization |
OL
2011
13 years 4 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
AIML
2008
13 years 10 months ago
2008
We provide proof-theoretic results about deliberative STIT logic. First we present STIT logic for individual agents without time, where the problem of satisfiability has recently b...
COMBINATORICS
2006
13 years 9 months ago
2006
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...