- Centre National de la Recherche ScientifiqueFR528 papers
- University of ViennaAT480 papers
- Vienna Center for Quantum Science and TechnologyAT328 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR275 papers
- European Organization for Nuclear ResearchCH263 papers
- Charles UniversityCZ245 papers
- ETH ZurichCH223 papers
- Institute of High Energy PhysicsCN223 papers
- Université Paris-SaclayFR219 papers
- CEA Paris-SaclayFR215 papers
- University of WarsawPL215 papers
- Massachusetts Institute of TechnologyUS209 papers
166 papers · 1 filter
STLSat---An Improved Tableau for Satisfiability Checking of Signal Temporal Logic Formulas
Marco Zamponi, Florian Lammel, Ezio Bartocci +1
Signal Temporal Logic (STL) is a formalism used to describe temporal properties of real-valued signals in cyber-physical systems. In mission- and safety-critical domains, specifica…
Robust Classification in ML: A Topological Semantics Approach
Dominik Pichler, Mirko Tagliaferri
Robust classification is commonly understood as the stability of a classifier under small perturbations (often adversarial) of input data. In this paper, we propose a logical frame…
Streamliners for Answer Set Programming
Florentina Voboril, Martin Gebser, Stefan Szeider +1
Streamliner constraints reduce the search space of combinatorial problems by ruling out portions of the solution space. We adapt the StreamLLM approach, which uses Large Language M…
Finding Connections via Satisfiability Solving
Clemens Eisenhofer, Michael Rawson, Laura Kovács
Commonly used proof strategies by automated reasoners organise proof search either by ordering-based saturation or by reducing goals to subgoals. In this paper, we combine these tw…
On Solving String Equations via Powers and Parikh Images
Clemens Eisenhofer, Theodor Seiser, Nikolaj S. Bjørner +1
We present a new approach for solving string equations as extensions of Nielsen transformations. Key to our work are the combination of three techniques: a power operator for strin…
Constraint Learning for Non-confluent Proof Search
Michael Rawson, Clemens Eisenhofer, Laura Kovács
Proof search in non-confluent tableau calculi, such as the connection tableau calculus, suffers from excess backtracking, but simple restrictions on backtracking are incomplete. We…