4117 search results - page 343 / 824 » On the Satisfiability of Complex Constraints |
162
Voted
FOSSACS
2006
Springer
15 years 10 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...
147
Voted
ACL
2004
15 years 8 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...
163
Voted
CORR
2010
Springer
15 years 7 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 ...
195
Voted
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
242
click to vote
ICFP
2012
ACM
13 years 9 months ago
2012
ACM
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...