A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded 
Problems

Bromberger, Martin

doi:10.1007/978-3-319-94205-6_22

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems

MPS-Authors

/persons/resource/persons117832

Bromberger, Martin
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

Bromberger, M. (2018). A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems. In D. Galmiche, S. Schulz, & R. Sebastiani (Eds.), Automated Reasoning (pp. 329-345). Berlin: Springer. doi:10.1007/978-3-319-94205-6_22.

Cite as: https://hdl.handle.net/21.11116/0000-0002-94C1-C

Abstract

There is no abstract available