Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
In this paper, a visual system Eviss is proposed. Visual systems proposed so far have been fixed on certain specifications. It is hard to make and modify such visual systems. Sinc...
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Constraint-based modeling has been used in many application areas of Intelligent Tutoring Systems as a powerful means to analyse erroneous student solutions and generate helpful fe...