Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possi...
Martine Ceberio, Vladik Kreinovich, Andrzej Pownuk...
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
Barbara M. Smith, Stefano Bistarelli, Barry O'Sull...