A General Setting for Flexibly Combining and Augmenting Decision Procedures

  • Authors:

  • Predrag Janičić;Alan Bundy

  • Affiliations:

  • Faculty of Mathematics, University of Belgrade, Studentski trg 16, 11000 Belgrade, Yugoslavia. e-mail: janicic@matf.bg.ac.yu;Division of Informatics, University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, Scotland. e-mail: a.bundy@ed.ac.uk

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The efficient combining and augmenting of decision procedures are often very important for a successful use of theorem provers. There are several schemes for combining and augmenting decision procedures; some of them support handling uninterpreted functions, use of available lemmas, and the like. In this paper we introduce a general setting for describing different schemes for both combining and augmenting decision procedures. This setting is based on the macro inference rules used in different approaches. Some of these rules are abstraction, entailment, congruence closure, and lemma invoking. The general setting gives a simple description and the key ideas of one scheme and makes different schemes comparable. Also, it makes easier combining ideas from different schemes. In this paper we describe several schemes via introduced macro inference rules and report on our prototype implementation.