25,161
edits
Changes
Created page with "'''Home * People * Helmut Horacek''' FILE:Horacek.JPG|border|right|thumb|link=http://www.flickr.com/photos/trb67/2727805446/| Helmut Horacek <ref>From the..."
'''[[Main Page|Home]] * [[People]] * Helmut Horacek'''
[[FILE:Horacek.JPG|border|right|thumb|link=http://www.flickr.com/photos/trb67/2727805446/| Helmut Horacek <ref>From the workshop on Explanation-aware Computing [http://exact2008.workshop.hm/ ExaCt 2008] in [https://en.wikipedia.org/wiki/Patras Patras], Greece. [http://www.flickr.com/ flickr]</ref> ]]
'''Helmut Horacek''',<br/>
an Austrian computer scientist, mathematician and [[Artificial Intelligence|AI]]-researcher with focus on [https://en.wikipedia.org/wiki/Natural_language_processing natural language processing] affiliated with the [https://en.wikipedia.org/wiki/German_Research_Centre_for_Artificial_Intelligence German Research Centre for Artificial Intelligence], [https://en.wikipedia.org/wiki/Saarbr%C3%BCcken Saarbrücken] <ref>[http://www.bloomsbury.com/author/helmut-horacek Bloomsbury - Helmut Horacek]</ref>, and [https://en.wikipedia.org/wiki/Saarland_University Saarland University]. During the early 80, along with [[Hermann Kaindl]], [[Marcus Wagner]] and [[Roland Schreier]], Helmut Horacek was co-author of the chess program [[Merlin]], competing at various [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]] and two [[World Computer Chess Championship|World Computer Chess Championships]] in the 80s <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=353 Merlin's ICGA Tournaments]</ref>. He is further author of the [[Pawn Endgame]] program [[PawnKing]], which was also subject of his Ph.D. thesis, co-supervised by [[Wilhelm Barth]] from [[Vienna University of Technology]] and [[Mathematician#CChristian|Curt Christian]] from [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna] <ref>[[Helmut Horacek]] ('''1982'''). ''Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken''. Ph.D. thesis, Department of Computer Science, [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna], supervisors [[Mathematician#CChristian|Curt Christian]] (University of Vienna) and [[Wilhelm Barth]] ([[Vienna University of Technology]])</ref>. As elaborated in his 1983 paper <ref>[[Helmut Horacek]] ('''1983'''). ''Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]</ref>, [[PawnKing]] relies on [[Pawn Pattern and Properties|pawn]]- and [[King Pattern|king-pattern]] with [[Bitboards|bitboards]] as well as [[All Shortest Paths|path algorithms]] to guide the [[Search|search]] in his knowledge-based move selection and [[Evaluation|evaluation]] approach.
=Photos=
[[FILE:ACC5.jpg|none|border|text-bottom|660px]]
[[Advances in Computer Chess 5]] Smalltalk:<br/>[[Hans Berliner]], [[Hermann Kaindl]], [[Helmut Horacek]], [[Adriaan de Groot]] and [[Reiner Seidel]] <ref>Photo by [[László Lindner]], [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]], pp. 117</ref>
=See also=
* [[Merlin]]
* [[PawnKing]]
* [[Vienna University of Technology]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://dblp.uni-trier.de/pers/hd/h/Horacek:Helmut dblp: Helmut Horacek]</ref>
==1980 ...==
* [[Helmut Horacek]], [[Marcus Wagner]] ('''1981'''). ''Das Schachprogramm Merlin, Verbesserung von Laufzeit-Effizient, Eröffnungsbibliothek und Bewertungsfunktion.'' 4. Tagung "Berichte aus Informatik-Instituten" (German) <ref>[[Werner DePauli-Schimanovich-Göttig|Werner DePauli-Schimanovich]] ('''2006'''). ''[http://www.trauner.at/buchdetail.aspx?artnr=20199541 Europolis 6]''. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, [http://www.trauner.at/Default.aspx Universitätsverlag Rudolf Trauner], ISBN 978-3-85487-946-6, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), [http://books.google.com/books?id=Gf4WibmHVbcC&pg=PA175&lpg=PA175&source=bl&ots=YPtaHAp3Z4&sig=DNRPh11heo8Q1zS3UOBe0qoCF-8&hl=en&ei=0GmnTMX1GMfJswaL-NivDA&sa=X&oi=book_result&ct=result&resnum=1&ved=0CBgQ6AEwAA#v=onepage&q&f=false Google Books]</ref>
* [[Helmut Horacek]], [[Marcus Wagner]] ('''1982'''). ''Das Programm Merlin - Unterschiede zu konventionellen Schachprogrammen''. [http://www.oegai.at/journal.shtml OeGAI Journal], 1982 (German)
* [[Helmut Horacek]] ('''1982'''). ''Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken''. Ph.D. thesis, Department of Computer Science, [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna], supervisors [[Mathematician#CChristian|Curt Christian]] (University of Vienna) and [[Wilhelm Barth]] ([[Vienna University of Technology]]).
* [[Helmut Horacek]] ('''1982'''). ''Construction of Planned Move Trees for Chess Pawn Endings''. Sigart Newsletter 80, pp. 163-168.
* [[Helmut Horacek]] ('''1983'''). ''Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[Helmut Horacek]] ('''1984'''). ''Some Conceptual Defects of Evaluation Functions''. [http://dl.acm.org/citation.cfm?id=537320 ECAI-84], [https://en.wikipedia.org/wiki/Pisa Pisa], [https://en.wikipedia.org/wiki/Elsevier Elsevier]
* [[Helmut Horacek]] ('''1986'''). ''The Fifth World Computer Chess Championship''. [[ICGA Journal#9_2|ICCA Journal, Vol. 9, No. 2]]
* [[Helmut Horacek]] ('''1986, 1989'''). ''The Fifth World Computer Chess Championship Cologne, 1986''. Research Unit for Information Science and Artificial Intelligence, [[University of Hamburg]] from [http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] pg 21, [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf] from [[The Computer History Museum]] (Abridged from ICGA Journal, Vol. 9, No. 2)
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1988'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details.'' Tech. Report #50, Department of Statistics and Computer Science, [[Vienna University of Technology]], Austria.
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1989'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[Helmut Horacek]] ('''1989'''). ''Reasoning with Uncertainty in Computer Chess.'' [[Advances in Computer Chess 5]]
==1990 ...==
* [http://dblp.uni-trier.de/pers/hd/b/Block:Russel Russel Block], [[Helmut Horacek]] ('''1990'''). ''Generating Referring Expressions using Multiple Knowledge Sources.'' COLING-90 (ed. H. Karlgen), Vol. 2, pp. 24-29, Helsinki.
* [[Hermann Kaindl]], [[Reza Shams]], [[Helmut Horacek]] ('''1991'''). ''[http://portal.acm.org/citation.cfm?id=123034 Minimax Search Algorithms with and without Aspiration Windows].'' [[IEEE#TPAMI|IEEE Transactions on Pattern Analysis and Machine Intelligence]], Vol. 13, No. 12
* [[Reza Shams]], [[Hermann Kaindl]], [[Helmut Horacek]] ('''1991'''). ''Using Aspiration Windows for Minimax Algorithms''. [[Conferences#IJCAI1991|IJCAI 1991]], [http://ijcai.org/Proceedings/91-1/Papers/031.pdf pdf]
* [[Helmut Horacek]] ('''1993'''). ''Computer Chess, its Impact on Artificial Intelligence.'' [[ICGA Journal#16_1|ICCA Journal, Vol. 16, No. 1]] » [[WCCC 1992#Workshop|WCCC 1992 - Workshop]]
==2000 ...==
* [[Helmut Horacek]] ('''2000'''). ''[http://frontiersinai.com/ecai/ecai2000/p0604.html Towards Understanding Conceptual Differences Between Minimaxing and Product-Propagation]''. [http://frontiersinai.com/ecai/ecai2000/index.html ECAI 2000],
* [[Helmut Horacek]] ('''2003'''). ''A Best-First Search Algorithm for Generating Referring Expressions''. [http://www.conferences.hu/EACL03/ EACL 2003]
* [[Helmut Horacek]] ('''2008'''). ''Towards Designing Operationalizable Models of Man-Machine Interaction Based on Concepts from Human Dialog Systems''. [http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=1957 NLDB 2008]
* [[Helmut Horacek]] ('''2008'''). ''A High-Level Categorization of Explanation A Case Study with a Tutoring System''. [http://dblp.uni-trier.de/db/conf/exact/exact2008.html#Horacek08 ExaCt 2008]
==2010 ...==
* [http://dblp.uni-trier.de/pers/hd/h/Haque:Florin Florin Haque], [[Helmut Horacek]] ('''2015'''). ''Generating Referential Descriptions Involving Relations by a Best-First Searching Procedure – A System Demo''. [http://enlg2015.imag.fr/?page_id=68 ENLG 2015 ], [https://aclweb.org/anthology/W/W15/W15-4721.pdf pdf]
=External Links=
* [http://www.bloomsbury.com/author/helmut-horacek Bloomsbury - Helmut Horacek]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=378 Helmut Horacek's ICGA Tournaments]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:Horacek.JPG|border|right|thumb|link=http://www.flickr.com/photos/trb67/2727805446/| Helmut Horacek <ref>From the workshop on Explanation-aware Computing [http://exact2008.workshop.hm/ ExaCt 2008] in [https://en.wikipedia.org/wiki/Patras Patras], Greece. [http://www.flickr.com/ flickr]</ref> ]]
'''Helmut Horacek''',<br/>
an Austrian computer scientist, mathematician and [[Artificial Intelligence|AI]]-researcher with focus on [https://en.wikipedia.org/wiki/Natural_language_processing natural language processing] affiliated with the [https://en.wikipedia.org/wiki/German_Research_Centre_for_Artificial_Intelligence German Research Centre for Artificial Intelligence], [https://en.wikipedia.org/wiki/Saarbr%C3%BCcken Saarbrücken] <ref>[http://www.bloomsbury.com/author/helmut-horacek Bloomsbury - Helmut Horacek]</ref>, and [https://en.wikipedia.org/wiki/Saarland_University Saarland University]. During the early 80, along with [[Hermann Kaindl]], [[Marcus Wagner]] and [[Roland Schreier]], Helmut Horacek was co-author of the chess program [[Merlin]], competing at various [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]] and two [[World Computer Chess Championship|World Computer Chess Championships]] in the 80s <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=353 Merlin's ICGA Tournaments]</ref>. He is further author of the [[Pawn Endgame]] program [[PawnKing]], which was also subject of his Ph.D. thesis, co-supervised by [[Wilhelm Barth]] from [[Vienna University of Technology]] and [[Mathematician#CChristian|Curt Christian]] from [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna] <ref>[[Helmut Horacek]] ('''1982'''). ''Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken''. Ph.D. thesis, Department of Computer Science, [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna], supervisors [[Mathematician#CChristian|Curt Christian]] (University of Vienna) and [[Wilhelm Barth]] ([[Vienna University of Technology]])</ref>. As elaborated in his 1983 paper <ref>[[Helmut Horacek]] ('''1983'''). ''Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]</ref>, [[PawnKing]] relies on [[Pawn Pattern and Properties|pawn]]- and [[King Pattern|king-pattern]] with [[Bitboards|bitboards]] as well as [[All Shortest Paths|path algorithms]] to guide the [[Search|search]] in his knowledge-based move selection and [[Evaluation|evaluation]] approach.
=Photos=
[[FILE:ACC5.jpg|none|border|text-bottom|660px]]
[[Advances in Computer Chess 5]] Smalltalk:<br/>[[Hans Berliner]], [[Hermann Kaindl]], [[Helmut Horacek]], [[Adriaan de Groot]] and [[Reiner Seidel]] <ref>Photo by [[László Lindner]], [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]], pp. 117</ref>
=See also=
* [[Merlin]]
* [[PawnKing]]
* [[Vienna University of Technology]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://dblp.uni-trier.de/pers/hd/h/Horacek:Helmut dblp: Helmut Horacek]</ref>
==1980 ...==
* [[Helmut Horacek]], [[Marcus Wagner]] ('''1981'''). ''Das Schachprogramm Merlin, Verbesserung von Laufzeit-Effizient, Eröffnungsbibliothek und Bewertungsfunktion.'' 4. Tagung "Berichte aus Informatik-Instituten" (German) <ref>[[Werner DePauli-Schimanovich-Göttig|Werner DePauli-Schimanovich]] ('''2006'''). ''[http://www.trauner.at/buchdetail.aspx?artnr=20199541 Europolis 6]''. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, [http://www.trauner.at/Default.aspx Universitätsverlag Rudolf Trauner], ISBN 978-3-85487-946-6, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), [http://books.google.com/books?id=Gf4WibmHVbcC&pg=PA175&lpg=PA175&source=bl&ots=YPtaHAp3Z4&sig=DNRPh11heo8Q1zS3UOBe0qoCF-8&hl=en&ei=0GmnTMX1GMfJswaL-NivDA&sa=X&oi=book_result&ct=result&resnum=1&ved=0CBgQ6AEwAA#v=onepage&q&f=false Google Books]</ref>
* [[Helmut Horacek]], [[Marcus Wagner]] ('''1982'''). ''Das Programm Merlin - Unterschiede zu konventionellen Schachprogrammen''. [http://www.oegai.at/journal.shtml OeGAI Journal], 1982 (German)
* [[Helmut Horacek]] ('''1982'''). ''Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken''. Ph.D. thesis, Department of Computer Science, [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna], supervisors [[Mathematician#CChristian|Curt Christian]] (University of Vienna) and [[Wilhelm Barth]] ([[Vienna University of Technology]]).
* [[Helmut Horacek]] ('''1982'''). ''Construction of Planned Move Trees for Chess Pawn Endings''. Sigart Newsletter 80, pp. 163-168.
* [[Helmut Horacek]] ('''1983'''). ''Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[Helmut Horacek]] ('''1984'''). ''Some Conceptual Defects of Evaluation Functions''. [http://dl.acm.org/citation.cfm?id=537320 ECAI-84], [https://en.wikipedia.org/wiki/Pisa Pisa], [https://en.wikipedia.org/wiki/Elsevier Elsevier]
* [[Helmut Horacek]] ('''1986'''). ''The Fifth World Computer Chess Championship''. [[ICGA Journal#9_2|ICCA Journal, Vol. 9, No. 2]]
* [[Helmut Horacek]] ('''1986, 1989'''). ''The Fifth World Computer Chess Championship Cologne, 1986''. Research Unit for Information Science and Artificial Intelligence, [[University of Hamburg]] from [http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] pg 21, [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1989_WCCC/1989%20WCCC.062302028.sm.pdf pdf] from [[The Computer History Museum]] (Abridged from ICGA Journal, Vol. 9, No. 2)
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1988'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details.'' Tech. Report #50, Department of Statistics and Computer Science, [[Vienna University of Technology]], Austria.
* [[Hermann Kaindl]], [[Marcus Wagner]], [[Helmut Horacek]] ('''1989'''). ''Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[Helmut Horacek]] ('''1989'''). ''Reasoning with Uncertainty in Computer Chess.'' [[Advances in Computer Chess 5]]
==1990 ...==
* [http://dblp.uni-trier.de/pers/hd/b/Block:Russel Russel Block], [[Helmut Horacek]] ('''1990'''). ''Generating Referring Expressions using Multiple Knowledge Sources.'' COLING-90 (ed. H. Karlgen), Vol. 2, pp. 24-29, Helsinki.
* [[Hermann Kaindl]], [[Reza Shams]], [[Helmut Horacek]] ('''1991'''). ''[http://portal.acm.org/citation.cfm?id=123034 Minimax Search Algorithms with and without Aspiration Windows].'' [[IEEE#TPAMI|IEEE Transactions on Pattern Analysis and Machine Intelligence]], Vol. 13, No. 12
* [[Reza Shams]], [[Hermann Kaindl]], [[Helmut Horacek]] ('''1991'''). ''Using Aspiration Windows for Minimax Algorithms''. [[Conferences#IJCAI1991|IJCAI 1991]], [http://ijcai.org/Proceedings/91-1/Papers/031.pdf pdf]
* [[Helmut Horacek]] ('''1993'''). ''Computer Chess, its Impact on Artificial Intelligence.'' [[ICGA Journal#16_1|ICCA Journal, Vol. 16, No. 1]] » [[WCCC 1992#Workshop|WCCC 1992 - Workshop]]
==2000 ...==
* [[Helmut Horacek]] ('''2000'''). ''[http://frontiersinai.com/ecai/ecai2000/p0604.html Towards Understanding Conceptual Differences Between Minimaxing and Product-Propagation]''. [http://frontiersinai.com/ecai/ecai2000/index.html ECAI 2000],
* [[Helmut Horacek]] ('''2003'''). ''A Best-First Search Algorithm for Generating Referring Expressions''. [http://www.conferences.hu/EACL03/ EACL 2003]
* [[Helmut Horacek]] ('''2008'''). ''Towards Designing Operationalizable Models of Man-Machine Interaction Based on Concepts from Human Dialog Systems''. [http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=1957 NLDB 2008]
* [[Helmut Horacek]] ('''2008'''). ''A High-Level Categorization of Explanation A Case Study with a Tutoring System''. [http://dblp.uni-trier.de/db/conf/exact/exact2008.html#Horacek08 ExaCt 2008]
==2010 ...==
* [http://dblp.uni-trier.de/pers/hd/h/Haque:Florin Florin Haque], [[Helmut Horacek]] ('''2015'''). ''Generating Referential Descriptions Involving Relations by a Best-First Searching Procedure – A System Demo''. [http://enlg2015.imag.fr/?page_id=68 ENLG 2015 ], [https://aclweb.org/anthology/W/W15/W15-4721.pdf pdf]
=External Links=
* [http://www.bloomsbury.com/author/helmut-horacek Bloomsbury - Helmut Horacek]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=378 Helmut Horacek's ICGA Tournaments]
=References=
<references />
'''[[People|Up one level]]'''
