Automated reasoning in some local extensions of ordered structures

Sofronie-Stokkermans, Viorica; Ihlemann, Carsten

doi:10.1109/ISMVL.2007.10

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Automated reasoning in some local extensions of ordered structures

MPS-Authors

/persons/resource/persons45516

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

/persons/resource/persons44669

Ihlemann, Carsten
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

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

Sofronie-Stokkermans, V., & Ihlemann, C. (2007). Automated reasoning in some local extensions of ordered structures. In Proceedings of the 37th International Symposium on Multiple-Valued Logic (ISMVL'07) (pp. p.1.1-6). Los Alamitos, CA, USA: IEEE Computer Society.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1E53-5

Abstract

We give a uniform method for automated reasoning in several types of extensions of ordered algebraic structures (definitional extensions, extensions with boundedness axioms or with monotonicity axioms). We show that such extensions are local and, hence, efficient methods for hierarchical reasoning exist in all these cases.