322 search results - page 11 / 65 » Combinations of Abstract Domains for Logic Programming |
APLAS
2001
ACM
15 years 3 months ago
2001
ACM
The garbage collection is a safe and efficient method for managing the heap. However it is not efficient for temporary storages that are allocated often and deallocated quickly. R...
PPDP
2001
Springer
15 years 4 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The coupling of description logic reasoning systems with other reasoning formalisms (possibly over the Web) is becoming an important research issue and calls for advanced...
APLAS
2000
ACM
15 years 4 months ago
2000
ACM
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
KI
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We provide an interactive method for knowledge acquisition combining approaches from description logic and formal concept analysis. Based on present data, hypothetical ru...