Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

OptiMathSAT: A Tool for Optimization Modulo Theories
Roberto Sebastiani, Patrick Trentin
Journal of Automated Reasoning (2018) Vol. 64, Iss. 3, pp. 423-460
Closed Access | Times Cited: 44

Showing 1-25 of 44 citing articles:

SMT Techniques for Data-Aware Process Mining
Alessandro Gianola, Marco Montali, Sarah Winkler
KI - Künstliche Intelligenz (2025)
Open Access
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
Zhengbing Bian, Fabián A. Chudak, William G. Macready, et al.
Information and Computation (2020) Vol. 275, pp. 104609-104609
Open Access | Times Cited: 29
Effective prime factorization via quantum annealing by modular locally-structured embedding
Jingwen Ding, Giuseppe Spallitta, Roberto Sebastiani
Scientific Reports (2024) Vol. 14, Iss. 1
Open Access | Times Cited: 3
Global optimization of objective functions represented by ReLU networks
Christopher A. Strong, Haoze Wu, Aleksandar Zeljić, et al.
Machine Learning (2021) Vol. 112, Iss. 10, pp. 3685-3712
Open Access | Times Cited: 18
Efficient Encodings for Scalable Exploration of Cyber-Physical System Architectures
Dmitrii Kirov, Pierluigi Nuzzo, Alberto Sangiovanni‐Vincentelli, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2023) Vol. 43, Iss. 1, pp. 30-43
Closed Access | Times Cited: 5
Multi-perspective conformance checking of uncertain process traces: An SMT-based approach
Paolo Felli, Alessandro Gianola, Marco Montali, et al.
Engineering Applications of Artificial Intelligence (2023) Vol. 126, pp. 106895-106895
Open Access | Times Cited: 5
Automated Expected Value Analysis of Recursive Programs
Martin Avanzini, Georg Moser, Michael Schaper
Proceedings of the ACM on Programming Languages (2023) Vol. 7, Iss. PLDI, pp. 1050-1072
Open Access | Times Cited: 4
Abstract Action Scheduling for Optimal Temporal Planning via OMT
Stefan Panjkovic, Andrea Micheli
Proceedings of the AAAI Conference on Artificial Intelligence (2024) Vol. 38, Iss. 18, pp. 20222-20229
Open Access | Times Cited: 1
Experimenting with D-Wave quantum annealers on prime factorization problems
Jingwen Ding, Giuseppe Spallitta, Roberto Sebastiani
Frontiers in Computer Science (2024) Vol. 6
Open Access | Times Cited: 1
SAT Solving Using XOR-OR-AND Normal Forms
Bernhard Andraschko, Julian Danner, Martin Kreuzer
Mathematics in Computer Science (2024) Vol. 18, Iss. 4
Open Access | Times Cited: 1
Puli - A Problem-Specific OMT Solver
Gergely Kovásznai, Csaba Bíró, Balázs Erdélyi
EasyChair preprint (2018)
Open Access | Times Cited: 7
Global Optimization of Objective Functions Represented by ReLU Networks.
Christopher A. Strong, Haoze Wu, Aleksandar Zeljić, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 6
SaDe: Learning Models that Provably Satisfy Domain Constraints
Kshitij Goyal, Sebastijan Dumančić, Hendrik Blockeel
Lecture notes in computer science (2023), pp. 410-425
Closed Access | Times Cited: 2
Expressive Optimal Temporal Planning via Optimization Modulo Theory
Stefan Panjkovic, Andrea Micheli
Proceedings of the AAAI Conference on Artificial Intelligence (2023) Vol. 37, Iss. 10, pp. 12095-12102
Open Access | Times Cited: 2
Automated Design Space Exploration for Resource Allocation in Software-Defined Vehicles
Fengjunjie Pan, Jianjie Lin, Markus Rickert, et al.
2022 IEEE Intelligent Vehicles Symposium (IV) (2023), pp. 1-8
Open Access | Times Cited: 2
Towards Automated Detection of Single-Trace Side-Channel Vulnerabilities in Constant-Time Cryptographic Code
Ferhat Erata, Ružica Piskač, Víctor Mateu, et al.
(2023), pp. 687-706
Open Access | Times Cited: 2
From MiniZinc to Optimization Modulo Theories, and Back
Francesco Contaldo, Patrick Trentin, Roberto Sebastiani
Lecture notes in computer science (2020), pp. 148-166
Closed Access | Times Cited: 5
ContracT – from Legal Contracts to Formal Specifications: Preliminary Results
Michele Soavi, Nicola Zeni, John Mylopoulos, et al.
Lecture notes in business information processing (2020), pp. 124-137
Open Access | Times Cited: 5
AlloyMax: bringing maximum satisfaction to relational specifications
Changjian Zhang, R. Harrison Wagner, Pedro Orvalho, et al.
(2021), pp. 155-167
Open Access | Times Cited: 5
Optimization Modulo the Theory of Floating-Point Numbers
Patrick Trentin, Roberto Sebastiani
Lecture notes in computer science (2019), pp. 550-567
Closed Access | Times Cited: 4
Breaking Symmetries with RootClique and LexTopSort
Johannes K. Fichte, Markus Hecher, Stefan Szeider
Lecture notes in computer science (2020), pp. 286-303
Closed Access | Times Cited: 4
Semantic Annotation of Legal Contracts with ContrattoA
Michele Soavi, Nicola Zeni, John Mylopoulos, et al.
Informatics (2022) Vol. 9, Iss. 4, pp. 72-72
Open Access | Times Cited: 3
Generalized Optimization Modulo Theories
Nestan Tsiskaridze, Clark Barrett, Cesare Tinelli
Lecture notes in computer science (2024), pp. 458-479
Open Access
A Local Search Algorithm for MaxSMT(LIA)
Xiang He, Bohan Li, Mengyu Zhao, et al.
Lecture notes in computer science (2024), pp. 55-72
Open Access
A novel approach for risk assessment optimization in big data platforms using SMT solvers
Sherif M. Saif, Amany Abdelsamea
Journal of Electrical Systems and Information Technology (2024) Vol. 11, Iss. 1
Open Access
Page 1 - Next Page

Scroll to top