425 search results - page 37 / 85 » The TPS Theorem Proving System |
LOPSTR
2004
Springer
15 years 3 months ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— In this paper, we prove that a discrete-time switched linear system is exponentially stabilizable if and only if there exists a stationary hybrid-control law that consists of a...
HYBRID
2009
Springer
15 years 2 months ago
2009
Springer
This paper studies the exponential stabilization problem for discrete-time switched linear systems based on a control-Lyapunov function approach. A number of versions of converse c...
LPAR
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
SLOGICA
2002
14 years 9 months ago
2002
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose -free fragment is th...