Results 41 to 50 of about 181,566 (326)
“What if?” in Probabilistic Logic Programming
Theory and Practice of Logic Programming, 2023 AbstractA ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution, we extend this ProbLog language by the ability to answer “What if” queries. Intuitively, a ProbLog program defines a distribution by solving a system of equations in terms of mutually independent predefined Boolean random variables.
RAFAEL KIESEL +2 more
openaire +3 more sources
On-Line Surface Roughness Prediction by Using a Probabilistic Approach for End-Milling
IEEE Access, 2019 An effective and efficient methodology is proposed to predict surface roughness by online monitoring of surface quality using accelerometer signals. A probabilistic approach, Monte Carlo Simulation, was researched and developed to create an automated ...
Oguz Kayabasi, Senol Erturk
doaj +1 more source
Entropy, 2015 For conditional probabilistic knowledge bases with conditionals based on propositional logic, the principle of maximum entropy (ME) is well-established, determining a unique model inductively completing the explicitly given knowledge.
Christoph Beierle +2 more
doaj +1 more source
EXPTIME Tableaux for the Coalgebraic mu-Calculus [PDF]
Logical Methods in Computer Science, 2011 The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic.
Corina Cirstea +2 more
doaj +1 more source
Quantum Team Logic and Bell's Inequalities [PDF]
, 2015 A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4].
Hyttinen, Tapani +2 more
core +2 more sources
Weighted versus Probabilistic Logics [PDF]
, 2009 While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other ...
Gastin, Paul, Bollig, Benedikt
openaire +2 more sources
A Unified Approach to Semantic Information and Communication Based on Probabilistic Logic
IEEE Access, 2022 Traditionally, studies on technical communication (TC) are based on stochastic modeling and manipulation. This is not sufficient for semantic communication (SC) where semantic elements are logically connected, rather than stochastically correlated.
Jinho Choi, Seng W. Loke, Jihong Park
doaj +1 more source
Self-Organized Complexity and Coherent Infomax from the Viewpoint of Jaynes’s Probability Theory
Information, 2012 This paper discusses concepts of self-organized complexity and the theory of Coherent Infomax in the light of Jaynes’s probability theory. Coherent Infomax, shows, in principle, how adaptively self-organized complexity can be preserved and improved by ...
William A. Phillips
doaj +1 more source
Lifted Variable Elimination for Probabilistic Logic Programming
, 2014 Lifted inference has been proposed for various probabilistic logical frameworks in order to compute the probability of queries in a time that depends on the size of the domains of the random variables rather than the number of instances.
Bellodi, Elena +4 more
core +1 more source
Games, 2016 The modeling of awareness and unawareness is a significant topic in the doxastic logic literature, where it is usually tackled in terms of full belief operators. The present paper aims at a treatment in terms of partial belief operators.
Mikaël Cozic
doaj +1 more source