English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Superposition modulo a Shostak Theory

Ganzinger, H., Hillenbrand, T., & Waldmann, U. (2003). Superposition modulo a Shostak Theory. In Automated Deduction, CADE-19: 19th International Conference on Automated Deduction (pp. 182-196). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2E43-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2E46-4
Genre: Conference Paper

Files

show Files
hide Files
:
_03CADE.2.ps (Any fulltext), 212KB
 
File Permalink:
-
Name:
_03CADE.2.ps
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/postscript
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Ganzinger, Harald1, Author           
Hillenbrand, Thomas1, 2, 3, Author           
Waldmann, Uwe1, 3, Author           
Baader, Franz1, Editor           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              
3Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: -
 Abstract: We investigate superposition modulo a Shostak theory $T$ in order to facilitate reasoning in the amalgamation of $T$ and a free theory~$F$. % Free operators occur naturally e.\,g.\ in program verification problems when abstracting over subroutines. If their behaviour in addition can be specified axiomatically, much more of the program semantics can be captured. % Combining the Shostak-style components for deciding the clausal validity problem with the ordering and saturation techniques developed for equational reasoning, we derive a refutationally complete calculus on mixed ground clauses which result for example from CNF transforming arbitrary universally quantified formulae. % The calculus works modulo a Shostak theory in the sense that it operates on canonizer normalforms. For the Shostak solvers that we study, coherence comes for free: no coherence pairs need to be considered.

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-172003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 201853
Other: Local-ID: C1256104005ECAFC-4489C55BD13D7669C1256CFE005A7257-GanzingerHillenbrandWaldmann2003
 Degree: -

Event

show
hide
Title: CADE 2003
Place of Event: Miami, Florida
Start-/End Date: 2003-07-28 - 2003-08-02

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 182 - 196 Identifier: ISBN: 3-540-40559-3

Source 2

show
hide
Title: Lecture Notes in Artificial Intelligence
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2741 Sequence Number: - Start / End Page: - Identifier: -