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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/**************************************************************/
/* ********************************************************** */
/* * * */
/* * Definitions * */
/* * * */
/* * $Module: DEFS * */
/* * * */
/* * Copyright (C) 1998, 1999, 2000, 2001 * */
/* * MPI fuer Informatik * */
/* * * */
/* * This program is free software; you can redistribute * */
/* * it and/or modify it under the terms of the GNU * */
/* * General Public License as published by the Free * */
/* * Software Foundation; either version 2 of the License, * */
/* * or (at your option) any later version. * */
/* * * */
/* * This program is distributed in the hope that it will * */
/* * be useful, but WITHOUT ANY WARRANTY; without even * */
/* * the implied warranty of MERCHANTABILITY or FITNESS * */
/* * FOR A PARTICULAR PURPOSE. See the GNU General Public * */
/* * License for more details. * */
/* * * */
/* * You should have received a copy of the GNU General * */
/* * Public License along with this program; if not, write * */
/* * to the Free Software Foundation, Inc., 59 Temple * */
/* * Place, Suite 330, Boston, MA 02111-1307 USA * */
/* * * */
/* * * */
/* $Revision: 21527 $ * */
/* $State$ * */
/* $Date: 2005-04-24 21:10:28 -0700 (Sun, 24 Apr 2005) $ * */
/* $Author: duraid $ * */
/* * * */
/* * Contact: * */
/* * Christoph Weidenbach * */
/* * MPI fuer Informatik * */
/* * Stuhlsatzenhausweg 85 * */
/* * 66123 Saarbruecken * */
/* * Email: weidenb@mpi-sb.mpg.de * */
/* * Germany * */
/* * * */
/* ********************************************************** */
/**************************************************************/
/* $RCSfile$ */
#ifndef _DEFS_
#define _DEFS_
/**************************************************************/
/* Includes */
/**************************************************************/
#include "clause.h"
#include "term.h"
#include "list.h"
#include "search.h"
/**************************************************************/
/* Structures */
/**************************************************************/
typedef enum { PREDOCCURONCE = 1, /* whether predicate occurs only once */
ISEQUALITY = 2 /* whether predicate is equality */
} DEF_ATTRIBUTES;
typedef struct DEF_HELP {
TERM expansion; /* The definition of the predicate term*/
TERM predicate; /* The predicate which is defined*/
TERM toprove;
LIST parentclauses; /* List of clause numbers plus list of literal indices */
const char *label; /* The label of the predicate term*/
BOOL conjecture;
NAT attributes; /* The attributes of the predicate*/
} *DEF, DEF_NODE;
/**************************************************************/
/* Inline functions */
/**************************************************************/
static __inline__ TERM def_Expansion(DEF D)
{
return D->expansion;
}
static __inline__ void def_RplacExp(DEF D, TERM E)
{
D->expansion = E;
}
static __inline__ TERM def_Predicate(DEF D)
{
return D->predicate;
}
static __inline__ void def_RplacPred(DEF D, TERM Pred)
{
D->predicate = Pred;
}
static __inline__ TERM def_ToProve(DEF D)
{
return D->toprove;
}
static __inline__ void def_RplacToProve(DEF D, TERM ToProve)
{
D->toprove = ToProve;
}
static __inline__ LIST def_ClauseNumberList(DEF D)
{
return list_PairFirst(D->parentclauses);
}
static __inline__ void def_RplacClauseNumberList(DEF D, LIST L)
{
list_Rplaca(D->parentclauses, L);
}
static __inline__ LIST def_ClauseLitsList(DEF D)
{
return list_PairSecond(D->parentclauses);
}
static __inline__ void def_RplacClauseLitsList(DEF D, LIST L)
{
list_Rplacd(D->parentclauses, L);
}
static __inline__ const char* def_Label(DEF D)
{
return D->label;
}
static __inline__ void def_RplacLabel(DEF D, const char* L)
{
D->label = L;
}
static __inline__ BOOL def_Conjecture(DEF D)
{
return D->conjecture;
}
static __inline__ void def_SetConjecture(DEF D)
{
D->conjecture = TRUE;
}
static __inline__ void def_AddAttribute(DEF D, DEF_ATTRIBUTES Attribute)
{
D->attributes = D->attributes | Attribute;
}
static __inline__ NAT def_HasAttribute(DEF D, DEF_ATTRIBUTES Attribute)
{
return (D->attributes & Attribute);
}
static __inline__ void def_RemoveAttribute(DEF D, DEF_ATTRIBUTES Attribute)
{
if (D->attributes & Attribute)
D->attributes = D->attributes - Attribute;
}
static __inline__ BOOL def_HasGuard(DEF D)
{
return (def_ToProve(D)!=term_Null());
}
/**************************************************************/
/* Functions */
/**************************************************************/
DEF def_CreateFromClauses(TERM, TERM, LIST, LIST, BOOL);
DEF def_CreateFromTerm(TERM, TERM, TERM, const char*);
LIST def_ExtractDefsFromTerm(TERM, const char*);
void def_ExtractDefsFromTermlist(PROOFSEARCH, LIST, LIST);
void def_ExtractDefsFromClauselist(PROOFSEARCH, LIST);
TERM def_ApplyDefToTermOnce(DEF, TERM, FLAGSTORE, PRECEDENCE, BOOL*);
TERM def_ApplyDefToTermExhaustive(PROOFSEARCH, TERM);
LIST def_ApplyDefToTermlist(DEF, LIST, FLAGSTORE, PRECEDENCE, BOOL*, BOOL);
LIST def_ApplyDefinitionToTermList(LIST, LIST, FLAGSTORE, PRECEDENCE);
/*
LIST def_GetTermsForProof(TERM, TERM, int);
BOOL def_FindProofForGuard(TERM, TERM, TERM, FLAGSTORE);
*/
LIST def_ApplyDefToClauseOnce(DEF, CLAUSE, FLAGSTORE, PRECEDENCE);
LIST def_ApplyDefToClauseExhaustive(PROOFSEARCH, CLAUSE);
LIST def_ApplyDefToClauselist(PROOFSEARCH, DEF, LIST, BOOL);
LIST def_FlattenWithOneDefinition(PROOFSEARCH, DEF);
void def_FlattenWithOneDefinitionSemiDestructive(PROOFSEARCH, DEF);
void def_FlattenWithOneDefinitionDestructive(PROOFSEARCH, DEF);
void def_FlattenDefinitionsDestructive(PROOFSEARCH);
void def_Delete(DEF);
void def_Print(DEF);
int def_PredicateOccurrences(TERM, SYMBOL);
#endif
|
