Older Version
Newer Version
GerdIsenberg
Aug 16, 2017
**[[Home]] * [[People]] * Ivan Bratko**
|| [[image:bratko.jpg link="http://www.ailab.si/ivan/novice.php"]] ||~ || **Ivan Bratko**,
a Slovenian computer scientist and researcher in [[Artificial Intelligence|artificial intelligence]] and computer chess, Professor at the Faculty of Computer and Information Science [[University of Ljubljana]]. In 1982, at the [[University of Edinburgh]], Ivan Bratko and [[Danny Kopec]] designed the [[Bratko-Kopec Test]] <ref>[[http://www.kopecchess.com/bratko.html|The Kopec Chess Services]]</ref><ref>[[http://groups.google.com/group/rec.games.chess.misc/browse_frm/thread/39e2b493928369fe#|Sanny: Some test positions for you]] post in [[http://groups.google.com/group/rec.games.chess.misc/topics|rec.games.chess.misc]] August 18, 2008</ref> ||
|| Ivan Bratko <ref>[[http://www.ailab.si/ivan/novice.php|Ivan Bratko's Homepage]]</ref> ||~ ||^ ||
[[toc]]
=Quotes=
==Research Interests==
Quote from Ivan Bratko's Homepage <ref>[[http://www.ailab.si/ivan/novice.php|Ivan Bratko's Homepage]]</ref>:
|| {{Professor Bratko has conducted research in [[Learning|machine learning]], [[Knowledge|knowledge-based systems]], [[http://en.wikipedia.org/wiki/Economic_model#Quantitative_vs._Qualitative_models|qualitative modeling]], [[Robots|intelligent robotics]], heuristic programming and computer chess. His main interests in machine learning have been in learning from [[http://en.wikipedia.org/wiki/Statistical_noise|noisy]] data, combining learning and [[http://en.wikipedia.org/wiki/Qualitative_reasoning|qualitative reasoning]], [[http://en.wikipedia.org/wiki/Constructive_induction|constructive induction]], [[http://en.wikipedia.org/wiki/Inductive_logic_programming|Inductive Logic Programming]] and various applications of machine learning, including [[http://en.wikipedia.org/wiki/Medicine|medicine]] and control of [[http://en.wikipedia.org/wiki/Dynamical_system|dynamic systems]].}} ||
==Chess Endgames==
Quote by [[Maarten van Emden]] in //I remember [[Donald Michie]]// <ref>[[http://vanemden.wordpress.com/2009/06/12/i-remember-donald-michie-1923-2007/|I remember Donald Michie (1923 – 2007) « A Programmers Place]] by [[Maarten van Emden]], June 12, 2009</ref>:
|| {{In 1980 I spent another summer in Edinburgh as a guest of [[Donald Michie]]. Since the low point of 1975, thanks to assiduous and inventive joint pursuit of funding possibilities by Donald and [[Jean Hayes Michie|Jean]], the Machine Intelligence Research Unit was alive with work focused on [[Endgame|chess endgames]]. There were students, including [[Tim Niblett]] and [[Alen Shapiro]]. [[Danny Kopec]] was there, perhaps formally as a student, but de facto as the resident chess consultant. [[Ivan Bratko]] visited frequently. Alen was the administrator of the dream computing environment of that time: a small [[PDP-11]] running [[Unix]].}} ||
=CLESS=
In 1979/80, as visiting researcher at [[University of Edinburgh]], Ivan Bratko worked with [[Zdenek Zdrahal]] and [[Alen Shapiro]] on [[Pattern Recognition]] applied to Chess. In fact they used [[Bitboards]], called [[http://en.wikipedia.org/wiki/Cellular_automaton|cellular]] 8x8 [[Array|arrays]], to implement their //Cellular logic processing emulator for chess// (CLESS) <ref>[[Zdenek Zdrahal|Zdenek Zdráhal]], [[Ivan Bratko]], [[Alen Shapiro]] (**1981**). //[[http://comjnl.oxfordjournals.org/content/24/3/263.abstract|Recognition of Complex Patterns Using Cellular Arrays]]//. [[http://comjnl.oxfordjournals.org/content/24/3.toc|The Computer Journal, Vol. 24, No. 3]], pp. 263-270</ref> . CLESS used three kinds of instructions to recognize simple and more complex chess patterns:
# [[General Setwise Operations#Bitwisebooleanoperations|bitwise boolean operations]] without any interactions between squares
# [[General Setwise Operations#ShiftingBitboards|shifts]] as expand instructions
# [[Fill Algorithms|fill-like]] propagation instructions, internally using the first two kinds of instructions and conditions in loops
=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/b/Bratko:Ivan|dblp: Ivan Bratko]]</ref>
==1978 ...==
* [[Ivan Bratko]] (**1978**). //Proving Correctness of Strategies in the AL1 Assertional Language//. Information Processing Letters, Vol. 7, No. 5, pp. 223-230. <ref>[[Donald Michie]] (**1976**). //[[http://portal.acm.org/citation.cfm?id=1045272|AL1: a package for generating strategies from tables]]//. ACM SIGART Bulletin, Issue 59</ref>
* [[Ivan Bratko]], [[Danny Kopec]], [[Donald Michie]] (**1978**). //Pattern-Based Representation of Chess Endgame Knowledge//. [[http://comjnl.oxfordjournals.org/content/21/2.toc|The Computer Journal, Vol. 21, No. 2]], pp. 149-153. [[http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_44_C.pdf|pdf]]
* [[Donald Michie]], [[Ivan Bratko]] (**1978**). //Advice Table Representations of Chess End-Game Knowledge//. Proceedings 3rd AISB/GI Conference, pp. 194-200.
* [[Ivan Bratko]] (**1979**). //Implementing Search Heuristics using the AL1 Advice-Taking System//. Proc. Sixth Int. Joint Conf. on Art. Intell., pp. 95-97. <ref>[[Donald Michie]] (**1976**). //[[http://portal.acm.org/citation.cfm?id=1045272|AL1: a package for generating strategies from tables]]//. ACM SIGART Bulletin, Issue 59</ref>
* [[Ivan Bratko]], [[Tim Niblett]] (**1979**). //Conjectures and Refutations in a Framework for Chess Endgames//. in Expert Systems in the Micro-Electronic Age ([[Donald Michie]], ed.), Edinburgh: Edinburgh University Press.
==1980 ...==
* [[Ivan Bratko]], [[Donald Michie]] (**1980**). //[[http://comjnl.oxfordjournals.org/content/23/4/353.abstract|An Advice Program For a Complex Chess Programming Task]]//. [[http://comjnl.oxfordjournals.org/content/23/4.toc|Computer Journal, Vol. 23, No. 4]], pp. 350-353.
* [[Ivan Bratko]], [[Donald Michie]] (**1980**). //A Representation of Pattern-Knowledge in Chess Endgames//. [[Advances in Computer Chess 2]]
* [[Zdenek Zdrahal|Zdenek Zdráhal]], [[Ivan Bratko]], [[Alen Shapiro]] (**1981**). //[[http://comjnl.oxfordjournals.org/content/24/3/263.abstract|Recognition of Complex Patterns Using Cellular Arrays]]//. [[http://comjnl.oxfordjournals.org/content/24/3.toc|The Computer Journal, Vol. 24, No. 3]], pp. 263-270
* [[Ivan Bratko]] (**1982**). //Knowledge-Based Problem-Solving in AL3.// [[http://www.doc.ic.ac.uk/~shm/MI/mi10.html|Machine Intelligence 10]] (eds. [[Jean Hayes Michie]], [[Donald Michie]] and Y.H. Pao), pp. 73-100. Ellis Horwood Ltd., Chichester, UK. ISBN 0-85312-431-0.
* [[Ivan Bratko]], [[Matjaž Gams]] (**1982**). //Error Analysis of the Minimax Principle//. [[Advances in Computer Chess 3]]
* [[Ivan Bratko]], [[Danny Kopec]] (**1982**). //A Test for Comparison of Human and Computer Performance in Chess.// [[Advances in Computer Chess 3]]
* [[Danny Kopec]], [[Ivan Bratko]] (**1982**). //The Bratko-Kopec experiment: a comparison of human and computer performance in chess//. [[Advances in Computer Chess 3]]
* [[Danny Kopec]], [[Enrique Irazoqui]], [[Ivan Bratko]] (**1983**). //The Updated Bratko-Kopec Test.// [[Computer Chess Reports|Computer Chess Digest Annual]] pp. 45-63
* [[Ivan Bratko]] (**1984**). //Advice and Planning in Chess Endgames.// Artificial and Human Thinking (eds. S. Amarel, A. Elithorn and R. Banerji). North-Holland.
* [[Ivan Bratko]], [[Peter Tancig]], [[Simona Tancig]] (**1984**). //[[Simona Tancig#ChessExperiment|Detection of Positional Patterns in Chess]]//. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]] (abridged version)
* [[Ivan Bratko]], [[Peter Tancig]], [[Simona Tancig]] (**1984,1986**). //[[Simona Tancig#ChessExperiment|Detection of Positional Patterns in Chess]]//. [[Advances in Computer Chess 4]] (full paper)
* [[Ivan Bratko]] (**1985**). //Symbolic Derivation of Chess Patterns.// Progress in Artificial Intelligence (eds. L. Steels and J.A. Campbell), pp. 281-290. Ellis Horwood Ltd., Chichester, UK.
* [[Ivan Bratko]] (**1986**, **1990**). //Game Playing. Prolog Programming for Artificial Intelligence.// 2nd Edition 1990. Addison Wesley, Reading, MA. ISBN 0-201-41606-9..
* [[Ivan Bratko]], [[Igor Kononenko]] (**1986**). //Learning Rules from Incomplete and Noisy Data.// Proceedings Unicom Seminar on the Scope of Artificial Intelligence in Statistics. Technical Press
* [[Donald Michie]], [[Ivan Bratko]] (**1987**). //Ideas on Knowledge Synthesis Stemming from the KBBKN Endgame//. [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Donald Michie]], [[Ivan Bratko]] (**1987**). //Ideas on Knowledge Synthesis ..... a Correction//. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Tim Niblett]], [[Ivan Bratko]] (**1987**). //Learning decision rules in noisy domains,// in Research and Development in Expert Systems III ([[Max Bramer]], ed.), pp. 25-34, Cambridge University Press.
==1990 ...==
* [[Donald Michie]], [[Ivan Bratko]] (**1991**). //Comments to `Chunking for Experience'//. [[ICGA Journal#14_1|ICCA Journal, Vol. 14, No. 1]]
* [[Ryszard Michalski]], [[Ivan Bratko]], [[Miroslav Kubat]] (eds.) (**1998**). //[[http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0471971995.html|Machine Learning and Data Mining: Methods and Applications]]//. [[https://en.wikipedia.org/wiki/John_Wiley_%26_Sons|John Wiley & Sons]]
> [[Miroslav Kubat]], [[Ivan Bratko]], [[Ryszard Michalski]] (**1998**). //A Review of Machine Learning Methods//. [[http://lacam.di.uniba.it/people/courses/IA/IA1213/IA/letture/MLReview.pdf|pdf]]
==2000 ...==
* [[Ivan Bratko]] (**2001, 2010**). //[[http://www.worldcat.org/search?qt=wikipedia&q=isbn%3A0201403757|Prolog programming for artificial intelligence]]//. Harlow England, [[http://en.wikipedia.org/wiki/Addison-Wesley|Addison Wesley]]
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] (**2003**). //A Program for Playing Tarok//, [[ICGA Journal#26_3|ICGA Journal, Vol. 26, No. 3]]
* [[Aleksander Sadikov]], [[Ivan Bratko]], [[Igor Kononenko]] (**2003**). //Search versus Knowledge: An Empirical Study of Minimax on KRK//. [[Advances in Computer Games 10]], [[http://www.ailab.si/sasha/acg2003.pdf|pdf]]
==2005 ...==
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] (**2005**). //[[http://dl.acm.org/citation.cfm?id=1642327|Why Minimax Works: An Alternative Explanation]]//. [[http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2005.html#LustrekGB05|IJCAI 2005]]
* [[Aleksander Sadikov]], [[Ivan Bratko]], [[Igor Kononenko]] (**2005**). //[[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1G-4HCN79X-1&_user=10&_coverDate=12%2F14%2F2005&_rdoc=1&_fmt=high&_orig=search&_sort=d&_docanchor=&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=79f966215bea9b7461b6877c9373b0bf|Bias and pathology in minimax search]]//. Theoretical Computer Science, Vol. 349, 2, [[http://lkm.fri.uni-lj.si/xaigor/slo/clanki/Sadikov_final.pdf|pdf]]
* [[Matej Guid]], [[Ivan Bratko]] (**2006**). //Computer Analysis of World Chess Champions//. [[ICGA Journal#29_2|ICGA Journal, Vol. 29, No. 2]], [[http://www.ailab.si/matej/doc/Computer_Analysis_of_World_Chess_Champions.pdf|pdf]] <ref>[[http://en.chessbase.com/post/computers-choose-who-was-the-strongest-player-|Computers choose: who was the strongest player?]], [[ChessBase|ChessBase News]], October 30, 2006</ref><ref>[[http://www.chessbase.com/newsdetail.asp?newsid=3465|Computer analysis of world champions]] by [[Søren Riis]], [[ChessBase|ChessBase News]], November 02, 2006</ref>
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] (**2006**). //Is Real-Valued Minimax Pathological//? Artificial Intelligence 170. [[http://dis.ijs.si/MitjaL/documents/Is_Real-Valued_Minimax_Pathological-AIJ-06.pdf|pdf]]
* [[Matej Guid]], [[Ivan Bratko]] (**2006**). //[[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_1|Computer Analysis of Chess Champions]]//. [[CG 2006]]
* [[Aleksander Sadikov]], [[Martin Možina]], [[Matej Guid]], [[Jana Krivec]], [[Ivan Bratko]] (**2006**). //[[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_2|Automated Chess Tutor]]//. [[CG 2006]]
* [[Aleksander Sadikov]], [[Ivan Bratko]] (**2006**). //[[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_15|Search Versus Knowledge Revisited Again]]//. [[CG 2006]]
* [[Matej Guid]], [[Ivan Bratko]] (**2007**). //Factors affecting diminishing returns for searching deeper//. [[CGW 2007]] » [[Crafty]], [[Rybka]], [[Shredder]], [[Depth#DiminishingReturns|Diminishing Returns]]
* [[Matej Guid]], [[Ivan Bratko]] (**2007**). //Factors affecting diminishing returns for searching deeper//. [[ICGA Journal#30_2|ICGA Journal, Vol. 30, No. 2]], [[http://www.ailab.si/matej/doc/Factors_Affecting_Diminishing_Returns.pdf|pdf]]
* [[Aleksander Sadikov]], [[Ivan Bratko]] (**2007**). //[[http://ofuturescholar.com/paperpage?docid=147896|Solving 20x20 Puzzles]]//. [[CGW 2007]]
* [[Matej Guid]], [[Aritz Pérez]], [[Ivan Bratko]] (**2007**). //How trustworthy is Crafty's analysis of world chess champions//? [[CGW 2007]] » [[Crafty]]
* [[Matej Guid]], [[Aritz Pérez]], [[Ivan Bratko]] (**2008**). //How trustworthy is Crafty's analysis of world chess champions//? [[ICGA Journal#31_3|ICGA Journal, Vol. 31, No. 3]], [[http://www.ailab.si/matej/doc/How_Trustworthy_is_Craftys_Analysis.pdf|pdf]]
* [[Matej Guid]], [[Martin Možina]], [[Jana Krivec]], [[Aleksander Sadikov]], [[Ivan Bratko]] (**2008**). //[[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_18|Learning Positional Features for Annotating Chess Games: A Case Study]]//. [[CG 2008]], [[http://www.ailab.si/matej/doc/Learning_Positional_Features-Case_Study.pdf|pdf]]
* [[Martin Možina]], [[Matej Guid]], [[Jana Krivec]], [[Aleksander Sadikov]], [[Ivan Bratko]] (**2008**). //Fighting Knowledge Acquisition Bottleneck with Argument Based Machine Learning//. 18th European Conference on Artificial Intelligence (ECAI 2008), Patras, Greece. [[http://www.ailab.si/martin/abml/abml_expert_system_for_web.pdf|pdf]]
* [[Jana Krivec]], [[Matej Guid]], [[Ivan Bratko]] (**2009**). //Identification and Characteristic Descriptions of Procedural Chunks//. ComputationWorld conference: Cognitive 2009. [[http://www.ailab.si/matej/doc/Identification_and_Characteristic_Descriptions_of_Procedural_Chunks.pdf|pdf]]
==2010 ...==
* [[Matej Guid]], [[Martin Možina]], [[Aleksander Sadikov]], [[Ivan Bratko]] (**2010**). //[[http://www.springerlink.com/content/um0l155681087p7h|Deriving Concepts and Strategies from Chess Tablebases]]//. [[Advances in Computer Games 12]], [[http://www.ailab.si/matej/doc/Deriving_Concepts_and_Strategies_from_Chess_Tablebases.pdf|pdf]]
* [[Dana Nau|Dana S. Nau]], [[Mitja Luštrek]], [[Austin Parker]], [[Ivan Bratko]], [[Matjaž Gams]] (**2010**). //[[http://www.sciencedirect.com/science/article/pii/S0004370210001402|When is it better not to look ahead?]]//. [[https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29|Artificial Intelligence]], Vol. 174, No. 16–17, [[http://dis.ijs.si/mitjal/documents/Nau-When_is_it_better_not_to_look_ahead-AIJ-10.pdf|preprint as pdf]]
* [[Matej Guid]], [[Ivan Bratko]] (**2011**). //Using Heuristic-Search Based Engines for Estimating Human Skill at Chess//. [[ICGA Journal#34_2|ICGA Journal, Vol. 34, No. 2]]
* [[Mitja Luštrek]], [[Ivan Bratko]], [[Matjaž Gams]] (**2011**). //[[http://www.sciencedirect.com/science/article/pii/S0304397511009522|Independent-valued minimax : Pathological or beneficial?]]// [[http://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29|Theoretical Computer Science]], Vol. 422, [[http://dis.ijs.si/MitjaL/documents/Independent-valued_minimax-Pathological_or_beneficial-TCS-12.pdf|pdf]]
* [[Matej Guid]], [[Ivan Bratko]] (**2012**). //Detecting Fortresses in Chess//. [[http://ev.fe.uni-lj.si/|Elektrotehniški vestnik]], Vol. 79, Nos. 1-2, [[https://ailab.si/matej/doc/Detecting_Fortresses_in_Chess.pdf|pdf]] » [[Rybka]], [[Houdini]] <ref>[[http://www.talkchess.com/forum/viewtopic.php?t=64306&start=27|Re: Tony's positional test suite]] by [[Louis Zulli]], [[CCC]], August 01, 2017</ref>
* [[Matej Guid]], [[Ivan Bratko]] (**2013**). //[[http://link.springer.com/chapter/10.1007/978-3-642-39112-5_131|Search-Based Estimation of Problem Difficulty for Humans]]//. [[http://dblp.uni-trier.de/db/conf/aied/aied2013.html#GuidB13|AIED 2013]], [[https://ailab.si/matej/doc/Search-Based_Estimation_of_Problem_Difficulty.pdf|pdf]]
* [[Matej Guid]], [[Martin Možina]], [[Ciril Bohak]], [[Aleksander Sadikov]], [[Ivan Bratko]] (**2013**). //Building an Intelligent Tutoring System for Chess Endgames//. [[http://dblp.uni-trier.de/db/conf/csedu/csedu2013.html#GuidMBSB13|CSEDU 2013]]
==2015 ...==
* [[Matej Guid]], [[Ivan Bratko]] (**2017**). //Influence of Search Depth on Position Evaluation//. [[Advances in Computer Games 15]]
=External Links=
* [[http://www.fri.uni-lj.si/en/ivan-bratko/default.html|Professor Ivan Bratko, PhD - FRI]]
* [[http://www.ailab.si/ivan/novice.php|Ivan Bratko's Homepage]]
* [[http://en.wikipedia.org/wiki/Ivan_Bratko_%28computer_scientist%29|Ivan Bratko from Wikipedia]]
* [[http://genealogy.math.ndsu.nodak.edu/id.php?id=75689|The Mathematics Genealogy Project - Ivan Bratko]]
* [[http://videolectures.net/acai05_bratko_hnd/|Handling noisy data]], Videolecture
* Evolutionary Portrait Art by [[http://www.evogenio.com/de/GBEvoArt/EvoArt.html|Günter Bachelier]]: [[http://www.flickr.com/photos/gbachelier/sets/72157615128782937/|Ivan Bratko]]
> [[image:evobratko.jpg link="http://www.flickr.com/photos/gbachelier/sets/72157615128782937/"]]
=References=
<references />
=What links here?=
[[include page="Ivan Bratko" component="backlinks" limit="80" ]]
**[[People|Up one level]]**