Sciweavers

2062 search results - page 16 / 413
» Derivatives of Logical Formulas
Sort
View
CP
2009
Springer
14 years 10 months ago
From Model-Checking to Temporal Logic Constraint Solving
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
Aurélien Rizk, François Fages
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 4 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
DAGSTUHL
2003
13 years 11 months ago
Generating Kummer Type Formulas for Hypergeometric Functions
Abstract. Kummer type formulas are identities of hypergeometric series. A symmetry by the permutations of n-letters yields these formulas. We will present an algorithmic method to ...
Nobuki Takayama
ACTA
1998
64views more  ACTA 1998»
13 years 9 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
ECCC
2006
41views more  ECCC 2006»
13 years 9 months ago
On a syntactic approximation to logics that capture complexity classes
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 ...
Argimiro Arratia, Carlos E. Ortiz