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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
/**************************************************************/
/* ********************************************************** */
/* * * */
/* * TABLEAUS * */
/* * * */
/* * $Module: TABLEAU * */
/* * * */
/* * 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 FreeBSD * */
/* * Licence. * */
/* * * */
/* * 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 LICENCE file * */
/* * for more details. * */
/* * * */
/* * * */
/* $Revision: 1.4 $ * */
/* $State: Exp $ * */
/* $Date: 2010-02-22 14:09:59 $ * */
/* $Author: weidenb $ * */
/* * * */
/* * Contact: * */
/* * Christoph Weidenbach * */
/* * MPI fuer Informatik * */
/* * Stuhlsatzenhausweg 85 * */
/* * 66123 Saarbruecken * */
/* * Email: spass@mpi-inf.mpg.de * */
/* * Germany * */
/* * * */
/* ********************************************************** */
/**************************************************************/
/* $RCSfile: tableau.h,v $ */
#ifndef _TABLEAU_
#define _TABLEAU_
#include "list.h"
#include "clause.h"
typedef struct TABLEAU_HELP {
LIST Clauses; /* all clauses generated on the split level */
CLAUSE SplitClause; /* this levels split clause */
CLAUSE LeftSplitClause; /* first clause generated by split */
LIST RightSplitClauses; /* other clauses generated by split */
struct TABLEAU_HELP* LeftBranch; /* branch corresponding to first split clause */
struct TABLEAU_HELP* RightBranch; /* branch corresponding to other split clauses */
int Label;
} TABLEAU_NODE, *TABLEAU;
typedef struct {
TABLEAU *Path; /* An array of tableaux */
int Length;
int MaxLength;
} TABPATH_NODE, *TABPATH;
/* tableau output formats */
typedef enum { DAVINCI, XVCG } GRAPHFORMAT;
TABPATH tab_PathCreate(int, TABLEAU);
void tab_PathDelete(TABPATH);
BOOL tab_PathContainsClause(TABPATH, CLAUSE);
void tab_AddClauseOnItsLevel(CLAUSE, TABPATH);
void tab_AddSplitAtCursor(TABPATH, BOOL);
BOOL tab_IsClosed(TABLEAU);
TABLEAU tab_PruneClosedBranches(TABLEAU, LIST*);
int tab_Depth(TABLEAU);
void tab_SetSplitLevels(TABLEAU T);
TABLEAU tab_RemoveIncompleteSplits(TABLEAU, LIST*);
TABLEAU tab_RemoveUnfinishedSplits(TABLEAU, LIST*);
void tab_PathDelete(TABPATH);
void tab_Delete(TABLEAU);
void tab_ToClauseList(TABLEAU, LIST*);
void tab_GetEarliestEmptyClauses(TABLEAU, LIST*);
void tab_WriteTableau(TABLEAU, const char*, GRAPHFORMAT);
void tab_CheckEmpties(TABLEAU);
void tab_GetAllEmptyClauses(TABLEAU, LIST*);
void tab_LabelNodes(TABLEAU);
void tab_PrintTableau(TABLEAU);
/* inline functions for tableau paths */
static __inline__ int tab_PathLength(TABPATH TabPath)
{
return TabPath->Length;
}
static __inline__ TABLEAU tab_PathNthNode(TABPATH TabPath, int n)
{
#ifdef CHECK
if (n > TabPath->MaxLength) {
misc_StartErrorReport();
misc_ErrorReport("\n In tab_PathNthNode:");
misc_ErrorReport(" Path length is %d,", tab_PathLength(TabPath));
misc_ErrorReport("\nnode %d was requested.\n", n);
misc_FinishErrorReport();
}
#endif
return TabPath->Path[n];
}
static __inline__ TABPATH tab_PathPush(TABLEAU Tab, TABPATH TabPath)
{
TabPath->Length++;
TabPath->Path[TabPath->Length] = Tab;
#ifdef CHECK
if (TabPath->Length > TabPath->MaxLength) {
misc_StartErrorReport();
misc_ErrorReport("\n In tab_PathPush: Maximum path length %d exceeded\n",
TabPath->MaxLength);
misc_FinishErrorReport();
}
#endif
return TabPath;
}
static __inline__ TABLEAU tab_EmptyTableau(void)
{
return (TABLEAU)NULL;
}
static __inline__ TABPATH tab_PathPop(TABPATH TabPath)
{
#ifdef CHECK
if (TabPath->Length <= 0) {
misc_StartErrorReport();
misc_ErrorReport("\n In tab_PathPop: Popping from empty path.\n");
misc_FinishErrorReport();
}
#endif
TabPath->Path[TabPath->Length--] = tab_EmptyTableau();
return TabPath;
}
static __inline__ BOOL tab_PathEmpty(TABPATH P)
{
return (tab_PathLength(P) == 0);
}
static __inline__ TABLEAU tab_CreateNode(void)
{
TABLEAU Node;
Node = (TABLEAU)memory_Malloc(sizeof(TABLEAU_NODE));
Node->RightBranch = (TABLEAU)NULL;
Node->LeftBranch = (TABLEAU)NULL;
Node->SplitClause = (CLAUSE)NULL;
Node->LeftSplitClause = (CLAUSE)NULL;
Node->RightSplitClauses = list_Nil();
Node->Clauses = list_Nil();
#ifdef USE_LABEL
Node->Label = 0;
#endif
return Node;
}
static __inline__ TABPATH tab_PathPrefix(int Level, TABPATH TabPath)
{
TabPath->Length = Level;
return TabPath;
}
static __inline__ TABLEAU tab_PathTop(TABPATH Path)
{
return tab_PathNthNode(Path, tab_PathLength(Path));
}
static __inline__ BOOL tab_IsEmpty(TABLEAU Tab)
{
return (Tab == tab_EmptyTableau());
}
static __inline__ TABLEAU tab_RightBranch(TABLEAU Tab)
{
return Tab->RightBranch;
}
static __inline__ TABLEAU tab_LeftBranch(TABLEAU Tab)
{
return Tab->LeftBranch;
}
static __inline__ void tab_SetRightBranch(TABLEAU Tab, TABLEAU SubTab)
{
Tab->RightBranch = SubTab;
}
static __inline__ void tab_SetLeftBranch(TABLEAU Tab, TABLEAU SubTab)
{
Tab->LeftBranch = SubTab;
}
static __inline__ BOOL tab_RightBranchIsEmpty(TABLEAU Tab)
{
return (Tab->RightBranch == tab_EmptyTableau());
}
static __inline__ BOOL tab_LeftBranchIsEmpty(TABLEAU Tab)
{
return (Tab->LeftBranch == tab_EmptyTableau());
}
static __inline__ CLAUSE tab_SplitClause(TABLEAU Tab)
{
return Tab->SplitClause;
}
static __inline__ void tab_SetSplitClause(TABLEAU Tab, CLAUSE C)
{
Tab->SplitClause = C;
}
static __inline__ BOOL tab_HasSplit(TABLEAU T)
{
return (tab_SplitClause(T) != clause_Null());
}
static __inline__ void tab_AddClause(CLAUSE C,TABLEAU T)
{
T->Clauses = list_Cons(C,T->Clauses);
}
static __inline__ LIST tab_Clauses(TABLEAU T)
{
return T->Clauses;
}
static __inline__ void tab_SetClauses(TABLEAU T, LIST Clauses)
{
T->Clauses = Clauses;
}
static __inline__ CLAUSE tab_LeftSplitClause(TABLEAU T)
{
return T->LeftSplitClause;
}
static __inline__ void tab_SetLeftSplitClause(TABLEAU T, CLAUSE C)
{
T->LeftSplitClause = C;
}
static __inline__ LIST tab_RightSplitClauses(TABLEAU T)
{
return T->RightSplitClauses;
}
static __inline__ void tab_SetRightSplitClauses(TABLEAU T, LIST L)
{
T->RightSplitClauses = L;
}
static __inline__ void tab_AddRightSplitClause(TABLEAU T, CLAUSE C)
{
T->RightSplitClauses = list_Cons(C, T->RightSplitClauses);
}
static __inline__ BOOL tab_IsLeaf(TABLEAU T)
{
return (tab_RightBranchIsEmpty(T) && tab_LeftBranchIsEmpty(T));
}
#endif
|
