Joan Espasa Arxer

Joan Espasa Arxer


  • KY16 9SS

    United Kingdom

Accepting Postgraduate Research Students

PhD projects

Boolean Satisfiability (SAT);
Satisfiability Modulo Theories (SMT);
Classical and Numeric AI Planning;
Planning as Satisfiability;
Constraint Programming;
Automated reformulation of models;
Formal Languages and their expressivity;
Applications of Logic to Computer Science


Dive into the research topics where Joan Espasa Arxer is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

Computer Science

Earth and Planetary Sciences