7988 search results - page 159 / 1598 » A Useful Undecidable Theory |
113
click to vote
CAV
2008
Springer
15 years 2 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
122
Voted
SCM
2003
15 years 2 months ago
2003
Individual organisations as well as industry consortia are currently defining application and domain-specific languages using the eXtended Markup Language (XML) standard of the W...
108
Voted
JAR
2007
15 years 19 days ago
2007
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
109
Voted
TCS
1998
15 years 12 days ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
94
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...