3691 search results - page 485 / 739 » Bayesian Logic Programs |
172
click to vote
ADC
1999
Springer
15 years 11 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 ...
169
click to vote
SIGECOM
2005
ACM
16 years 4 days ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
158
click to vote
CADE
2003
Springer
16 years 6 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...
193
click to vote
CADE
2002
Springer
16 years 6 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 ...
165
click to vote
VMCAI
2010
Springer
16 years 3 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...