This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
We propose an approach to Natural Language Processing exploiting knowledge domain in an e-commerce scenario. Based on such modeling an NLP parser is presented, aimed at translating...
Stefano Coppi, Tommaso Di Noia, Eugenio Di Sciasci...
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
gle level of abstraction cannot capture the required richness of behavior. In this paper, we offer a brief principled defense of epistemological pluralism in cognitive science and ...
David J. Jilk, Christian Lebiere, Randall C. O'Rei...