Sciweavers

1274 search results - page 147 / 255
» New Proofs for
Sort
View
JAIR
2006
102views more  JAIR 2006»
15 years 5 months ago
Set Intersection and Consistency in Constraint Networks
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
Yuanlin Zhang, Roland H. C. Yap
MICS
2008
63views more  MICS 2008»
15 years 5 months ago
Unambiguous Automata
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second o...
Marie-Pierre Béal, Eugen Czeizler, Jarkko K...
MOR
2008
110views more  MOR 2008»
15 years 5 months ago
On the Low Rank Solutions for Linear Matrix Inequalities
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was sh...
Wenbao Ai, Yongwei Huang, Shuzhong Zhang
JSYML
2006
85views more  JSYML 2006»
15 years 5 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares
IANDC
2007
106views more  IANDC 2007»
15 years 5 months ago
Tyrolean termination tool: Techniques and features
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
Nao Hirokawa, Aart Middeldorp