Difference between revisions of "Matthew L. Ginsberg"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Matthew L. Ginsberg''' FILE:Matthew_Ginsberg.jpg|border|right|thumb|link=https://www.lybrary.com/matthew-ginsberg-m-243.html| Matthew...") |
GerdIsenberg (talk | contribs) |
||
| (5 intermediate revisions by the same user not shown) | |||
| Line 5: | Line 5: | ||
'''Matthew L. Ginsberg''',<br/> | '''Matthew L. Ginsberg''',<br/> | ||
an American computer scientist, mathematician, and computer [[Games|games]] and [[Bridge]] programmer. | an American computer scientist, mathematician, and computer [[Games|games]] and [[Bridge]] programmer. | ||
| − | He holds a Ph.D. in mathematics from [https://en.wikipedia.org/wiki/University_of_Oxford University of Oxford] in 1980 | + | He holds a Ph.D. in mathematics from [https://en.wikipedia.org/wiki/University_of_Oxford University of Oxford] in 1980 <ref>[http://www.cirl.uoregon.edu/~ginsberg/ Matthew L. Ginsberg]</ref>, |
| − | and researcher and professor at [[Stanford University]] and [https://en.wikipedia.org/wiki/University_of_Oregon University of Oregon]. | + | and is researcher and professor at [[Stanford University]] and [https://en.wikipedia.org/wiki/University_of_Oregon University of Oregon]. |
In 1992, at the University of Oregon, Ginsberg founded ''The Computational Intelligence Research Laboratory'' (CIRL) <ref>[http://www.cirl.uoregon.edu/ Computational Intelligence Research Laboratory]</ref>, | In 1992, at the University of Oregon, Ginsberg founded ''The Computational Intelligence Research Laboratory'' (CIRL) <ref>[http://www.cirl.uoregon.edu/ Computational Intelligence Research Laboratory]</ref>, | ||
and since 1998 he is [https://en.wikipedia.org/wiki/Chief_executive_officer CEO] of ''On Time Systems'', an advanced-technology company specializing in software for optimization of complex industrial problems <ref>[https://www.otsys.com/ On Time Systems, Inc.]</ref>. | and since 1998 he is [https://en.wikipedia.org/wiki/Chief_executive_officer CEO] of ''On Time Systems'', an advanced-technology company specializing in software for optimization of complex industrial problems <ref>[https://www.otsys.com/ On Time Systems, Inc.]</ref>. | ||
| − | His research interests include the fields of [[Artificial Intelligence|artificial intelligence]] and [https://en.wikipedia.org/wiki/Mathematical_optimization mathematical optimization] with focus on [https://en.wikipedia.org/wiki/Constraint_satisfaction constraint satisfaction] and [[Search|search]]. | + | His research interests include the fields of [[Artificial Intelligence|artificial intelligence]] and [https://en.wikipedia.org/wiki/Mathematical_optimization mathematical optimization] with focus on [https://en.wikipedia.org/wiki/Constraint_satisfaction constraint satisfaction] and [[Search|search]]. Matthew L. Ginsberg is a [[:Category:Stockfish Contributor|Stockfish Contributor]] <ref>[https://github.com/official-stockfish/Stockfish/commits?author=mattginsberg Commits · official-stockfish/Stockfish · GitHub] Commits by Matt Ginsberg</ref> <ref>[https://www.chess.com/news/view/chessbase-fat-fritz-2-stockfish-leela-chess-zero Open Source Community Critical Of Chessbase, Fat Fritz 2] by [[Peter Doggers]], [[Chess.com]], February 24, 2021 » [[Fat Fritz#Fat Fritz 2|Fat Fritz 2]]</ref>. |
=Essentials of AI= | =Essentials of AI= | ||
| − | While affiliated with Stanford University in the early 90s, Matthew Ginsberg authored ''Essentials of Artificial Intelligence'' <ref>[[Matthew L. Ginsberg]] ('''1993'''). ''[ | + | While affiliated with Stanford University in the early 90s, Matthew Ginsberg authored ''Essentials of Artificial Intelligence'' <ref>[[Matthew L. Ginsberg]] ('''1993'''). ''[https://searchworks.stanford.edu/view/2746445 Essentials of artificial intelligence]''. [https://en.wikipedia.org/wiki/Morgan_Kaufmann_Publishers Morgan Kaufmann Publishers]</ref> offering introductory [[Artificial Intelligence|AI]] courses at the [https://en.wikipedia.org/wiki/Graduate graduate] and [https://en.wikipedia.org/wiki/Undergraduate_education undergraduate] levels. |
=Games= | =Games= | ||
| Line 30: | Line 30: | ||
==1985 ...== | ==1985 ...== | ||
* [[Matthew L. Ginsberg]] ('''1985, 2013'''). ''Implementing Probabilistic Reasoning''. [https://dblp.uni-trier.de/db/conf/uai/uai1985.html UAI 1985], [https://arxiv.org/abs/1304.3428 arXiv:1304.3428] | * [[Matthew L. Ginsberg]] ('''1985, 2013'''). ''Implementing Probabilistic Reasoning''. [https://dblp.uni-trier.de/db/conf/uai/uai1985.html UAI 1985], [https://arxiv.org/abs/1304.3428 arXiv:1304.3428] | ||
| + | * [[Michael Genesereth]], [[Matthew L. Ginsberg]] ('''1985'''). ''[https://dl.acm.org/citation.cfm?id=4287 Logic Programming]''. [[ACM#Communications|Communications of the ACM]], Vol. 28, No. 9 | ||
| + | * [[Michael Genesereth]], [[Matthew L. Ginsberg]], [[Mathematician#JSRosenschein|Jeffrey S. Rosenschein]] ('''1986'''). ''Cooperation without Communication''. [[Conferences#AAAI-86|AAAI 86]], [http://logic.stanford.edu/publications/genesereth/cooperation.pdf pdf] | ||
* [[Matthew L. Ginsberg]] ('''1986'''). ''Multi-Valued Logics''. [[Conferences#AAAI-86|AAAI 86]], [https://www.aaai.org/Papers/AAAI/1986/AAAI86-040.pdf pdf] | * [[Matthew L. Ginsberg]] ('''1986'''). ''Multi-Valued Logics''. [[Conferences#AAAI-86|AAAI 86]], [https://www.aaai.org/Papers/AAAI/1986/AAAI86-040.pdf pdf] | ||
* [[Matthew L. Ginsberg]] ('''1988'''). ''[https://www.aaai.org/Library/AAAI/1988/aaai88-083.php A Circumscriptive Theorem Prover]''. [[Conferences#AAAI-88|AAAI 88]] | * [[Matthew L. Ginsberg]] ('''1988'''). ''[https://www.aaai.org/Library/AAAI/1988/aaai88-083.php A Circumscriptive Theorem Prover]''. [[Conferences#AAAI-88|AAAI 88]] | ||
| Line 38: | Line 40: | ||
* [[Matthew L. Ginsberg]] ('''1993'''). ''[https://searchworks.stanford.edu/view/2746445 Essentials of artificial intelligence]''. [https://en.wikipedia.org/wiki/Morgan_Kaufmann_Publishers Morgan Kaufmann Publishers] | * [[Matthew L. Ginsberg]] ('''1993'''). ''[https://searchworks.stanford.edu/view/2746445 Essentials of artificial intelligence]''. [https://en.wikipedia.org/wiki/Morgan_Kaufmann_Publishers Morgan Kaufmann Publishers] | ||
* [[Matthew L. Ginsberg]], [[David McAllester]] ('''1994'''). ''[https://link.springer.com/chapter/10.1007/3-540-58601-6_105 GSAT and Dynamic Backtracking]''. [https://dblp.uni-trier.de/db/conf/kr/kr94.html KR 1994] <ref>[https://en.wikipedia.org/wiki/WalkSAT WalkSAT from Wikipedia]</ref> » [[Backtracking]] | * [[Matthew L. Ginsberg]], [[David McAllester]] ('''1994'''). ''[https://link.springer.com/chapter/10.1007/3-540-58601-6_105 GSAT and Dynamic Backtracking]''. [https://dblp.uni-trier.de/db/conf/kr/kr94.html KR 1994] <ref>[https://en.wikipedia.org/wiki/WalkSAT WalkSAT from Wikipedia]</ref> » [[Backtracking]] | ||
| − | * [[Mathematician#WDHarvey|William D. Harvey]], [[Matthew L. Ginsberg]] ('''1995'''). ''Limited Discrepancy Search''. [[Conferences#IJCAI1995|IJCAI 1995], [https://ai.dmi.unibas.ch/research/reading_group/harvey-ginsberg-ijcai1995.pdf pdf] | + | * [[Mathematician#WDHarvey|William D. Harvey]], [[Matthew L. Ginsberg]] ('''1995'''). ''Limited Discrepancy Search''. [[Conferences#IJCAI1995|IJCAI 1995]], [https://ai.dmi.unibas.ch/research/reading_group/harvey-ginsberg-ijcai1995.pdf pdf] |
* [[Matthew L. Ginsberg]] ('''1996'''). ''Partition Search''. [[Conferences#AAAI-96|AAAI 96]], [https://www.aaai.org/Papers/AAAI/1996/AAAI96-034.pdf pdf] | * [[Matthew L. Ginsberg]] ('''1996'''). ''Partition Search''. [[Conferences#AAAI-96|AAAI 96]], [https://www.aaai.org/Papers/AAAI/1996/AAAI96-034.pdf pdf] | ||
* [[Matthew L. Ginsberg]] ('''1999'''). ''GIB: Steps Toward an Expert-Level Bridge-Playing Program''. [[Conferences#IJCAI1999|IJCAI 1999]], [https://www.ijcai.org/Proceedings/99-1/Papers/084.pdf pdf] | * [[Matthew L. Ginsberg]] ('''1999'''). ''GIB: Steps Toward an Expert-Level Bridge-Playing Program''. [[Conferences#IJCAI1999|IJCAI 1999]], [https://www.ijcai.org/Proceedings/99-1/Papers/084.pdf pdf] | ||
==2000 ...== | ==2000 ...== | ||
| − | * [[Matthew L. Ginsberg]] ('''2001, 2011'''). ''[https://www.jair.org/index.php/jair/article/view/10279 GIB: Imperfect Information in a Computationally Challenging Game]''. https://www.jair.org/index.php/jair/issue/view/1098 JAIR Vol. 14] [https://arxiv.org/abs/1106.0669 arXiv:1106.0669] | + | * [[Matthew L. Ginsberg]] ('''2001, 2011'''). ''[https://www.jair.org/index.php/jair/article/view/10279 GIB: Imperfect Information in a Computationally Challenging Game]''. [https://www.jair.org/index.php/jair/issue/view/1098 JAIR Vol. 14] [https://arxiv.org/abs/1106.0669 arXiv:1106.0669] |
* [[Matthew L. Ginsberg]], [[Alan Jaffray]] ('''2002'''). ''Alpha-Beta Pruning Under Partial Orders''. in [[Richard J. Nowakowski]] (ed.) ''[http://library.msri.org/books/Book42/ More Games of No Chance]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press], [http://library.msri.org/books/Book42/files/ginsberg.pdf pdf] | * [[Matthew L. Ginsberg]], [[Alan Jaffray]] ('''2002'''). ''Alpha-Beta Pruning Under Partial Orders''. in [[Richard J. Nowakowski]] (ed.) ''[http://library.msri.org/books/Book42/ More Games of No Chance]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press], [http://library.msri.org/books/Book42/files/ginsberg.pdf pdf] | ||
* [[Mathematician#HEDixon|Heidi E. Dixon]], [[Matthew L. Ginsberg]], [[Mathematician#AJParkes|Andrew J. Parkes]] ('''2004, 2011'''). ''[https://www.jair.org/index.php/jair/article/view/10369 Generalizing Boolean Satisfiability I: Background and Survey of Existing Work]''. [https://www.jair.org/index.php/jair/issue/view/1105 JAIR Vol. 21], [https://arxiv.org/abs/1107.0040 arXiv:1107.0040] | * [[Mathematician#HEDixon|Heidi E. Dixon]], [[Matthew L. Ginsberg]], [[Mathematician#AJParkes|Andrew J. Parkes]] ('''2004, 2011'''). ''[https://www.jair.org/index.php/jair/article/view/10369 Generalizing Boolean Satisfiability I: Background and Survey of Existing Work]''. [https://www.jair.org/index.php/jair/issue/view/1105 JAIR Vol. 21], [https://arxiv.org/abs/1107.0040 arXiv:1107.0040] | ||
| Line 58: | Line 60: | ||
* [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=71300 The Mathematics Genealogy Project - Matthew Ginsberg] | * [http://www.genealogy.math.ndsu.nodak.edu/id.php?id=71300 The Mathematics Genealogy Project - Matthew Ginsberg] | ||
* [https://www.lybrary.com/matthew-ginsberg-m-243.html Matthew L. Ginsberg] at [http://www.lybrary.com/ lybrary.com] | * [https://www.lybrary.com/matthew-ginsberg-m-243.html Matthew L. Ginsberg] at [http://www.lybrary.com/ lybrary.com] | ||
| − | |||
=References= | =References= | ||
| Line 66: | Line 67: | ||
[[Category:Programmer|Ginsberg]] | [[Category:Programmer|Ginsberg]] | ||
[[Category:Bridge Programmer|Ginsberg]] | [[Category:Bridge Programmer|Ginsberg]] | ||
| + | [[Category:Chess Programmer|Ginsberg]] | ||
[[Category:Researcher|Ginsberg]] | [[Category:Researcher|Ginsberg]] | ||
| + | [[Category:Stockfish Contributor|Ginsberg]] | ||
Latest revision as of 12:08, 26 February 2021
Home * People * Matthew L. Ginsberg
Matthew L. Ginsberg [1]
Matthew L. Ginsberg,
an American computer scientist, mathematician, and computer games and Bridge programmer.
He holds a Ph.D. in mathematics from University of Oxford in 1980 [2],
and is researcher and professor at Stanford University and University of Oregon.
In 1992, at the University of Oregon, Ginsberg founded The Computational Intelligence Research Laboratory (CIRL) [3],
and since 1998 he is CEO of On Time Systems, an advanced-technology company specializing in software for optimization of complex industrial problems [4].
His research interests include the fields of artificial intelligence and mathematical optimization with focus on constraint satisfaction and search. Matthew L. Ginsberg is a Stockfish Contributor [5] [6].
Contents
Essentials of AI
While affiliated with Stanford University in the early 90s, Matthew Ginsberg authored Essentials of Artificial Intelligence [7] offering introductory AI courses at the graduate and undergraduate levels.
Games
GIB
Ginsberg's Intelligent Bridgeplayer GIB was the world's first expert-level bridge-playing program, performing a double-dummy partition search. GIB was World Computer-Bridge Champion in 1998 and 1999.
Dr.Fill
Matthew Ginsberg is further author of the American-style crossword puzzle solver Dr.Fill, which works by converting a crossword to a weighted constraint satisfaction problem and then attempting to maximize the probability that the fill is correct [8].
See also
- Proverb by Michael L. Littman et al.
Selected Publications
1985 ...
- Matthew L. Ginsberg (1985, 2013). Implementing Probabilistic Reasoning. UAI 1985, arXiv:1304.3428
- Michael Genesereth, Matthew L. Ginsberg (1985). Logic Programming. Communications of the ACM, Vol. 28, No. 9
- Michael Genesereth, Matthew L. Ginsberg, Jeffrey S. Rosenschein (1986). Cooperation without Communication. AAAI 86, pdf
- Matthew L. Ginsberg (1986). Multi-Valued Logics. AAAI 86, pdf
- Matthew L. Ginsberg (1988). A Circumscriptive Theorem Prover. AAAI 88
1990 ...
- Matthew L. Ginsberg, William D. Harvey (1990). Iterative Broadening. AAAI 90, pdf
- Matthew L. Ginsberg (1991). Marvin Minsky, The Society of Mind. Artificial Intelligence, Vol. 48 » Marvin Minsky [10]
- Matthew L. Ginsberg (1993). Dynamic Backtracking. JAIR Vol. 1, arXiv:cs/9308101 » Backtracking
- Matthew L. Ginsberg (1993). Essentials of artificial intelligence. Morgan Kaufmann Publishers
- Matthew L. Ginsberg, David McAllester (1994). GSAT and Dynamic Backtracking. KR 1994 [11] » Backtracking
- William D. Harvey, Matthew L. Ginsberg (1995). Limited Discrepancy Search. IJCAI 1995, pdf
- Matthew L. Ginsberg (1996). Partition Search. AAAI 96, pdf
- Matthew L. Ginsberg (1999). GIB: Steps Toward an Expert-Level Bridge-Playing Program. IJCAI 1999, pdf
2000 ...
- Matthew L. Ginsberg (2001, 2011). GIB: Imperfect Information in a Computationally Challenging Game. JAIR Vol. 14 arXiv:1106.0669
- Matthew L. Ginsberg, Alan Jaffray (2002). Alpha-Beta Pruning Under Partial Orders. in Richard J. Nowakowski (ed.) More Games of No Chance. Cambridge University Press, pdf
- Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes (2004, 2011). Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. JAIR Vol. 21, arXiv:1107.0040
- Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks , Andrew J. Parkes (2004, 2011). Generalizing Boolean Satisfiability II: Theory. JAIR Vol. 22, arXiv:1109.2134
- Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks , Andrew J. Parkes (2005, 2011). Generalizing Boolean Satisfiability III: Implementation. JAIR Vol. 23, arXiv:1109.2142
- Matthew L. Ginsberg (2007). Of Mousetraps and Men: A Cautionary Tale. CP 2007, Vol. 2
2010 ...
- Matthew L. Ginsberg (2011). GIB: Imperfect Information in a Computationally Challenging Game. arXiv:1106.0669
- Matthew L. Ginsberg (2011, 2014). Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs. JAIR Vol. 42, arXiv:1401.4597
- Matthew L. Ginsberg (2012). The Crossword Solver DR.FILL. ICGA Journal, Vol. 35, No. 2
- Matthew L. Ginsberg (2015). Satsisfiability and Systematicity. JAIR Vol. 53
External Links
- Matthew L. Ginsberg
- The Mathematics Genealogy Project - Matthew Ginsberg
- Matthew L. Ginsberg at lybrary.com
References
- ↑ Matthew L. Ginsberg at lybrary.com
- ↑ Matthew L. Ginsberg
- ↑ Computational Intelligence Research Laboratory
- ↑ On Time Systems, Inc.
- ↑ Commits · official-stockfish/Stockfish · GitHub Commits by Matt Ginsberg
- ↑ Open Source Community Critical Of Chessbase, Fat Fritz 2 by Peter Doggers, Chess.com, February 24, 2021 » Fat Fritz 2
- ↑ Matthew L. Ginsberg (1993). Essentials of artificial intelligence. Morgan Kaufmann Publishers
- ↑ Matthew L. Ginsberg (2012). The Crossword Solver DR.FILL. ICGA Journal, Vol. 35, No. 2
- ↑ dblp: Matthew L. Ginsberg
- ↑ Society of Mind from Wikipedia
- ↑ WalkSAT from Wikipedia
