3535 search results - page 7 / 707 » Logic Program Specialisation |
ICECCS
2007
IEEE
15 years 3 months ago
2007
IEEE
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
LOPSTR
1998
Springer
15 years 3 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
AUSAI
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we extend Defeasible Logic (a computationally-oriented non-monotonic logic) in order to deal with temporalised rules. In particular, we extend the logic to cope with...
ENTCS
2008
14 years 11 months ago
2008
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
117
click to vote
FOIKS
2006
Springer
15 years 3 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...