Sciweavers

64 search results - page 9 / 13
» Equational Axioms of Test Algebra
Sort
View
CADE
2008
Springer
14 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ESA
2004
Springer
139views Algorithms» more  ESA 2004»
14 years 28 days ago
Comparing Real Algebraic Numbers of Small Degree
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
Ioannis Z. Emiris, Elias P. Tsigaridas
CORR
1999
Springer
124views Education» more  CORR 1999»
13 years 7 months ago
An Algebraic Programming Style for Numerical Software and its Optimization
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds,scalar fields, tensors, and the like, but these algebraic structures a...
T. B. Dinesh, Magne Haveraaen, Jan Heering
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 28 days ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
KBSE
2003
IEEE
14 years 24 days ago
Specification and Synthesis of Hybrid Automata for Physics-Based Animation
Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete varia...
Thomas Ellman