Towards bounded synthesis of resilient supervisors
In this paper, we investigate the security approach of synthesizing resilient supervisors
against combined actuator and sensor attacks, for the subclass of cyber-physical systems …
against combined actuator and sensor attacks, for the subclass of cyber-physical systems …
Learning first-order definable concepts over structures of small degree
We consider a declarative framework for machine learning where concepts and hypotheses
are defined by formulas of a logic over some “background structure”. We show that within …
are defined by formulas of a logic over some “background structure”. We show that within …
[HTML][HTML] The QBF gallery: Behind the scenes
Over the last few years, much progress has been made in the theory and practice of solving
quantified Boolean formulas (QBF). Novel solvers have been presented that either …
quantified Boolean formulas (QBF). Novel solvers have been presented that either …
Specification and Automatic Verification of Computational Reductions
J Grange, F Vehlken, N Vortmeier, T Zeume - arXiv preprint arXiv …, 2024 - arxiv.org
We are interested in the following validation problem for computational reductions: for
algorithmic problems $ P $ and $ P^\star $, is a given candidate reduction indeed a …
algorithmic problems $ P $ and $ P^\star $, is a given candidate reduction indeed a …
Experiments with reduction finding
C Jordan, Ł Kaiser - International Conference on Theory and Applications …, 2013 - Springer
Reductions are perhaps the most useful tool in complexity theory and, naturally, it is in
general undecidable to determine whether a reduction exists between two given decision …
general undecidable to determine whether a reduction exists between two given decision …
QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games
The QBF Gallery 2014 was a competitive evaluation for QBF solvers organized as part of the
FLoC 2014 Olympic Games during the Vienna Summer of Logic. The QBF Gallery 2014 …
FLoC 2014 Olympic Games during the Vienna Summer of Logic. The QBF Gallery 2014 …
Bounded synthesis of resilient supervisors
In this paper, we investigate the problem of synthesizing resilient supervisors against
combined actuator and sensor attacks, for the subclass of cyber-physical systems that can …
combined actuator and sensor attacks, for the subclass of cyber-physical systems that can …
Towards Automatic Linearization via SMT Solving
J Cao, L Lin, L Li - arXiv preprint arXiv:2408.13487, 2024 - arxiv.org
Mathematical optimization is ubiquitous in modern applications. However, in practice, we
often need to use nonlinear optimization models, for which the existing optimization tools …
often need to use nonlinear optimization models, for which the existing optimization tools …
Machine learning with guarantees using descriptive complexity and SMT solvers
C Jordan, Ł Kaiser - arXiv preprint arXiv:1609.02664, 2016 - arxiv.org
Machine learning is a thriving part of computer science. There are many efficient
approaches to machine learning that do not provide strong theoretical guarantees, and a …
approaches to machine learning that do not provide strong theoretical guarantees, and a …
Automatic generation of optimal reductions of distributions
L Lin, T Masopust, WM Wonham… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
A reduction of a source distribution is a collection of smaller sized distributions that are
collectively equivalent to the source distribution with respect to the property of …
collectively equivalent to the source distribution with respect to the property of …