4513 search results - page 463 / 903 » Logic programming with satisfiability |
306
click to vote
ICFP
2009
ACM
16 years 6 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
261
click to vote
POPL
2005
ACM
16 years 6 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...
270
click to vote
POPL
2003
ACM
16 years 6 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...
154
click to vote
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
Programming paradigms are often skewed towards a particular domain of problems, thus one effective way to utilize them is through a multiparadigm approach to software development....
179
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...