File: che_to_autoselect.h

package info (click to toggle)
eprover 2.6%2Bds-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 21,288 kB
  • sloc: ansic: 331,111; csh: 12,026; python: 10,178; awk: 5,825; makefile: 461; sh: 389
file content (76 lines) | stat: -rw-r--r-- 2,528 bytes parent folder | download | duplicates (2)
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
64
65
66
67
68
69
70
71
72
73
74
75
76
/*-----------------------------------------------------------------------

File  : che_to_autoselect.h

Author: Stephan Schulz

Contents

  Functions dealing with the automatic selection of a (suitable?) term
  ordering.

  Copyright 1998, 1999 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> Thu Dec 31 17:39:46 MET 1998
    New

-----------------------------------------------------------------------*/

#ifndef CHE_TO_AUTOSELECT

#define CHE_TO_AUTOSELECT

#include <che_proofcontrol.h>


/*---------------------------------------------------------------------*/
/*                    Data type declarations                           */
/*---------------------------------------------------------------------*/

typedef double (*OrderEvaluationFun)(OCB_p ocb, ProofState_p state,
                 HeuristicParms_p parms);


/*---------------------------------------------------------------------*/
/*                Exported Functions and Variables                     */
/*---------------------------------------------------------------------*/

#define OrderParmsCellAlloc() \
   (OrderParmsCell*)SizeMalloc(sizeof(OrderParmsCell))
#define OrderParmsCellFree(junk) \
   SizeFree(junk, sizeof(OrderParmsCell))

/* For now, we will fix the evaluation parameters by #defines's in the
   .c file....if somebody wants to tinker with it, he or she is
   welcome to do it. Not me, and not now!  */

double OrderEvaluate(OCB_p ocb, ProofState_p state, HeuristicParms_p
           params);

bool   OrderNextType(OrderParms_p ordering);
bool   OrderNextWeightGen(OrderParms_p ordering);
bool   OrderNextPrecGen(OrderParms_p ordering);
bool   OrderNextConstWeight(OrderParms_p ordering);

bool   OrderNextOrdering(OrderParms_p ordering, OrderParms_p mask);

OCB_p  OrderFindOptimal(OrderParms_p mask, OrderEvaluationFun
         eval_fun, ProofState_p state, HeuristicParms_p
         params);

OCB_p  TOSelectOrdering(ProofState_p state, HeuristicParms_p params,
         SpecFeature_p specs);
OCB_p  TOCreateOrdering(ProofState_p state, OrderParms_p params, char*
         pre_precedence, char* pre_weights);

#endif

/*---------------------------------------------------------------------*/
/*                        End of File                                  */
/*---------------------------------------------------------------------*/