You are here


Primary tabs

  1. A. Giorgi; A. Pianesi,
    On the Morphosyntax of Temporal Arguments,
    27th Linguistic Symposium on Romance Languages [LSRL-27],
  2. Paolo Avesani; Anna Perini; Francesco Ricci,
    CBET: A Case Base Exploration Tool,
    Quinto Congresso della Associazione Italiana per l'Intelligenza Artificiale [AI IA],
  3. Luciano Serafini; Chiara Ghidini,
    Local Models Semantics for Information Integration,
    AAAI Fall symposium on Context in Knowledge Representation (KR) and Natural Language (NL),
    , (AAAI Fall symposium on Context in Knowledge Representation (KR) and Natural Language (NL),
    Cambridge, Massachusetts,
    08/11/1997 - 10/11/1997)
  4. S.R. Julian; F.V. Cartera; F.M. Groschea; R.K.W. Haselwimmera; S.J. Listera; N.D. Mathura; G.J. McMullana; C. Pfleiderera; S. Shanker Saxena; I.R. Walkera; N.J.W. Wilsona and G.G. Lonzarich,
    Non-Fermi-liquid behaviour in magnetic d- and f-electron systems,
    , pp. 265-
    , (International Conference on Magnetism,
  5. R. Brunelli; O. Mich,
    Procedimento per memorizzare e ritrovare immagini di persone ad esempio in archivi fotografici e per la costruzione di identikit e relativo sistema..
    Each characteristic (or feature) of the images to be stored is associated with a region the size of which corresponds to the average size of the feature in the images stored. The preferred application is in techniques for searching photographic archives and for the construction of identikit images.
  6. C. Potrich,
    Costruzione di tossine ibride attive specificamente contro le cellule cancerogene mediante coniugazione di citolisine con fattori di regolazione cellulare.,
    pubblicazione a carattere divulgativo,
  7. Alessandro Cimatti; Enrico Giunchiglia; Fausto Giunchiglia; Paolo Traverso,
    A Model Based Decision Procedure for Common Sense Temporal Reasoning,
    In this paper we propose a model based decision procedure for common sense temporal reasoning. This procedure exploits and enhances Lifschitz` work and distinction between action language and query language and Clarke`s work on symbolic model checking. In particular, it allows us to retain the full xpressibility of the temporal formalism and, at the same time, to perform efficient reasoning and to scale up to very complex problems, comparable or more complex than those dealt with by the current state-of-the-art planners,
  8. Francesco Ricci; D.W. Aha,
    Extending Local Learners with Error-Correcting Output Codes,
    Error-correcting output codes (ECOCs) represent classes with a set of output bits, where each bit encodes a binary classification task corresponding to a unique partition of the classes. Algorithms that use ECOCs learn the function corresponding to each bit, and combine them to generate class predictions. ECOCs can reduce both variance and bias errors for multiclass classification tasks when the errors made at the output bits are not correlated. They work well with global (e.g., C4.5) but not with local (e.g., nearest neighbor) classifiers because the latter use the same information to predict each bit's value, which yields correlated errors. This is distressing because local learners are excellent classifiers for some types of applications. We show that the output bit errors of local learners can be decorrelated by selecting different features for each bit. This yields bit-specific distance functions, which causes different information to be used for each bit's prediction. We present promising empirical reslts for this combination of ECOC, nearest neighbor, and feature selection. We also describe modifications to racing algorithms for featre selection that improve their performance in tis context,
  9. Alessandro Cimatti; Fausto Giunchiglia; G. Mongardi; B. Pietra; D. Romano; F. Torielli; Paolo Traverso,
    Formal Validation of an Interlocking System for Large Railway Stations: A Case Study,
    The goal of this document is to define a case study in formal verification, based on a complex real-world application developed by Ansaldo Trasporti. The application, called ACC, is a highly programmable and scalable interlocking system for the control of large railway stations. In the case study, several features of the ACC are omitted in order to limit the complexity. However, the case study still retains a close similarity to the architecture of the ACC, and raises a number of problems of interest for the problem of the formal validation of the real system,
  10. E. Franconi,
    Reasoning with Underspecification in the Logical Form,
    A knowledge representation formalism for expressing the logical form - intended as the representation of the deep and context-dependent meaning of an utterance - is introduced. The formalism allows for both underspecified semantic representations and encapsulation of contextual knowledge in the form of meaning postulates. In particular, lexical ambiguities introduced by prepositions, nouns, and verbs, PP-attachment ambiguities, and a simple class of quantification scoping ambiguities are considered. The basic reasoning task is satisfiability of logical forms, for which a complete and efficient decision procedure is devised. We show how to apply this logic in te case of lexical discrimination based on semantic knowledge,