Abstract. The aim of this paper is to try to understand the structure of time in information technologies. Starting with historical arguments, it first shows that time is neither l...
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
In this paper, we want to handle multiple interleaved Alldiff constraints from two points of view: a uniform propagation framework with some CSP reduction rules and a SAT encoding ...
Abstract. The purpose of this paper is to test the hypothesis that simple classifiers are more robust to changing environments than complex ones. We propose a strategy for generati...
Distance semantics is a robust way of handling dynamically evolving and possibly contradictory information. In this paper we show that in many cases distance-based entailments can ...
A problem of intense interest to many sports fans as a season progresses is whether their favorite team has mathematically clinched a playoff spot; i.e., whether there is no possib...
The web, as a real mass medium, has become an invaluable data source for Information Extraction and Retrieval systems. Digital authoring is a relatively new style of communication,...
This paper presents a statistical model for discovering topical clusters of words in unstructured text. The model uses a hierarchical Bayesian structure and it is also able to iden...