Download PDFOpen PDF in browser

Hierarchic Superposition Revisited

1 pagesPublished: July 5, 2015

Abstract

In 1994,
Bachmair, Ganzinger, and Waldmann introduced the hierarchical
superposition calculus as a generalization of the superposition
calculus for black-box style theory reasoning.
Their calculus works in a framework of hierarchic specifications.
It tries to prove the
unsatisfiability of a set of clauses with respect to interpretations
that extend a background model such as the integers with linear arithmetic
conservatively, that is, without
identifying distinct elements of old sorts ("confusion") and without
adding new elements to old sorts ("junk").
We show how the calculus can be improved,
report on practical experiments,
and present a new completeness result for
non-compact classes of background models
(i.e., linear integer or rational arithmetic restricted to
standard models).

In: Stephan Schulz, Leonardo De Moura and Boris Konev (editors). PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning, vol 31, pages 1.

BibTeX entry
@inproceedings{PAAR-2014:Hierarchic_Superposition_Revisited,
  author    = {Uwe Waldmann},
  title     = {Hierarchic Superposition Revisited},
  booktitle = {PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Stephan Schulz and Leonardo De Moura and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {31},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/vlTw},
  doi       = {10.29007/w9vg},
  pages     = {1},
  year      = {2015}}
Download PDFOpen PDF in browser