HyLoRes, a Resolution Based Theorem Prover for Hybrid Logics
HyLoRes  ,  is a resolution based theorem prover for hybrid logics (it is complete for the hybrid language H(@, ), a very expressive but undecidable language, and it implements a decision method for the sub-language H(@)). It implements a version of the ``given clause'' algorithm which is the underlying framework of many current state of the art resolution-based theorem provers for first-order logic; and uses heuristics of order and selection functions to prune the search on the space of possible clauses.
The interest of HyLoRes is twofold: on one hand it is the first mature theorem prover for hybrid languages, and on the other, it is the first modern resolution-based prover for modal-like languages implementing optimisations and heuristics like order resolution with selection functions.
We have recently extended the prover to handle also inverse operators and transitive relations. Our short term goal is to be able to deal with hybrid inference on models for linear time, so that HyLoRes can be used as inference module in other LED's projects which are involved with the extraction and consistency checking of temporal information.
For comparison, and to better test HyLoRes, we have developed an optimized satisfiability preserving translation from H(@, ) into first-order logics  . Such a translation enables us to compare HyLoRes with state of the art resolution-based theorem provers.
HyLoRes is implemented in Haskell (ca. 3500 lines of code), and compiled with the Glasgow Haskell compiler http://www.haskell.org/ghc .
Web site: http://www.loria.fr/~areces/HyLoRes
Authors: Carlos Areces, Daniel Gorín, and Juan Heguiabehere (from the University of Buenos Aires)
Contact: Carlos Areces