3663 search results - page 14 / 733 » Problems in the ontology of computer programs |
AUSAI
2006
Springer
14 years 10 days ago
2006
Springer
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...
AGP
2003
IEEE
14 years 1 months ago
2003
IEEE
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 ...
PVM
2004
Springer
14 years 1 months ago
2004
Springer
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...
OWLED
2008
13 years 10 months ago
2008
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...
PDPTA
1996
13 years 10 months ago
1996
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...