Next Article in Journal
A Generic Model for Quantum Measurements
Previous Article in Journal
Optimization of Big Data Scheduling in Social Networks
Open AccessArticle

A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata

School of Computer Science, South China Normal University, Guangzhou 510631, China
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(9), 903; https://doi.org/10.3390/e21090903
Received: 25 July 2019 / Revised: 28 August 2019 / Accepted: 10 September 2019 / Published: 17 September 2019
In most previous research, “semantic computing” refers to computational implementations of semantic reasoning. It lacks support from the formal theory of computation. To provide solid foundations for semantic computing, researchers propose a different understanding of semantic computing based on finite automata. This approach provides a computer theoretical approach to semantic computing. But finite automata are not capable enough to deal with imprecise knowledge. Therefore, in this paper, we provide foundations for semantic computing based on probabilistic automata. Even though traditional probabilistic automata can handle imprecise knowledge, their limitation resides in their being defined on a fixed finite input alphabet. This deeply restricts the abilities of automata. In this paper, we rebuild traditional probabilistic automata for semantic computing. Furthermore, our new probabilistic automata are robust enough to handle any alphabet as input. They have better performances in many applications. We provide an application for weather forecasting, a domain for which traditional probabilistic automata are not effective due to their finite input alphabet. Our new probabilistic automata can overcome these limitations. View Full-Text
Keywords: probabilistic automata; probability distribution; related concept; semantic computing probabilistic automata; probability distribution; related concept; semantic computing
MDPI and ACS Style

Huang, G.; Wasti, S.H.; Wei, L.; Jiang, Y. A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata. Entropy 2019, 21, 903.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop