Connection tableaux with lazy paramodulation

  • Authors:

  • Andrei Paskevich

  • Affiliations:

  • Laboratoire d'Algorithmique, Complexité et Logique, Université Paris 12, Créteil Cedex, France

  • Venue:
  • IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tableau calculus for logic with equality. This calculus is based on a lazy form of paramodulation where parts of the unification step become auxiliary subgoals in a tableau and may be subjected to subsequent paramodulations. Our calculus uses ordering constraints and a certain form of the basicness restriction.