Publications
- Modeling and Solving the Multi-agent Pathfinding Problem in Picat2017 | Faculty of Mathematics and Physics
- Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors2015 | Faculty of Mathematics and Physics
- Solving Abstract Cooperative Path-Finding in Densely Populated Environments2014 | Faculty of Mathematics and Physics
- Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup2014 | Faculty of Mathematics and Physics
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Faculty of Mathematics and Physics
- An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors2012 | Faculty of Mathematics and Physics
- A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints2012 | Faculty of Mathematics and Physics
- Exploiting Global Properties in Path-Consistency Applied on SAT2011 | Faculty of Mathematics and Physics
- Encoding HTN Planning as a Dynamic CSP +12005 | Faculty of Mathematics and Physics
- An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems +12005 | Faculty of Mathematics and Physics
Loading network view...