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
|
/**************************************************************/
/* ********************************************************** */
/* * * */
/* * RESOLUTION * */
/* * * */
/* * $Module: RESOLUTION * */
/* * * */
/* * Copyright (C) 1996, 1997, 1998, 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$ */
#include "resolution.h"
/**************************************************************/
/* Functions */
/**************************************************************/
void res_InsertClauseIndex(CLAUSE clause, st_INDEX stindex)
/**********************************************************
INPUT: A st_INDEX and a clause.
RETURNS: Inserts the clause in the st_INDEX stindex.
CAUTION: None.
***********************************************************/
{
int n,j;
n = clause_Length(clause);
for (j = 0; j < n; j++)
st_EntryCreate(stindex,
clause_GetLiteral(clause,j),
clause_GetLiteralTerm(clause,j),
cont_LeftContext());
}
void res_DeleteClauseIndex(CLAUSE clause, st_INDEX stindex)
/**********************************************************
INPUT: A st_INDEX and a clause.
RETURNS: Deletes the clause from the st_INDEX stindex.
CAUTION: None.
***********************************************************/
{
int n, j;
n = clause_Length(clause);
for (j = 0; j < n; j++)
if (!st_EntryDelete(stindex,
clause_GetLiteral(clause,j),
clause_GetLiteralTerm(clause,j),
cont_LeftContext()))
misc_DumpCore();
}
CLAUSE res_SelectLightestClause(LIST clauselist)
/**********************************************************
INPUT: A list of clauses.
RETURNS: The lightest clause of the clauselist.
CAUTION: None.
***********************************************************/
{
CLAUSE clause;
LIST scan;
int min;
clause = list_Car(clauselist);
min = clause_Weight(clause);
for (scan=list_Cdr(clauselist); !list_Empty(scan); scan=list_Cdr(scan)) {
if (clause_Weight(list_Car(scan)) < min) {
clause = list_Car(scan);
min = clause_Weight(clause);
}
}
return clause;
}
BOOL res_HasTautology(CLAUSE clause)
/**********************************************************
INPUT: A clauses.
RETURNS: TRUE if the clause contains a complementary
literal pair and FALSE otherwise.
CAUTION: None.
***********************************************************/
{
BOOL found;
TERM literal1;
int i, j, n;
found = FALSE;
n = clause_Length(clause);
for (i = 0; i < n && !found; i++) {
literal1 = fol_ComplementaryTerm(clause_GetLiteralTerm(clause,i));
for (j = 0; j < n && !found; j++)
if (j != i && term_Equal(literal1, clause_GetLiteralTerm(clause,j)))
found = TRUE;
term_Delete(literal1);
}
return found;
}
BOOL res_BackSubWithLength(CLAUSE clause, st_INDEX stindex)
/**********************************************************
INPUT: A clauses and an index.
RETURNS: TRUE if a clause of the index subsumes the clause clause
and length(clause) >= length(clause of index).
CAUTION: None.
***********************************************************/
{
int n,i;
LIST scan,generals;
TERM term;
LITERAL litres;
n = clause_Length(clause);
for (i = 0; i < n; i++) {
term = clause_GetLiteralTerm(clause,i);
generals = st_GetGen(cont_LeftContext(), stindex, term);
for (scan = generals; !list_Empty(scan); scan = list_Cdr(scan)) {
litres = (LITERAL) list_Car(scan);
if (litres == clause_GetLiteral(clause_LiteralOwningClause(litres),0) &&
clause_Length(clause) >= clause_Length(clause_LiteralOwningClause(litres)) &&
clause_Weight(clause) >= clause_Weight(clause_LiteralOwningClause(litres)) &&
subs_Idc(clause_LiteralOwningClause(litres),clause)) {
list_Delete(generals);
return TRUE;
}
}
list_Delete(generals);
}
return FALSE;
}
|
