1071 search results - page 65 / 215 » Theories of Automatic Structures and Their Complexity |
BMCBI
2006
13 years 8 months ago
2006
Background: Successful realization of a "systems biology" approach to analyzing cells is a grand challenge for our understanding of life. However, current modeling appro...
SAS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
BSL
2000
13 years 8 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
In e-commerce, for some cases the service requested by the consumer cannot be fulfilled by the producer. In such cases, service consumers and producers need to negotiate their ser...
ENTCS
2006
13 years 8 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...