Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
The paper presents the author's partial and personal historical reconstruction of how decision theory is evolving to a decision aiding methodology. The presentation shows mai...
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella