Probabilistic Embedding: Experiments with Tuple-based Probabilistic Languages

Stefano Mariani, Andrea Omicini

28th ACM Symposium on Applied Computing (SAC 2013), pages 1380-1382
18-22 March 2013

We introduce <i>probabilistic (modular) embedding</i> as an extension to the well-known notion of <i>modular embedding</i> conceived to capture the expressiveness of stochastic systems, focussing here on tuple-based probabilistic languages.

(keywords) Embedding, modular embedding, concurrent languages, coordination languages, probabilistic languages and systems, tuple-based languages

Events

CM @ SAC 2013 (18/03/2013–22/03/2013)

Publications

Home
Search
All

Publications / Views

Home

Clouds
• tags • authors • editors • journals

Year
• 2023 • 2022 • 2021 • 2020 • 2019 • 2018 • 2017 • 2016 • 2015 • 2014–1927

Sort
• in journal • in proc • chapters • books • edited • spec issues • editorials • entries • manuals • tech reps • phd th • others

Status
• online • in press • proof • camera-ready • revised • accepted • revision • submitted • draft • note

Services
• ACM Digital Library • DBLP • IEEE Xplore • IRIS • PubMed • Google Scholar • Scopus • Semantic Scholar • Web of Science • DOI

Publication

Probabilistic Embedding: Experiments with Tuple-based Probabilistic Languages

— authors

Stefano Mariani, Andrea Omicini

— status

published

— sort

paper in proceedings

— publication date

18-22 March 2013

— volume

28th ACM Symposium on Applied Computing (SAC 2013)

— pages

1380-1382

— address

Coimbra, Portugal

URLs

original page | original PDF

identifiers

— DOI

10.1145/2480362.2480621

— ACM

2480621

— IRIS

11585/134362

— Scopus

2-s2.0-84877995463

— print ISBN

978-1-4503-1656-9

notes

— note

Poster Paper