Hierarchic Superposition with Weak Abstraction
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
Collections | ANU 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 | Size | Format | Image |
---|---|---|---|---|
01_Baumgartner_Hierarchic_Superposition_with_2013.pdf | 220.78 kB | Adobe PDF | Request a copy |
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