4 search results - page 1 / 1 » Termination of logic programs with imperfect information: ap... |
JAPLL
2007
13 years 4 months ago
2007
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
ICFP
2009
ACM
14 years 5 months ago
2009
ACM
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validi...
FOIKS
2006
Springer
13 years 8 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...