We give algorithms for linear and for general context matching and discuss how the performance in the general case can be improved through the use of information derived from approximations that can… (More)

We show how the method of proof by consistency can be extended to proving properties of the perfect model of a set of rst-order clauses with equality. Technically proofs by consistency will be… (More)

In analogy to the Davis-Putnam procedure we develop a new procedure for computing stable models of propositional normal disjunctive logic programs, using case analysis and simplification. Our… (More)

We present a general approach for integrating certain mathematical structures in rst-order equational theorem provers. More specifically , we consider theorem proving problems speciied by sets of… (More)

We report on a project to use SGLR parsing and term rewriting with ELAN4 to extract the semantics of mathematical formulas from a LaTeX document and representing them in MathML. The LaTeX document we… (More)

We report on a project to use SGLR parsing and term rewriting with ELAN4 to extract the semantics of mathematical formulas from a LTEX document and representing them in MathML. The LTEX document we… (More)