Skip navigation
Skip navigation

Hierarchic Superposition with Weak Abstraction

Request a Copy

link to publisher version

Baumgartner, Peter; Waldmann, Uwe

Description

Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably complete" even

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
URI: http://hdl.handle.net/1885/66295
Source: CADE 2013
DOI: 10.1007/978-3-642-38574-2_3

Download

File Description SizeFormat Image
01_Baumgartner_Hierarchic_Superposition_with_2013.pdf220.78 kBAdobe PDF    Request a copy
Show full item record


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator