16 citations · 50 across the 11 of their papers we have counts for
11 papers
Search-Space Pruning with Int-Splits for Faster QBF Solving
Maximilian Heisinger, Irfansha Shaik, Martina Seidl +1
In many QBF encodings, sequences of Boolean variables stand for binary representations of integer variables. Examples are state labels in bounded model checking or actions in plann…
Optimal Layout Synthesis for Quantum Circuits as Classical Planning (full version)
Irfansha Shaik, Jaco van de Pol
In Layout Synthesis, the logical qubits of a quantum circuit are mapped to the physical qubits of a given quantum hardware platform, taking into account the connectivity of physica…
Concise QBF Encodings for Games on a Grid (extended version)
Irfansha Shaik, Jaco van de Pol
Encoding 2-player games in QBF correctly and efficiently is challenging and error-prone. To enable concise specifications and uniform encodings of games played on grid boards, like…
Implicit State and Goals in QBF Encodings for Positional Games (extended version)
Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol +1
We address two bottlenecks for concise QBF encodings of maker-breaker positional games, like Hex and Tic-Tac-Toe. Our baseline is a QBF encoding with explicit variables for board p…
Efficient Convex Zone Merging in Parametric Timed Automata
Étienne André, Dylan Marinho, Laure Petrucci +1
Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. Reducing their state space is a signifi…
A Benchmarks Library for Extended Parametric Timed Automata
Étienne André, Dylan Marinho, Jaco van de Pol
Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. In order to test the efficiency of new…