Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
We consider a certain class of parallel program segments in which the order of messages sent affects the completion time. We give characterization of these parallel program segmen...
OWL ontologies are complex computational artifacts that are intimately connected with conceptual information and with application issues that are not easily explicable in the conte...
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...