Sciweavers

530 search results - page 73 / 106
» The Valid Model Semantics for Logic Programs
Sort
View
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 7 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
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...
Maria Paola Bonacina, Jieh Hsiang
IDA
2005
Springer
14 years 1 months ago
Combining Bayesian Networks with Higher-Order Data Representations
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
Elias Gyftodimos, Peter A. Flach
FLOPS
2008
Springer
13 years 9 months ago
Rewriting and Call-Time Choice: The HO Case
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...
Francisco Javier López-Fraguas, Juan Rodr&i...
PODS
2005
ACM
147views Database» more  PODS 2005»
14 years 7 months ago
Peer data exchange
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...
Ariel Fuxman, Phokion G. Kolaitis, Renée J....
SPIN
2004
Springer
14 years 1 months ago
Model-Driven Software Verification
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...
Gerard J. Holzmann, Rajeev Joshi