Abstract: The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1?
Abstract: Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer’s ...
Soroush Ebadian, Nisarg Shah Efficient Rectification of Neuro-Symbolic Reasoning Inconsistencies by Abductive Reflection Wen-Chao Hu, Wang-Zhou Dai ,Yuan Jiang, Zhi-Hua Zhou Revelations: A Decidable ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results