Sciweavers

169 search results - page 4 / 34
» Abstract Interpretation of Algebraic Polynomial Systems (Ext...
Sort
View
RTA
2005
Springer
14 years 28 days ago
Universal Algebra for Termination of Higher-Order Rewriting
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
Makoto Hamana
AML
2005
104views more  AML 2005»
13 years 7 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
CSL
2008
Springer
13 years 9 months ago
On Counting Generalized Colorings
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
Tomer Kotek, Johann A. Makowsky, Boris Zilber
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 7 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas