default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Trentin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Nick Feng, Alan J. Hu, Sam Bayless, Syed M. Iqbal, Patrick Trentin, Mike Whalen, Lee Pike, John Backes:
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories. TACAS (1) 2024: 3-23- [i6]Nick Feng, Alan J. Hu, Sam Bayless, Syed M. Iqbal, Patrick Trentin, Mike Whalen, Lee Pike, John Backes:
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories. CoRR abs/2401.10703 (2024) - 2021
- [j2]Patrick Trentin, Roberto Sebastiani:
Optimization Modulo the Theories of Signed Bit-Vectors and Floating-Point Numbers. J. Autom. Reason. 65(7): 1071-1096 (2021) - [c8]Sam Bayless, John D. Backes, Dan DaCosta, Benjamin F. Jones, Nate Launchbury, Patrick Trentin, Kelsey Jewell, Sagar Joshi, Michael Q. Zeng, Nandita Mathews:
Debugging Network Reachability with Blocked Paths. CAV (2) 2021: 851-862 - [c7]Filippo Bigarella, Alessandro Cimatti, Alberto Griggio
, Ahmed Irfan, Martin Jonás, Marco Roveri, Roberto Sebastiani, Patrick Trentin:
Optimization Modulo Non-linear Arithmetic via Incremental Linearization. FroCoS 2021: 213-231 - 2020
- [j1]Roberto Sebastiani, Patrick Trentin:
OptiMathSAT: A Tool for Optimization Modulo Theories. J. Autom. Reason. 64(3): 423-460 (2020) - [c6]Francesco Contaldo, Patrick Trentin, Roberto Sebastiani:
From MiniZinc to Optimization Modulo Theories, and Back. CPAIOR 2020: 148-166
2010 – 2019
- 2019
- [b1]Patrick Trentin:
Optimization Modulo Theories with OptiMathSAT. University of Trento, Italy, 2019 - [c5]Patrick Trentin, Roberto Sebastiani:
Optimization Modulo the Theory of Floating-Point Numbers. CADE 2019: 550-567 - [i5]Patrick Trentin, Roberto Sebastiani:
Optimization Modulo the Theories of Signed Bit-Vectors and Floating-Point Numbers. CoRR abs/1905.02838 (2019) - [i4]Francesco Contaldo, Patrick Trentin, Roberto Sebastiani:
From MiniZinc to Optimization Modulo Theories, and Back (Extended Version). CoRR abs/1912.01476 (2019) - 2018
- [i3]James H. Davenport, Matthew England, Roberto Sebastiani, Patrick Trentin:
OpenMath and SMT-LIB. CoRR abs/1803.01592 (2018) - 2017
- [c4]Roberto Sebastiani, Patrick Trentin:
On Optimization Modulo Theories, MaxSMT and Sorting Networks. TACAS (2) 2017: 231-248 - [i2]Roberto Sebastiani, Patrick Trentin:
On Optimization Modulo Theories, MaxSMT and Sorting Networks. CoRR abs/1702.02385 (2017) - 2016
- [c3]Roberto Sebastiani, Patrick Trentin:
On the Benefits of Enhancing Optimization Modulo Theories with Sorting Networks for MaxSMT. SMT@IJCAR 2016: 85-95 - 2015
- [c2]Roberto Sebastiani, Patrick Trentin:
OptiMathSAT: A Tool for Optimization Modulo Theories. CAV (1) 2015: 447-454 - [c1]Roberto Sebastiani, Patrick Trentin:
Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions. TACAS 2015: 335-349 - 2014
- [i1]Roberto Sebastiani, Patrick Trentin:
Pushing the envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions. CoRR abs/1410.5568 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
