778 search results - page 23 / 156 » Expressiveness and complexity of graph logic |
91
Voted
CSL
1999
Springer
15 years 4 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
103
Voted
WSC
2000
15 years 1 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
86
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
ISCA
1997
IEEE
15 years 4 months ago
1997
IEEE
The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, ...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...