523 search results - page 7 / 105 » Past and Future of DL-Lite |
MM
2009
ACM
14 years 2 months ago
2009
ACM
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
CP
2007
Springer
14 years 1 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
VOTEID
2007
Springer
14 years 1 months ago
2007
Springer
SEFM
2006
IEEE
14 years 1 months ago
2006
IEEE
tic analysis tools based on abstraction are sound but not complete. Several practical static analysis tools are heuristic in nature —they are neither sound nor complete, but have...