1795 search results - page 163 / 359 » On the Complexity of Circuit Satisfiability |
171
click to vote
CAISE
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
206
click to vote
3DPVT
2006
IEEE
15 years 9 months ago
2006
IEEE
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that...
147
click to vote
FOSSACS
2006
Springer
15 years 9 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
132
Voted
ACL
2004
15 years 7 months ago
2004
This paper describes an empirical study of the "Information Synthesis" task, defined as the process of (given a complex information need) extracting, organizing and inte...
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...