(+84) 936393674 - Email: contact@aiacademy.edu.vn

Dr Nguyen Van Hau

Van-Hau Nguyen was born in Vietnam in 1980. He received BSc in Applied Informatics & Mathematics and a MSc in Information Technology in 2003 and 2006, respectively, at Hanoi University of Science and Technology. Since October 2010, he started working on the PhD project at the Knowledge Representation and Reasoning Group at the Faculty of Computer Science at Technische Universitäte Dresden (TUD). He carried out a joint PhD in the program of EPCL (European PhD Program in Computational Logic) at TUD and Universidade Nova de Lisboa (UNL) under supervised by prof. Steffen Hölldobler (TUD) and by prof. Pedro Barahona (UNL). He received Dr.Ing in 2015. Since 2003, he has been with the Faculty of Information and Technology, Hung Yen University of Technology and Education, Hung Yen, Vietnam, as a lecturer. He has published more than 20 refereed papers/articles in: Boolean satisfiability problems (also referred to as propositional satisfiability, and abbreviated as SAT) Constraint Satisfaction Problems (CSPs) Operations Research Machine Learning Natural Language Processing

Van-Hau Nguyen was born in Vietnam in 1980.


He received BSc in Applied Informatics & Mathematics and a MSc in Information Technology in 2003 and 2006, respectively, at Hanoi University of Science and Technology. Since October 2010, he started working on the PhD project at the Knowledge Representation and Reasoning Group  at  the Faculty of Computer Science at Technische Universitäte Dresden (TUD). He carried out a joint PhD in the program of EPCL (European PhD Program in Computational Logic) at TUD and Universidade Nova de Lisboa (UNL) under supervised by prof. Steffen Hölldobler (TUD) and by prof. Pedro Barahona (UNL). He received Dr.Ing in 2015.


Since 2003, he has been with the Faculty of Information and Technology, Hung Yen University of Technology and Education, Hung Yen, Vietnam, as a lecturer. He has published more than 20 refereed papers/articles in:



  • Boolean satisfiability problems (also referred to as propositional satisfiability, and abbreviated as SAT)

  • Constraint Satisfaction Problems (CSPs)

  • Operations Research

  • Machine Learning

  • Natural Language Processing

Subscribe us for Future Updates

Subscribe

Subscribe us for Future Updates

No, thanks!