1313 search results - page 178 / 263 » Prioritized Reasoning in Logic Programming |
118
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
149
Voted
CADE
2004
Springer
16 years 4 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
224
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
229
Voted
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
166
Voted
TLDI
2010
ACM
15 years 3 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...