1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
/*-----------------------------------------------------------------------
File : cto_kbolin.h
Author: Stephan Schulz
Contents
Definitions for implementing a linear time implementation of the
Knuth-Bendix ordering. The implementation is based in the ideas
presented in [Loechner:JAR-2006] (Bernd Loechner, "Things to Know
when Implementing KBO", JAR 36(4):289-310, 2006.
Copyright 2010 by the author.
This code is released under the GNU General Public Licence and
the GNU Lesser General Public License.
See the file COPYING in the main E directory for details..
Run "eprover -h" for contact information.
Changes
<1> Mon Feb 15 14:41:04 EET 2010
New (from cto_kbo.h)
-----------------------------------------------------------------------*/
#ifndef CTO_KBOLIN
#define CTO_KBOLIN
#include <cto_ocb.h>
/*---------------------------------------------------------------------*/
/* Data type declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Exported Functions and Variables */
/*---------------------------------------------------------------------*/
bool KBO6Greater(OCB_p ocb, Term_p s, Term_p t, DerefType
deref_s, DerefType deref_t);
CompareResult KBO6Compare(OCB_p ocb, Term_p t1, Term_p t2,
DerefType deref_t1, DerefType deref_t2);
#endif
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|
