( en | de | ru )

 

Disambiguation of "Borralleras, Cristina"

Author of the publication

copydeleteadd this publication to your clipboard
On Grid Graph Reachability and Puzzle Games.

, , , and . CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Cristina Häring

Cristina Sattarhoff

Cristina Cozzini

Cristina Voss

Cristina Niculescu

 

Other publications of authors with the same name

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers., , , , and . CoRR, (2020)Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers., , , , and . ACM Trans. Comput. Log., 20 (4): 25:1-25:36 (2019)Orderings and Constraints: Theory and Practice of Proving Termination., and . Rewriting, Computation and Proof, volume 4600 of Lecture Notes in Computer Science, page 28-43. Springer, (2007)On Grid Graph Reachability and Puzzle Games., , , and . CoRR, (2023)A Good Snowman is Hard to Plan., , , , , and . CoRR, (2023)Recursive Path Orderings Can Be Context-Sensitive., , and . CADE, volume 2392 of Lecture Notes in Computer Science, page 314-331. Springer, (2002)Complete Monotonic Semantic Path Orderings., , and . CADE, volume 1831 of Lecture Notes in Computer Science, page 346-364. Springer, (2000)A Monotonic Higher-Order Semantic Path Ordering., and . LPAR, volume 2250 of Lecture Notes in Computer Science, page 531-547. Springer, (2001)Monotonic AC-Compatible Semantic Path Orderings., and . RTA, volume 2706 of Lecture Notes in Computer Science, page 279-295. Springer, (2003)SAT Modulo Linear Arithmetic for Solving Polynomial Constraints., , , , and . J. Autom. Reason., 48 (1): 107-131 (2012)