4513 search results - page 350 / 903 » Logic programming with satisfiability |
156
click to vote
TLDI
2009
ACM
16 years 1 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
143
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
113
click to vote
TPHOL
2003
IEEE
15 years 10 months ago
2003
IEEE
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
142
click to vote
JLP
2007
15 years 4 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
241
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...