504 search results - page 31 / 101 » The Complexity of Symmetry-Breaking Formulas |
AAAI
1998
13 years 11 months ago
1998
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
ENTCS
2006
13 years 10 months ago
2006
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
JAR
2006
13 years 9 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
MCS
2007
Springer
13 years 9 months ago
2007
Springer
Using standard calculus, explicit formulas for the one-dimensional continuous and discrete homotopy operators are derived. It is shown that these formulas are equivalent to those ...
FORMATS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...