778 search results - page 145 / 156 » Expressiveness and complexity of graph logic |
ERSHOV
2009
Springer
14 years 1 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
TLDI
2010
ACM
14 years 6 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
PEPM
2009
ACM
14 years 2 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
ASYNC
2000
IEEE
14 years 2 months ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
CATA
2001
13 years 11 months ago
2001
: In this paper we analyze some existing tools and approaches to image data modeling and we propose an Object-Oriented Image Data (OOID) model. It can be applied on a wide variety ...