36 search results - page 7 / 8 » Completeness and Compactness of Quantitative Domains |
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
ATAL
2008
Springer
13 years 9 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...
CANDC
2004
ACM
13 years 7 months ago
2004
ACM
We have addressed the distribution and abundance of 75 transcription factor (TF) families in complete genomes from 90 different bacterial and archaeal species. We found that the p...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...