Sciweavers

51 search results - page 8 / 11
» cade 2008
Sort
View
CADE
2008
Springer
14 years 10 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann
CADE
2008
Springer
14 years 10 months ago
MaLARea SG1- Machine Learner for Automated Reasoning with Semantic Guidance
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...
Geoff Sutcliffe, Jirí Vyskocil, Josef Urban...
CADE
2008
Springer
14 years 10 months ago
Multi-completion with Termination Tools (System Description)
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, A...
CADE
2008
Springer
14 years 10 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
CADE
2008
Springer
14 years 10 months ago
A Small Framework for Proof Checking
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...
Hans de Nivelle, Piotr Witkowski