Sciweavers

425 search results - page 22 / 85
» The TPS Theorem Proving System
Sort
View
TPHOL
2005
IEEE
15 years 11 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 10 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
15 years 10 months ago
Input-to-state dynamical stability of interconnected systems
Abstract— We consider networks of input-to-state dynamically stable (ISDS) systems and provide a small gain condition under which the entire network is again ISDS. A Lyapunov for...
Sergey Dashkovskiy, Lars Naujok
CADE
2009
Springer
16 years 6 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
FUIN
2006
145views more  FUIN 2006»
15 years 5 months ago
Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
Linh Anh Nguyen