A5098883055- Constraint Satisfaction and Optimization
- Aerospace Engineering and Control Systems
- Formal Methods in Verification
- Model-Driven Software Engineering Techniques
- Advanced Multi-Objective Optimization Algorithms
- AI-based Problem Solving and Planning
University of Helsinki
2024
Due to the wide employment of automated reasoning in analysis and construction correct systems, results reported by engines must be trustworthy. For Boolean satisfiability (SAT) solvers - more recently SAT-based maximum (MaxSAT) trustworthiness is obtained integrating proof logging into solvers, making capable emitting machine-verifiable proofs certify correctness steps performed. In this work, we enable for first time based on VeriPB format multi-objective MaxSAT (MO-MaxSAT) optimization...
The declarative approach is key to efficiently finding optimal solutions various types of NP-hard real-world combinatorial optimization problems. Most work on practical solvers—ranging from classical integer programming finite-domain constraint and maximum satisfiability (MaxSAT)—has focused under a single objective; fewer advances have been made towards efficient techniques for multi-objective Motivated by significant recent in solvers MaxSAT, this we develop BiOptSat, an exact...