remove compilation error
AC redundancy criterion, with a dedicated specification
moved some combinators out of Superposition;
module Theories, with submodules that represent specific instances of theories (AC, TotalOrder);
module AC to deal with AC-redundancy and simplifications;
stub of Chaining module, for ordered chaining inferences
by default, base symbols are declared in Theories.AC and THeories.TotalORder
updated .ocamlinit
moved build system to Oasis!
updated .ocamlinit
started writing a Arith module to deal with linear arithmetic
simplification function on arithmetic
update .ocamlinit
progress in Arith: extraction of Monomes from terms, and extraction of arith lits from lits, implemented
bugfix in Arith.Monome.reduce_same_divby;
implemented Arith.purify
use more recent version of Logtk, with bitvectors and
generic Multiset comparison; updated modules that use bitvectors
Arith.Lits.pivot implemented; declared inference rules for Arith
big refactoring, to make indexing simpler.
- Theories.TotalOrder.lit gives a handy representation of an inequality;
- Lit.mk_{prop,true,false} doesn t need an ordering;
- many operations on literals/arrays of literals to extract inequations, fold
on subterms, fold on inequations, etc.
- indexing/unindexing refactored to use those folds rather than a big ugly function
and now with 2 more indexes, ord_side and ord_subterm for chaining
update to new signatures for Index
embed a renaming into Ctx (useful in many places)
combinators in Literal and Clause,
mostly related to positions and folding over inequality
left equality chaining implemented
passive version of equality chaining implemented