3983 search results - page 536 / 797 » Conceptual logic programs |
133
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 ...
121
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...
148
click to vote
CADE
2002
Springer
16 years 4 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 ...
136
Voted
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
126
click to vote
CADE
2009
Springer
15 years 10 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...