Sciweavers

151 search results - page 3 / 31
» Logical and algorithmic properties of stable conditional ind...
Sort
View
CSL
2005
Springer
13 years 11 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
AAAI
1996
13 years 7 months ago
Irrelevance and Conditioning in First-Order Probabilistic Logic
First-order probabilistic logic is a powerful knowledge representation language. Unfortunately, deductive reasoning based on the standard semantics for this logic does not support...
Daphne Koller, Joseph Y. Halpern
ICLP
1999
Springer
13 years 10 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski
QUESTA
2008
382views more  QUESTA 2008»
13 years 5 months ago
A note on stable flow-equivalent aggregation in closed networks
We introduce the Conditional Mean Value Analysis (CMVA) algorithm, an exact solution method for product-form load-dependent closed queueing networks that provides a numerically st...
Giuliano Casale
EUSFLAT
2009
100views Fuzzy Logic» more  EUSFLAT 2009»
13 years 3 months ago
Some Results on Lipschitz Quasi-Arithmetic Means
We present in this paper some properties of k-Lipschitz quasi-arithmetic means. The Lipschitz aggregation operations are stable with respect to input inaccuracies, what is a very i...
Gleb Beliakov, Tomasa Calvo, Simon James