English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

Obtaining Finite Local Theory Axiomatizations via Saturation

MPS-Authors
/persons/resource/persons44642

Horbach,  Matthias
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45516

Sofronie-Stokkermans,  Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

http://www.avacs.org/Publikationen/Open/avacs_technical_report_093.pdf
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Horbach, M., & Sofronie-Stokkermans, V.(2014). Obtaining Finite Local Theory Axiomatizations via Saturation (ATR93). SFB/TR 14 AVACS.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-C90C-F
Abstract
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and modular reasoning is possible. We use a notion of locality of a theory extension parameterized by a closure operator on ground terms. We give criteria for recognizing these types of theory extensions. We then show that combinations of extensions of theories which are local in this extended sense have also a locality property and hence allow modular and hierarchical reasoning. We thus obtain parameterized decidability and complexity results for many (combinations of) theories important in verification.