25,161
edits
Changes
Created page with "'''Home * People * Abdallah Saffidine''' FILE:abdallah-saffidine.jpg|border|right|thumb|link=https://scholar.google.com/citations?user=yWzT7LAAAAAJ|Abdall..."
'''[[Main Page|Home]] * [[People]] * Abdallah Saffidine'''
[[FILE:abdallah-saffidine.jpg|border|right|thumb|link=https://scholar.google.com/citations?user=yWzT7LAAAAAJ|Abdallah Saffidine <ref>[https://scholar.google.com/citations?user=yWzT7LAAAAAJ Abdallah Saffidine - Google Scholar Citations]</ref>]]
'''Abdallah Saffidine''',<br/>
a French computer scientist and games researcher, currently at [https://en.wikipedia.org/wiki/University_of_New_South_Wales University of New South Wales].
He hold a Ph.D. from [https://en.wikipedia.org/wiki/Lamsade Lamsade], [[University of Paris#9|Paris Dauphine University]] in 2013 <ref>[[Abdallah Saffidine]] ('''2013'''). ''Solving Games and All That''. Ph.D. thesis, [[University of Paris#9|Université Paris-Dauphine]], advisor [[Tristan Cazenave]]</ref>.
His research interests include [https://en.wikipedia.org/wiki/Linear_temporal_logic Linear temporal logic (LTL)] [https://en.wikipedia.org/wiki/Model_checking model checking], [[Monte-Carlo Tree Search|Monte-Carlo tree search]], [[Proof-Number Search|Proof-number search]] and [[General Game Playing]]. Along with [[Tristan Cazenave]], Abdallah Saffidine is co-author of the [[Hex]] program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=556 Yopt], which performs Monte-Carlo Tree Search.
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Saffidine:Abdallah.html dblp: Abdallah Saffidine]</ref>
==2009==
* [[Abdallah Saffidine]] ('''2009'''). ''[https://www.semanticscholar.org/paper/LTL-Model-Checking-with-use-of-Generalised-and-Saffidine/34cd42ec27580aa479c7b7c86f8c707c3b4abc47 LTL Model Checking with use of Generalised Stuttering and Characteristic Patterns].''
==2010 ...==
* [[Abdallah Saffidine]] ('''2010'''). ''Some Improvements for Monte-Carlo Tree Search, Game Description Language Compilation, Score Bounds and Transpositions''. MSc-Thesis, [https://en.wikipedia.org/wiki/Lamsade Lamsade], [[University of Paris#9|Paris Dauphine University]], advisor [[Tristan Cazenave]]
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Monte-Carlo Hex''. [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/hex.pdf pdf]
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2010'''). ''UCD : Upper Confidence bound for rooted Directed acyclic graphs''. TAAI IWCG
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Score Bounded Monte-Carlo Tree Search''. [[CG 2010]]
'''2011'''
* [[Abdallah Saffidine]] ('''2011'''). ''Moccos wins the Panthom-Go Tournament''. [[ICGA Journal#34_1|ICGA Journal, Vol. 34, No. 1]] » [[15th Computer Olympiad#PanthomGo|15th Computer Olympiad]]
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2011'''). ''Solving breakthrough with Race Patterns and Job-Level Proof Number Search''. [[Advances in Computer Games 13]] » [[Breakthrough (Game)]]
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2011'''). ''A forward chaining based game description language compiler''. [http://movingai.com/giga11/cfp.html GIGA 2011]
'''2012'''
* [[Abdallah Saffidine]] ('''2012'''). ''Minimal Proof Search for Modal Logic K Model Checking''. [http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1207.html#abs-1207-1832 CoRR, July 2012] <ref>[https://en.wikipedia.org/wiki/Modal_logic Modal logic from Wikipedia]</ref>
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2012'''). ''Multiple-Outcome Proof Number Search''. [http://www.informatik.uni-trier.de/~ley/db/conf/ecai/ecai2012.html#SaffidineC12 ECAI 2012] » [[Proof-Number Search]]
* [[Abdallah Saffidine]], [[Hilmar Finnsson]], [[Michael Buro]] ('''2012'''). ''Alpha-Beta Pruning for Games with Simultaneous Moves''. [[AAAI|AAAI 2012]]
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2012'''). ''UCD : Upper confidence bound for rooted directed acyclic graphs''. [http://www.informatik.uni-trier.de/~ley/db/journals/kbs/kbs34.html#SaffidineCM12 Knowledge Based Systems, Vol. 34]
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]] ('''2012'''). ''Sparse Sampling for Adversarial Games''. [[ECAI CGW 2012]]
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2012'''). ''A General Multi-Agent Modal Logic K Framework for Game Tree Search''. [[ECAI CGW 2012]]
'''2013'''
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]], [[Mark Winands]] ('''2013'''). ''Monte Carlo *-Minimax Search''. [[Conferences#IJCAI|IJCAI 2013]]
* [[Abdallah Saffidine]] ('''2013'''). ''The Game Description Language is Turingcomplete''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]]
* [[Abdallah Saffidine]] ('''2013'''). ''Solving Games and All That''. Ph.D. thesis, [[University of Paris#9|Université Paris-Dauphine]], advisor [[Tristan Cazenave]], [http://cgi.cse.unsw.edu.au/~abdallahs/Papers/2013/Solving%20Games%20and%20All%20That.pdf pdf] <ref>[[Dap Hartmann]] ('''2013'''). ''From to αβ to ABCD and SMAB''. Review. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]</ref>
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2013'''). ''Havannah and TwixT are PSPACE-complete''. [[CG 2013]] <ref>[https://en.wikipedia.org/wiki/PSPACE-complete PSPACE-complete from Wikipedia]</ref>
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2013'''). ''Developments on Product Propagation''. [[CG 2013]], [http://www.lamsade.dauphine.fr/~cazenave/papers/probabilitySearch.pdf pdf]
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Cédric Buron]], [[Tristan Cazenave]] ('''2013'''). ''Material Symmetry to Partition Endgame Tables''. [[CG 2013]]
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2013'''). ''On the Complexity of Trick-Taking Card Games''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2013.html#BonnetJS13 IJCAI 2013] <ref>[https://en.wikipedia.org/wiki/Trick-taking_game Trick-taking game from Wikipedia]</ref>
'''2014'''
* [[Edouard Bonnet|Édouard Bonnet]], [[Abdallah Saffidine]] ('''2014'''). ''On the Complexity of General Game Playing''. [[ECAI CGW 2014]]
==2015 ...==
* [[Olivier Teytaud]], [[Abdallah Saffidine]], [[Shi-Jim Yen]] ('''2015'''). ''The complexities of Go''. [[Advances in Computer Games 14]]
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2015'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-27992-3_15 Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game]''. [[Advances in Computer Games 14]]
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2016'''). ''On the Complexity of Connection Games''. [https://arxiv.org/abs/1605.04715 arXiv:1605.04715]
=External Links=
* [https://scholar.google.com/citations?user=yWzT7LAAAAAJ Abdallah Saffidine - Google Scholar Citations]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=560 Abdallah Saffidine's ICGA Tournaments]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:abdallah-saffidine.jpg|border|right|thumb|link=https://scholar.google.com/citations?user=yWzT7LAAAAAJ|Abdallah Saffidine <ref>[https://scholar.google.com/citations?user=yWzT7LAAAAAJ Abdallah Saffidine - Google Scholar Citations]</ref>]]
'''Abdallah Saffidine''',<br/>
a French computer scientist and games researcher, currently at [https://en.wikipedia.org/wiki/University_of_New_South_Wales University of New South Wales].
He hold a Ph.D. from [https://en.wikipedia.org/wiki/Lamsade Lamsade], [[University of Paris#9|Paris Dauphine University]] in 2013 <ref>[[Abdallah Saffidine]] ('''2013'''). ''Solving Games and All That''. Ph.D. thesis, [[University of Paris#9|Université Paris-Dauphine]], advisor [[Tristan Cazenave]]</ref>.
His research interests include [https://en.wikipedia.org/wiki/Linear_temporal_logic Linear temporal logic (LTL)] [https://en.wikipedia.org/wiki/Model_checking model checking], [[Monte-Carlo Tree Search|Monte-Carlo tree search]], [[Proof-Number Search|Proof-number search]] and [[General Game Playing]]. Along with [[Tristan Cazenave]], Abdallah Saffidine is co-author of the [[Hex]] program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=556 Yopt], which performs Monte-Carlo Tree Search.
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Saffidine:Abdallah.html dblp: Abdallah Saffidine]</ref>
==2009==
* [[Abdallah Saffidine]] ('''2009'''). ''[https://www.semanticscholar.org/paper/LTL-Model-Checking-with-use-of-Generalised-and-Saffidine/34cd42ec27580aa479c7b7c86f8c707c3b4abc47 LTL Model Checking with use of Generalised Stuttering and Characteristic Patterns].''
==2010 ...==
* [[Abdallah Saffidine]] ('''2010'''). ''Some Improvements for Monte-Carlo Tree Search, Game Description Language Compilation, Score Bounds and Transpositions''. MSc-Thesis, [https://en.wikipedia.org/wiki/Lamsade Lamsade], [[University of Paris#9|Paris Dauphine University]], advisor [[Tristan Cazenave]]
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Monte-Carlo Hex''. [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/hex.pdf pdf]
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2010'''). ''UCD : Upper Confidence bound for rooted Directed acyclic graphs''. TAAI IWCG
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Score Bounded Monte-Carlo Tree Search''. [[CG 2010]]
'''2011'''
* [[Abdallah Saffidine]] ('''2011'''). ''Moccos wins the Panthom-Go Tournament''. [[ICGA Journal#34_1|ICGA Journal, Vol. 34, No. 1]] » [[15th Computer Olympiad#PanthomGo|15th Computer Olympiad]]
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2011'''). ''Solving breakthrough with Race Patterns and Job-Level Proof Number Search''. [[Advances in Computer Games 13]] » [[Breakthrough (Game)]]
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2011'''). ''A forward chaining based game description language compiler''. [http://movingai.com/giga11/cfp.html GIGA 2011]
'''2012'''
* [[Abdallah Saffidine]] ('''2012'''). ''Minimal Proof Search for Modal Logic K Model Checking''. [http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1207.html#abs-1207-1832 CoRR, July 2012] <ref>[https://en.wikipedia.org/wiki/Modal_logic Modal logic from Wikipedia]</ref>
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2012'''). ''Multiple-Outcome Proof Number Search''. [http://www.informatik.uni-trier.de/~ley/db/conf/ecai/ecai2012.html#SaffidineC12 ECAI 2012] » [[Proof-Number Search]]
* [[Abdallah Saffidine]], [[Hilmar Finnsson]], [[Michael Buro]] ('''2012'''). ''Alpha-Beta Pruning for Games with Simultaneous Moves''. [[AAAI|AAAI 2012]]
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2012'''). ''UCD : Upper confidence bound for rooted directed acyclic graphs''. [http://www.informatik.uni-trier.de/~ley/db/journals/kbs/kbs34.html#SaffidineCM12 Knowledge Based Systems, Vol. 34]
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]] ('''2012'''). ''Sparse Sampling for Adversarial Games''. [[ECAI CGW 2012]]
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2012'''). ''A General Multi-Agent Modal Logic K Framework for Game Tree Search''. [[ECAI CGW 2012]]
'''2013'''
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]], [[Mark Winands]] ('''2013'''). ''Monte Carlo *-Minimax Search''. [[Conferences#IJCAI|IJCAI 2013]]
* [[Abdallah Saffidine]] ('''2013'''). ''The Game Description Language is Turingcomplete''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]]
* [[Abdallah Saffidine]] ('''2013'''). ''Solving Games and All That''. Ph.D. thesis, [[University of Paris#9|Université Paris-Dauphine]], advisor [[Tristan Cazenave]], [http://cgi.cse.unsw.edu.au/~abdallahs/Papers/2013/Solving%20Games%20and%20All%20That.pdf pdf] <ref>[[Dap Hartmann]] ('''2013'''). ''From to αβ to ABCD and SMAB''. Review. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]</ref>
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2013'''). ''Havannah and TwixT are PSPACE-complete''. [[CG 2013]] <ref>[https://en.wikipedia.org/wiki/PSPACE-complete PSPACE-complete from Wikipedia]</ref>
* [[Abdallah Saffidine]], [[Tristan Cazenave]] ('''2013'''). ''Developments on Product Propagation''. [[CG 2013]], [http://www.lamsade.dauphine.fr/~cazenave/papers/probabilitySearch.pdf pdf]
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Cédric Buron]], [[Tristan Cazenave]] ('''2013'''). ''Material Symmetry to Partition Endgame Tables''. [[CG 2013]]
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2013'''). ''On the Complexity of Trick-Taking Card Games''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2013.html#BonnetJS13 IJCAI 2013] <ref>[https://en.wikipedia.org/wiki/Trick-taking_game Trick-taking game from Wikipedia]</ref>
'''2014'''
* [[Edouard Bonnet|Édouard Bonnet]], [[Abdallah Saffidine]] ('''2014'''). ''On the Complexity of General Game Playing''. [[ECAI CGW 2014]]
==2015 ...==
* [[Olivier Teytaud]], [[Abdallah Saffidine]], [[Shi-Jim Yen]] ('''2015'''). ''The complexities of Go''. [[Advances in Computer Games 14]]
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2015'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-27992-3_15 Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game]''. [[Advances in Computer Games 14]]
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2016'''). ''On the Complexity of Connection Games''. [https://arxiv.org/abs/1605.04715 arXiv:1605.04715]
=External Links=
* [https://scholar.google.com/citations?user=yWzT7LAAAAAJ Abdallah Saffidine - Google Scholar Citations]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=560 Abdallah Saffidine's ICGA Tournaments]
=References=
<references />
'''[[People|Up one level]]'''
