This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
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 ...
Mobile Web pre-caching (Web prefetching and caching) is an explication of performance enhancement and storage limitation of mobile devices. In this paper, we present the granulari...
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...
Jeffrey Pound, Lubomir Stanchev, David Toman, Gran...