2853 search results - page 315 / 571 » On Coherence in Computer Algebra |
115
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
131
Voted
KI
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
131
click to vote
KBSE
2000
IEEE
15 years 9 months ago
2000
IEEE
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...
125
click to vote
AAECC
1993
Springer
15 years 8 months ago
1993
Springer
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...
163
click to vote
COCO
1993
Springer
15 years 8 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...