778 search results - page 57 / 156 » Expressiveness and complexity of graph logic |
94
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
215
click to vote
POPL
2004
ACM
16 years 26 days ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
111
Voted
ICCS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
103
click to vote
OOPSLA
2010
Springer
14 years 11 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
102
Voted
DFG
2007
Springer
15 years 6 months ago
2007
Springer
: To better understand how developmental regulatory networks are defined in the genome sequence, the Berkeley Drosophila Transcription Network Project (BDNTP) has developed a suit...