In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia,...
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full sem...
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...