1054 search results - page 141 / 211 » A Logic Language of Granular Computing |
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
EDOC
2003
IEEE
14 years 29 days ago
2003
IEEE
Model-driven architectures (MDA) separate the business or application logic from the underlying platform technology and represent this logic with precise semantic models. These mo...
AUSAI
2006
Springer
13 years 11 months 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...