In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...

In the probabilistic track of the IPC5 —the last International Planning Competitions— a probabilistic planner based on combining deterministic planning with replanning —FF-REPLAN—outperformed the other competitors. This probabilistic planning paradigm discarded the probabilistic information of the domain, just considering for each action its nominal effect as a deterministic effect. Thus, in ce...

Humans often make accurate inferences given a single exposure to a novel situation. Some of these inferences can be achieved by discovering and using near-deterministic relationships between attributes. Approaches based on Bayesian networks are good at discovering and using soft probabilistic relationships between attributes, but typically fail to identify and exploit near-deterministic relatio...

A b s t r a c t In this paper, we briefly discuss the dynamic and functional approach to computer symbolic tensor analysis. The ccgrg package for Wolfram Language/Mathematica is used to illustrate this approach. Some examples of applications are attached.

In this article, we propose a fuzzy class relation assigning to each pair of finite fuzzy sets a degree to which they are equipollent, which indicates that they have the same number of elements. The concepts of fuzzy sets and fuzzy classes in the class of all countable sets are introduced, and several standard relations and constructions, such as the fuzzy power set and exponentiation, are defi...

This paper presents a deterministic approach for performance assessment of different province’s road safety level at Iran. A data envelopment analysis (DEA) model considering undesirable input and output indices and a multivariate statistical method, principle component analysis (PCA) are used in this paper, while previous studies do not use composite PCA-DEA method and undesirable input and ou...

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...

When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order to translate LTL to deterministic omega-automata, the traditional approach first translates the formula to a non-deterministic Büchi automaton. Then a determinization procedure such as of Safra is performed yielding a...