Results 71 to 80 of about 189,472 (279)

Probabilistic regular graphs [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Christophe Morvan, Nathalie Bertrand
doaj   +1 more source

Undecidability of model-checking branching-time properties of stateless probabilistic pushdown process

open access: yes, 2020
In this paper, we settle a problem in probabilistic verification of infinite--state process (specifically, {\it probabilistic pushdown process}). We show that model checking {\it stateless probabilistic pushdown process} (pBPA) against {\it probabilistic
Lin, Tianrong
core  

Probabilistic logic programming

open access: yesInformation and Computation, 1992
The logic programming language for expressing a probabilistic information is proposed. \(P\)-programs are finite sets of clauses of a special kind: the head of a clause is an atomic formula loaded by a closed interval \([a,b]\), and the body is a set of formulae (not only atomic) which are loaded by closed intervals too. The formula \(F:[a,b]\) denotes
Ng, Raymond, Subrahmanian, V.S.
openaire   +2 more sources

In Situ Copper Electroplating Turns Material Extrusion 3D Printers Into Metal–Polymer Hybrid Fabricators

open access: yesAdvanced Materials Technologies, EarlyView.
An in situ electroplating approach for MEX 3D printing is proposed, enabling copper deposition during the fabrication of conductive polymers. The method combines a printer‐integrated plating head, ML‐based g‐code control, and stop‐and‐go printing, achieving near‐bulk copper conductivity and enabling fully embedded, assembly‐free electronic components ...
Gianluca Percoco   +5 more
wiley   +1 more source

Model Checking Probabilistic Timed Automata with One or Two Clocks [PDF]

open access: yesLogical Methods in Computer Science, 2008
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks.
Marcin Jurdzinski   +2 more
doaj   +1 more source

A Probabilistic Logic Programming Event Calculus

open access: yes, 2013
We present a system for recognising human activity given a symbolic representation of video content. The input of our system is a set of time-stamped short-term activities (STA) detected on video frames.
ALEXANDER ARTIKIS   +27 more
core   +1 more source

Nonmonotonic Probabilistic Logics between Model-Theoretic Probabilistic Logic and Probabilistic Logic under Coherence

open access: yes, 2002
Recently, it has been shown that probabilistic entailment under coherence is weaker than model-theoretic probabilistic entailment. Moreover, probabilistic entailment under coherence is a generalization of default entailment in System P. In this paper, we continue this line of research by presenting probabilistic generalizations of more sophisticated ...
openaire   +2 more sources

Weak nonmonotonic probabilistic logics

open access: yesArtificial Intelligence, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Magnetic Textiles: A Review of Materials, Fabrication, Properties, and Applications

open access: yesAdvanced Materials Technologies, EarlyView.
Magnetic textiles (M‐textiles) are emerging as a programmable materials platform that merges magnetic matter with hierarchical textile structures. This article consolidates magnetic material classes, textile architectures, and fabrication and magnetization strategies, revealing structure–property–function relationships that govern magneto‐mechanical ...
Li Ke   +3 more
wiley   +1 more source

Semantic Probabilistic Inference of Predictions

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2017
Prediction is one of the most important concepts in science. Predictions obtained from probabilistic knowledge, are described by an inductive-statistical inference (I-S inference).
E. E. Vityaev
doaj   +1 more source

Home - About - Disclaimer - Privacy