1582 search results - page 112 / 317 » On Higher-Order Description Logics |
CADE
1999
Springer
15 years 2 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
106
click to vote
CADE
1992
Springer
15 years 2 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
104
click to vote
CLIMA
2006
14 years 11 months ago
2006
FLUX is a declarative, CLP-based programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledg...
DAGSTUHL
2003
14 years 11 months ago
2003
Abstract. Hydra is a domain-specific language for designing digital circuits, which is implemented by embedding within Haskell. Many features required for hardware specification ...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...