Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A reduction from unbounded linear mixed arithmetic problems into bounded problems

From MaRDI portal
Publication:1799094
Jump to:navigation, search

DOI10.1007/978-3-319-94205-6_22OpenAlexW4298890824MaRDI QIDQ1799094

Martin Bromberger

Publication date: 18 October 2018

Full work available at URL: https://arxiv.org/abs/1804.07703


zbMATH Keywords

linear arithmeticlinear transformationsconstraint solvinginteger arithmeticSMTmixed arithmetic


Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (1)

SPASS-SATT. A CDCL(LA) solver


Uses Software

  • z3
  • SMTInterpol
  • CVC4
  • MathSAT5





This page was built for publication: A reduction from unbounded linear mixed arithmetic problems into bounded problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1799094&oldid=14152998"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki