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
|
/**************************************************************/
/* ********************************************************** */
/* * * */
/* * CONDENSATION OF CLAUSES * */
/* * * */
/* * $Module: CONDENSING * */
/* * * */
/* * Copyright (C) 1996, 1997, 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.3 $ * */
/* $State: Exp $ * */
/* $Date: 2011-05-22 12:08:25 $ * */
/* $Author: weidenb $ * */
/* * * */
/* * Contact: * */
/* * Christoph Weidenbach * */
/* * MPI fuer Informatik * */
/* * Stuhlsatzenhausweg 85 * */
/* * 66123 Saarbruecken * */
/* * Email: spass@mpi-inf.mpg.de * */
/* * Germany * */
/* * * */
/* ********************************************************** */
/**************************************************************/
/* $RCSfile: condensing.c,v $ */
#include "subsumption.h"
#include "misc.h"
#include "condensing.h"
LIST cond_CondFast(CLAUSE c)
/**********************************************************
INPUT: A clause c.
RETURNS: A list with indexes with respect to c that can
be deleted due to condensing.
CAUTION: None.
***********************************************************/
{
int vec, j;
intptr_t i,k;
LIST indexlist;
indexlist = list_Nil();
vec = vec_ActMax();
for (i = 0; i < clause_Length(c); i++) {
vec_Push((POINTER) i);
}
for (k = clause_Length(c) - 1; k >= 0; k--) {
for (i = vec; i < vec_ActMax(); i++) {
if ((intptr_t)vec_GetNth(i) != k) {
cont_StartBinding();
if (unify_Match(cont_LeftContext(),
clause_GetLiteralTerm(c,k),
clause_GetLiteralTerm(c,(intptr_t)vec_GetNth(i)))) {
cont_BackTrack();
for (j = vec; j < vec_ActMax(); j++) {
if (k == (intptr_t)vec_GetNth(j)) {
vec_Swap((vec_ActMax() -1) ,j);
j = vec_ActMax();
}
}
if (subs_IdcRes(c,vec,(vec_ActMax() -1))) {
indexlist = list_Cons((POINTER)k,indexlist);
vec_Pop();
}
i = vec_ActMax()+1;
}
else
cont_BackTrack();
}
}
}
vec_SetMax(vec);
return indexlist;
}
|
