Abstract We present two approaches to investigate the validity of connexive principles and related formulas properties within coherence-based probability logic. Connexive logic emerged from intuition that conditionals form if not - A , then should hold, since conditional’s antecedent contradicts its consequent . Our cover this by observing only coherent assessment on conditional event $${A| \ov...

The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...

PACSR, a probabilistic extension of the real-time process algebra ACSR, is presented. The extension is built upon a novel treatment of the notion of a resource. In ACSR, resources are used to model contention in accessing physical devices. Here, resources are invested with the ability to fail and are associated with a probability of failure. The resulting formalism allows one to perform probabi...

A lot of attention has been devoted to probabilistic methods for discovering semantic mappings between ontologies. Despite impressive theory foundation, these methods usually require massive data instances to learn the mappings, which are not always available in practice. In this paper we present the Probabilistic Description Logic based Ontology Matcher (PDLOM) for discovering such mappings us...

In this paper we provide a general, unifying framework for probabilistic belief revision. We first introduce a probabilistic logic called p-logic that is capable of representing and reasoning with basic probabilistic information. With p-logic as the background logic, we define a revision function called p-revision that resembles partial meet revision in the AGM framework. We provide a represent...

Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we add the third usage of tabling, i.e. to make infinite computation possible for probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for PCFGs to probabilistic logi...