2062 search results - page 12 / 413 » Derivatives of Logical Formulas |
RP
2009
Springer
14 years 4 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
DEON
2008
Springer
13 years 11 months ago
2008
Springer
In this paper we define a framework to introduce gradedness in Deontic logics through the use of fuzzy modalities. By way of example, we instantiate the framework to Standard Deont...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
ISSTA
2004
ACM
14 years 3 months ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
JAPLL
2010
13 years 8 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...