Sciweavers

567 search results - page 69 / 114
» Probabilistic Reasoning With Answer Sets
Sort
View
ICLP
2004
Springer
15 years 3 months ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
CORR
2000
Springer
88views Education» more  CORR 2000»
14 years 9 months ago
The lexicographic closure as a revision process
The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e...
Richard Booth
LOPSTR
1994
Springer
15 years 1 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
15 years 4 months ago
Granularity Conscious Modeling for Probabilistic Databases
The convergence of embedded sensor systems and stream query processing suggests an important role for database techniques, in managing data that only partially – and often inacc...
Eirinaios Michelakis, Daisy Zhe Wang, Minos N. Gar...
ICCSA
2003
Springer
15 years 2 months ago
A Probabilistic Model for Predicting Software Development Effort
—Recently, Bayesian probabilistic models have been used for predicting software development effort. One of the reasons for the interest in the use of Bayesian probabilistic model...
Parag C. Pendharkar, Girish H. Subramanian, James ...