/usr/include/ladr/just.h is in libladr-dev 0.0.200911a-2.1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /* Copyright (C) 2006, 2007 William McCune
This file is part of the LADR Deduction Library.
The LADR Deduction Library is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License,
version 2.
The LADR Deduction Library 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 the LADR Deduction Library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef TP_JUST_H
#define TP_JUST_H
#include "clauseid.h"
#include "parse.h"
/* INTRODUCTION
*/
/* Public definitions */
typedef enum {
INPUT_JUST, /* Primary */
GOAL_JUST, /* Primary */
DENY_JUST, /* Primary int (ID) */
CLAUSIFY_JUST, /* Primary int (ID) */
COPY_JUST, /* Primary int (ID) */
BACK_DEMOD_JUST, /* Primary int (ID) */
BACK_UNIT_DEL_JUST, /* Primary int (ID) */
NEW_SYMBOL_JUST, /* Primary int (ID) */
EXPAND_DEF_JUST, /* Primary Ilist (ID,def-ID) */
BINARY_RES_JUST, /* Primary Ilist */
HYPER_RES_JUST, /* Primary Ilist */
UR_RES_JUST, /* Primary Ilist */
FACTOR_JUST, /* Primary Ilist (ID,lit1,lit2) */
XXRES_JUST, /* Primary Ilist (ID,lit) */
PARA_JUST, /* Primary Parajust */
PARA_FX_JUST, /* Primary Parajust */
PARA_IX_JUST, /* Primary Parajust */
PARA_FX_IX_JUST, /* Primary Parajust */
INSTANCE_JUST, /* Primary Instancejust */
PROPOSITIONAL_JUST, /* Primary int (ID) */
DEMOD_JUST, /* Secondary I3list */
UNIT_DEL_JUST, /* Secondary Ilist (lit,ID) */
FLIP_JUST, /* Secondary int (lit) */
XX_JUST, /* Secondary int (lit) */
MERGE_JUST, /* Secondary int (lit) */
EVAL_JUST, /* Secondary int (count) */
IVY_JUST, /* Primary Ivyjust */
UNKNOWN_JUST /* probably an error */
} Just_type;
typedef struct parajust * Parajust;
struct parajust {
int from_id;
int into_id;
Ilist from_pos;
Ilist into_pos;
};
typedef struct instancejust * Instancejust;
struct instancejust {
int parent_id;
Plist pairs;
};
typedef struct ivyjust * Ivyjust;
struct ivyjust {
Just_type type; /* input,resolve,paramod,instantiate,flip,propositional */
int parent1;
int parent2;
Ilist pos1;
Ilist pos2;
Plist pairs; /* for instantiate */
};
typedef struct just * Just;
struct just {
Just_type type;
Just next;
union {
int id;
Ilist lst;
Parajust para;
I3list demod;
Instancejust instance;
Ivyjust ivy;
} u;
};
/* A justification starts with a Primary part and then
has a sequence (maybe none) of Secondary parts.
Each type has some data, an integer or Ilist (integer
list) giving clause IDs, or positions of literals or
subterms.
*/
/* End of public definitions */
/* Public function prototypes from just.c */
Just get_just(void);
Parajust get_parajust(void);
Instancejust get_instancejust(void);
void fprint_just_mem(FILE *fp, BOOL heading);
void p_just_mem();
Just ivy_just(Just_type type,
int parent1, Ilist pos1,
int parent2, Ilist pos2,
Plist pairs);
Just input_just(void);
Just goal_just(void);
Just deny_just(Topform tf);
Just clausify_just(Topform tf);
Just expand_def_just(Topform tf, Topform def);
Just copy_just(Topform c);
Just propositional_just(Topform c);
Just new_symbol_just(Topform c);
Just back_demod_just(Topform c);
Just back_unit_deletion_just(Topform c);
Just binary_res_just(Topform c1, int n1, Topform c2, int n2);
Just binary_res_just_by_id(int c1, int n1, int c2, int n2);
Just factor_just(Topform c, int lit1, int lit2);
Just xxres_just(Topform c, int lit);
Just resolve_just(Ilist g, Just_type type);
Just demod_just(I3list steps);
Just para_just(Just_type rule,
Topform from, Ilist from_vec,
Topform into, Ilist into_vec);
Just instance_just(Topform parent, Plist pairs);
Just para_just_rev_copy(Just_type rule,
Topform from, Ilist from_vec,
Topform into, Ilist into_vec);
Just unit_del_just(Topform deleter, int literal_num);
Just flip_just(int n);
Just xx_just(int n);
Just merge_just(int n);
Just eval_just(int n);
Just append_just(Just j1, Just j2);
Just copy_justification(Just j);
char *jstring(Just j);
int jmap1(I3list map, int i);
char *jmap2(I3list map, int i, char *a);
void sb_append_id(String_buf sb, int id, I3list map);
void sb_write_ids(String_buf sb, Ilist p, I3list map);
void sb_write_just(String_buf sb, Just just, I3list map);
void sb_xml_write_just(String_buf sb, Just just, I3list map);
void p_just(Just j);
void zap_just(Just just);
Ilist get_parents(Just just, BOOL all);
Topform first_negative_parent(Topform c);
Plist get_clause_ancestors(Topform c);
int proof_length(Plist proof);
void map_just(Just just, I2list map);
int just_count(Just j);
void mark_parents_as_used(Topform c);
int clause_level(Topform c);
Just term_to_just(Term lst);
BOOL primary_just_type(Topform c, Just_type t);
BOOL has_input_just(Topform c);
BOOL has_copy_just(Topform c);
BOOL has_copy_flip_just(Topform c);
void sb_tagged_write_just(String_buf sb, Just just, I3list map);
#endif /* conditional compilation of whole file */
|