3693 search results - page 488 / 739 » Splitting a Logic Program |
124
click to vote
CORR
2011
Springer
14 years 10 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...
158
Voted
SIGSOFT
2007
ACM
16 years 4 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...
131
Voted
ADC
1999
Springer
15 years 7 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 ...
115
Voted
CADE
2003
Springer
16 years 3 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...
142
Voted
CADE
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...