530 search results - page 73 / 106 » The Valid Model Semantics for Logic Programs |
168
click to vote
NGC
1998
Springer
15 years 5 months ago
1998
Springer
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
215
click to vote
IDA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
151
click to vote
FLOPS
2008
Springer
15 years 7 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
173
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...
179
click to vote
SPIN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...