1117 search results - page 130 / 224 » Partial Models of Extended Generalized Logic Programs |
HIPC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
DOCENG
2009
ACM
15 years 8 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
107
click to vote
ISSTA
2004
ACM
15 years 6 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
119
click to vote
TKDE
2010
14 years 8 months ago
2010
We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-bas...
111
click to vote
OOPSLA
2004
Springer
15 years 6 months ago
2004
Springer
This demonstration will feature overviews of the C-SAW and GenAWeave projects. The first half of the presentation will introduce the concept of two-level aspect weaving, which uni...