39 search results - page 8 / 8 » Tutorial on Specialisation of Logic Programs |
ENTCS
2008
13 years 7 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...
FOIKS
2006
Springer
13 years 11 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...
Lecture Notes
Driven by recent innovations in Field-Programmable Gate Arrays (FPGAs), reconfigurable computing offers unique ways to accelerate key algorithms. FPGAs offer a programmable logic f...
ICSE
2007
IEEE-ACM
14 years 1 months ago
2007
IEEE-ACM
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...