Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
The presence of "unwanted" (or background) traffic in the Internet is a well-known fact. In principle any network that has been engineered without taking its presence in...
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
Purpose The discovery of the "right" ontology or ontology part is a central ingredient for effective ontology re-use. We present an approach for supporting a form of ada...