A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This is evidence that using logic variables in distributed computing is bene cial at both the system and language levels. ... We present common distributed programming idioms in a network-transparent w ay using logic variables. ... Finally, we thank the referees for comments that let us vastly improve the presentation. ...doi:10.1145/319301.319347 fatcat:vnftjt5i2jhpdeblvfhddchpbu
Unlike the fault tree, this structure allows for dependence among the basic events and replicated logical elements. A heuristic procedure is developed for efficient processing of these structures. ... The generalized fault diagram, a data structure for failure analysis based on the influence diagram, is defined. ... In this present work based on Bertrand (1986) , we restrict ourselves to the unconditional distribution for a variable of interest, so that we can concentrate on efficient evaluation. ...arXiv:1304.2758v1 fatcat:4hv44j5aejd7po2jaq7lfvvqci
Summary: “We propose a framework of distributed concur- rent linear logic programming, which can elegantly capture the essential features of distributed computation: location- dependence/independence of ... As a result, logic programs can now run more efficiently. ...
Lecture Notes in Computer Science
This paper investigates inference algorithms for CP-logic; these are crucial for developing learning algorithms. ... It proposes a new CP-logic inference method based on contextual variable elimination and compares this method to variable elimination and to methods based on binary decision diagrams. ... The probability distribution for this variable is represented by multiple confactors. The context of one confactor represents the case that the body is true. ...doi:10.1007/978-3-642-13840-9_10 fatcat:pb4qvdphrfcjtnyzscxynxtkbe
First, it can be used to compute the logical influence weight of each variable in the formula, which is a metric that shows the importance of the variable in affecting the outcome of the formula. ... This paper presents a new technique for optimizing formal analysis of propositional logic formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification table. ... We first need to compute the logical influence weight of each variable in the formula. This can be computed by constructing a progression table for the formula ϕ. ...arXiv:1810.13129v1 fatcat:uf7xmvubgnc47prim6kjmc2hxq
Lecture Notes in Computer Science
In this paper, we propose VB for logic-based probabilistic models and show that our proposed method is efficient in evaluating abductive explanations about failure in a logic circuit and a metabolic pathway ... Statistical abduction is an attempt to define a probability distribution over explanations derived by abduction and to evaluate them using their probabilities. ... A PBPM p(b|θ) is a joint distribution over boolean random variables b and defines probabilities for any boolean formulas. ...doi:10.1007/978-3-642-31951-8_19 fatcat:mdfrcgtiwbe7nfyfoas5b4fa5a
Lecture Notes in Computer Science
Moreover, constraints can be executed concurrently which provides for concurrent computation threads that are synchronized on logical variables. ... In particular, sending partially instantiated messages containing logical variables is quite useful to implement reply messages. ... The author is grateful to Frank Steiner and Philipp Niederau for many discussions and comments on this paper and for providing the implementation of the talk program. ...doi:10.1007/10704567_11 fatcat:mhlkxwibtffo7in2jbinjfyklm
The mpF programming language, which is an extension of Fortran 90 for parallel systems with distributed memory, is described. ... The efficiency of programs written in mpF and in C with the calls of MPI functions is compared. ... ., a programmer is responsible for the distribution of data, computations, and communications. The main advantages of this approach are the efficiency and high expressive power. ...doi:10.1023/b:pacs.0000036419.39158.fe fatcat:tuqt6zakgjbt5ixatryng56r3m
A stochastic data modulation scheme minimizes on-chip capacitance variability maintaining clock oscillations near resonance. ... The 1.9µm × 9µm 3T NMOS unit cell with single-wire pitch multiplexed bit/compute line provides charge-conserving 1b-1b multiplication and single-wire analog accumulation. ... The 0.35-µm CMOS adiabatic computational array integrated prototype delivers 1.1 TMACS for every mW of power for worst case data distribution. ...doi:10.1109/cicc.2007.4405804 dblp:conf/cicc/KarakiewiczGC07 fatcat:t6lfucj2inchjm2fk5rcjtdd5i
The project is actually helpful for a modern barber shop in which a close inspection is needed. ... Normal Distribution Function Normal distribution  , also called Gaussian distribution is the most common distribution function for independent, randomly generated variables. ... Figure 7 shows the efficiency of the system. The calculation of random variable (number of people arrival in this case) is done using normal distribution function. ...doi:10.14569/ijacsa.2012.030212 fatcat:k4rli6ygyfevfenhbw7we67rfu
We show that tractable inference in probabilistic models with high treewidth and millions of variables can be understood using the notion of finite (partial) exchangeability. ... An analogous argument holds for MPE inference on Pr(Y). We now need to identify distributions Pr(Y, Z) for which we can compute Pr(y) efficiently. ... For a set of variables X, we say that P (x) can be computed efficiently iff it can be computed in time polynomial in |X|. We make the following complexity claims Theorem 2. ...arXiv:1401.1247v2 fatcat:2o4qjxwn5fhllnreqnyzrbw2ae
Furthermore we show that the resulting model supports modularization of computations, which allows for efficient decentralized processing. ... To address these challenges we propose the use of causal Bayesian Networks for probabilistic reasoning and introduce the Logical OR gate in order to combine them with dynamic processes estimated by arbitrary ... In the discretized setting, the distribution over the binary variable is computed for a specific location and time, i.e. ...doi:10.5220/0005768601340142 dblp:conf/iceis/ClaessensWVPPT16 fatcat:af3tvvkc6ndapdx4seslp4bs5m
Temperature variables are represented as the form of color distribution images. ... There is a growing need for intelligent energy-efficient control of air conditioning systems. ... Since we take only three control variables in our fuzzy logic, the computational burden is not that much of an issue. ...doi:10.14257/ijca.2016.9.2.13 fatcat:rdzq3pgczfd7pk2boiaqgfcewm
., in First Annual IEEE Symposium on Logic in Computer Science (Cambridge, MA, 1986), 206-216, IEEE Comput. Soc. ... (English summary) Constraints in computational logics (Munich, 1994), 136-151, Lecture Notes in Comput. Sci., 845, Springer, Berlin, 1994. ...
Studies in Computational Intelligence
However, it has been shown  that the computation for solving general distributed MDPs is intractable. ... for firing the necessary logic rules. ...doi:10.1007/978-3-540-76829-6_11 fatcat:ektide27rjdenhsi6xg6koj4ka
« Previous Showing results 1 — 15 out of 341,467 results