Sciweavers

650 search results - page 80 / 130
» On Coalgebras over Algebras
Sort
View
KI
2001
Springer
14 years 1 months ago
Experiments with an Agent-Oriented Reasoning System
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...
Christoph Benzmüller, Mateja Jamnik, Manfred ...
JMLC
1997
Springer
14 years 1 months ago
An Object-Oriented Database Programming Environment for Oberon
Abstract. We describe a system designed to provide database programming support for Oberon programmers. The system is based on a generic object-oriented data model which supports r...
Jacques Supcik, Moira C. Norrie
COCO
1989
Springer
110views Algorithms» more  COCO 1989»
14 years 28 days ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
Neil Immerman, Susan Landau
CONCUR
2006
Springer
14 years 18 days ago
On Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
Taolue Chen, Wan Fokkink
CIE
2006
Springer
13 years 10 months ago
Do Noetherian Modules Have Noetherian Basis Functions?
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
Peter Schuster, Júlia Zappe