cplint on SWISH: Probabilistic Logical Inference with a Web Browser

Abstract

cplint on SWISH is a web application that allows users to perform reasoning tasks on probabilistic logic programs. Both inference and learning systems can be performed: conditional probabilities with exact, rejection sampling and Metropolis-Hasting methods. Moreover, the system now allows hybrid programs, i.e., programs where some of the random variables are continuous. To perform inference on such programs likelihood weighting and particle filtering are used. cplint on SWISH is also able to sample goals' arguments and to graph the results. This paper reports on advances and new features of cplint on SWISH, including the capability of drawing the binary decision diagrams created during the inference processes.

Beyond subgoaling: A dynamic knowledge generation framework for creative problem solving in cognitive architectures

“…In this section, we describe the nonmonotonic Description Logic T CL that combines the semantics based on the rational closure of ALC + T R [16] Since the conceptual combination is usually expressed via natural language we consider the following common situations: in a combination ADJECTIVE -NOUN (for instance, red apple) the HEAD is represented by the NOUN (apple) and the modifier by the ADJECTIVE (red). In the more complex case of NOUN-NOUN combinations (for instance, pet fish) usually the HEAD is represented by the last expressed concept (fish in this case) 3 .…”

Studying Transaction Fees in the Bitcoin Blockchain with Probabilistic Logic Programming

“…A wide variety of domains [14][15][16] can be represented using Probabilistic Logic Programming (PLP) languages under the distribution semantics [17,18]. A program in a language adopting the distribution semantics defines a probability distribution over normal logic programs called instances or worlds.…”

“…The last three facts state that there is a fault rupture at stromboli, there is a volcanic eruption at stromboli, and there is a volcanic eruption at vesuvio, all three with certainty. We can now ask what the probability of a strong earthquake is at stromboli using cplint [15,16].…”

“…There are two types of inferences: exact inference and approximate inference. Both approximate and exact inference are implemented into cplint [15,16]. Exact inference tries to compute the exact probability of a query [23].…”

“…With Monte Carlo methods, we can also compute the probability of a query q given evidence e. This measure is called conditional probability and is usually indicated with P(q | e). Some of the most famous algorithms that perform conditional inference are the so-called Markov Chain Monte Carlo algorithms such as Metropolis-Hastings [16,27]. In this paper, we consider conditional probability queries where the evidence is on atoms that have discrete values.…”