4513 search results - page 583 / 903 » Logic programming with satisfiability |
139
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
173
click to vote
TOSEM
2008
15 years 4 months ago
2008
Modern programs make extensive use of reusable software libraries. For example, a study of a number of large Java applications shows that between 17% and 30% of the classes in tho...
168
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
138
click to vote
ADC
1999
Springer
15 years 8 months ago
1999
Springer
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
122
click to vote
CADE
2003
Springer
16 years 4 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...