Results 111 to 120 of about 90,486 (306)

On Probabilistic Alternating Simulations [PDF]

arXiv, 2010
This paper presents simulation-based relations for probabilistic game structures. The first relation is called probabilistic alternating simulation, and the second called probabilistic alternating forward simulation, following the naming convention of Segala and Lynch. We study these relations with respect to the preservation of properties specified in
arxiv  

Probabilistic-Logical Modeling of Music [PDF]

, 2005
PRISM is a probabilistic-logical programming language based on Prolog. We present a PRISM-implementation of a general model for polyphonic music, based on Hidden Markov Models. Its probability parameters are automatically learned by running the built-in EM-algorithm of PRISM on training examples.
Sneyers, Jon, Vennekens, Joost, De Schreye, Danny   +2 more
openaire   +3 more sources

Integrating Aggregate Materials and Machine Learning Algorithms: Advancing Detection of Pathogen‐Derived Extracellular Vesicles

Aggregate, EarlyView.
Pathogen‐derived extracellular vesicle detection: theoretical insights and advanced methodologies: This review explores the theoretical foundations and practical applications of pEV detection, emphasizing the challenges and innovative strategies involving novel aggregate materials and machine learning for enhanced diagnostic accuracy.
Lihan Lai, Yun Su, Cong Hu, Zehong Peng, Wei Xue, Liang Dong, Tony Y. Hu   +6 more
wiley   +1 more source

Meta-analysis of the functional neuroimaging literature with probabilistic logic programming. [PDF]

Sci Rep, 2022
Abdallah M, Iovene V, Zanitti G, Wassermann D.   +3 more
europepmc   +1 more source

Autonomous Behavior Selection For Self-driving Cars Using Probabilistic Logic Factored Markov Decision Processes

Applied Artificial Intelligence
We propose probabilistic logic factored Markov decision processes (PL-fMDPs) as a behavior selection scheme for self-driving cars. Probabilistic logic combines logic programming with probability theory to achieve clear, rule-based knowledge descriptions ...
Héctor Avilés, Marco Negrete, Alberto Reyes, Rubén Machucho, Karelly Rivera, Gloria de-la-Garza, Alberto Petrilli   +6 more
doaj   +1 more source

Generalized optimization framework for synthesis of thermally coupled distillation columns

AIChE Journal, EarlyView.
Abstract In this article, a generalized optimization framework is proposed for the synthesis of thermally coupled distillation systems within an equation‐oriented environment. The proposed framework consists of three components: an efficient superstructure representation, a novel mathematical formulation, and the associated solution algorithm ...
Chao Liu, Yingjie Ma, Jie Li
wiley   +1 more source

Quantitative Logic Reasoning [PDF]

In W. Carnielli and J. Malinowski, editors, Contradictions, from Consistency to Inconsistency, Trends in Logic, pages 241-272. Springer International Publishing, 2018, 2019
In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous properties hold throughout that class, for whose members there exists a set of linear algebraic techniques ...
arxiv  

Optimal reactive operation of general topology supply chain and manufacturing networks under disruptions

AIChE Journal, EarlyView.
Abstract Supply and manufacturing networks in the chemical industry involve diverse processing steps across different locations, rendering their operation vulnerable to disruptions from unplanned events. Optimal responses should consider factors such as product allocation, delayed shipments, and price renegotiation, among other factors. In such context,
Daniel Ovalle, Joshua L. Pulsipher, Yixin Ye, Kyle Harshbarger, Scott Bury, Carl D. Laird, Ignacio E. Grossmann   +6 more
wiley   +1 more source

Model-checking branching-time properties of probabilistic automata and probabilistic one-counter automata [PDF]

arXiv, 2015
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL$^*$). We show that it is undecidable for these problems. We first show, by reducing to emptiness problem of probabilistic automata, that the model-checking of ...
arxiv  

Expressive probabilistic description logics

Artificial Intelligence, 2008
AbstractThe work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role in the development of the Semantic Web, since they provide a precise definition of shared terms in web resources.
openaire   +3 more sources