dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Marina Langlois Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Langlois, Robert H. Sloan: Reinforcement learning via approximation of the Q-function. J. Exp. Theor. Artif. Intell. 22(3): 219-235 (2010)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Langlois, Robert H. Sloan, György Turán: Horn Upper Bounds and Renaming. JSAT 7(1): 1-15 (2010)
2009
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán: Combinatorial Problems for Horn Clauses. Graph Theory, Computational Intelligence and Thought 2009: 54-65
2008
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán: Horn Complements: Towards Horn-to-Horn Belief Revision. AAAI 2008: 466-471
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán: Combinatorial problems for Horn clauses. ISAIM 2008
2007
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Langlois, Robert H. Sloan, György Turán: Horn Upper Bounds and Renaming. SAT 2007: 80-93
2006
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Langlois, Robert H. Sloan, György Turán: Horn Upper Bounds of Random 3-CNF: A Computational Study. ISAIM 2006

Coauthor Index

1Dhruv Mubayi [3] [5]
2Robert H. Sloan [1] [2] [3] [4] [5] [6] [7]
3Balázs Szörényi [4]
4György Turán [1] [2] [3] [4] [5] [6]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page