Difference between revisions of "Ivan Bratko"

From Chessprogramming wiki
Jump to: navigation, search
 
(10 intermediate revisions by the same user not shown)
Line 15: Line 15:
 
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>:
 
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]].  
 
  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]].  
 +
 +
==AI as Sport==
 +
Quote by [[John McCarthy]] from  ''AI as Sport'' <ref>[[John McCarthy]] ('''1997'''). ''AI as Sport''. Science, Vol. 276, June 6, pp. 1518-1519.</ref><ref>[http://www-formal.stanford.edu/jmc/newborn/newborn.html AI as Sport] by [[John McCarthy]]</ref>:
 +
 +
Besides AI work aimed at tournament play, particular aspects of the game have illuminated the intellectual mechanisms involved. [[Barbara Liskov]] demonstrated that what chess books teach about how to win certain [[Endgame|endgames]] is not a program but more like a predicate comparing two positions to see if one is an improvement on the other. Such qualitative comparisons are an important feature of human intelligence and are needed for AI. [[Donald Michie]], [[Ivan Bratko]], [[Alen Shapiro]], [[David Wilkins]], and others have also used chess as a Drosophila to study intelligence. [[Monroe Newborn|Newborn]] ignores this work, because it is not oriented to tournament play.
  
 
=CLESS=
 
=CLESS=
Line 23: Line 28:
  
 
=Selected Publications=
 
=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>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[http://dblp.uni-trier.de/pers/hd/b/Bratko:Ivan dblp: Ivan Bratko]</ref>
 
==1978 ...==
 
==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]] ('''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>
Line 42: Line 47:
 
* [[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'''). ''[[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]], [[Peter Tancig]], [[Simona Tancig]] ('''1984,1986'''). ''[[Simona Tancig#ChessExperiment|Detection of Positional Patterns in Chess]]''. [[Advances in Computer Chess 4]] (full paper)
 +
==1985 ...==
 
* [[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]] ('''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]] ('''1986''', '''1990'''). ''Game Playing. Prolog Programming for Artificial Intelligence.'' 2nd Edition 1990. Addison Wesley, Reading, MA. ISBN 0-201-41606-9..
Line 49: Line 55:
 
* [[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.
 
* [[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 ...==
 
==1990 ...==
* [[Donald Michie]], [[Ivan Bratko]] ('''1991'''). ''Comments to `Chunking for Experience'''. [[ICGA Journal#14_1|ICCA Journal, Vol. 14, No. 1]]
+
* [[Donald Michie]], [[Ivan Bratko]] ('''1991'''). ''Comments to `Chunking for Experience' ''. [[ICGA Journal#14_1|ICCA Journal, Vol. 14, No. 1]]
 +
==1995 ...==
 +
* [[Ivan Bratko]], [[Stephen Muggleton]] ('''1995'''). ''Applications of Inductive Logic Programming''. [[ACM#Communications|Communications of the ACM]], Vol. 38, No. 11, [http://www.doc.ic.ac.uk/~shm/Papers/cacm.pdf pdf]
 
* [[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]
 
* [[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]
 
: [[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]
Line 56: Line 64:
 
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] ('''2003'''). ''A Program for Playing Tarok'', [[ICGA Journal#26_3|ICGA Journal, Vol. 26, No. 3]]
 
* [[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]
 
* [[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]
 +
* [[Ivan Bratko]], [[Martin Možina]] ('''2004'''). ''Argumentation and machine learning''. Deliverable 2.1 for the ASPIC project
 
==2005 ...==
 
==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]
+
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] ('''2005'''). ''Why Minimax Works: An Alternative Explanation''. [[Conferences#IJCAI2005|IJCAI 2005]], [https://www.ijcai.org/Proceedings/05/Papers/1223.pdf pdf]
 
* [[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]
 
* [[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>
 
* [[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]
+
* [[Mitja Luštrek]], [[Matjaž Gams]], [[Ivan Bratko]] ('''2006'''). ''Is Real-Valued Minimax Pathological''? [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 170, [https://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]]
+
* [[Matej Guid]], [[Ivan Bratko]] ('''2006'''). ''[https://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]], [[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]]
 
* [[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]]
 +
* [[Martin Možina]], [https://dblp.uni-trier.de/pers/hd/z/Zabkar:Jure Jure Žabkar], [[Ivan Bratko]] ('''2007'''). ''Argument Based Machine Learning''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 171, Nos. 10-15, [https://ailab.si/martin/abml/ABCN2aij_final.pdf pdf preprint]
 
* [[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''. [[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]  
 
* [[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]  
Line 74: Line 84:
 
==2010 ...==
 
==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]
 
* [[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]
+
* [[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]
 +
* [[Martin Možina]], [[Matej Guid]], [[Jana Krivec]], [[Aleksander Sadikov]], [[Ivan Bratko]] ('''2010'''). ''Learning to Explain with ABML''. [https://dblp.uni-trier.de/db/conf/exact/exact2010.html ExaCt 2010], [http://ceur-ws.org/Vol-650/0037.pdf 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]]
 
* [[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?]'' [https://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]
 
* [[Mitja Luštrek]], [[Ivan Bratko]], [[Matjaž Gams]] ('''2011'''). ''[http://www.sciencedirect.com/science/article/pii/S0304397511009522 Independent-valued minimax : Pathological or beneficial?]'' [https://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]] ('''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>
 +
* [[Stephen Muggleton]], [[Mathematician#LDRaedt|Luc De Raedt]], [[Mathematician#DPoole|David Poole]], [[Ivan Bratko]], [https://en.wikipedia.org/wiki/Peter_Flach Peter A. Flach], [http://research.nii.ac.jp/~inoue/official/content_e.html Katsumi Inoue], [[Ashwin Srinivasan]] ('''2012'''). ''[https://link.springer.com/article/10.1007/s10994-011-5259-2 ILP turns 20 - Biography and future challenges]''. [https://en.wikipedia.org/wiki/Machine_Learning_(journal) Machine Learning], Vol. 86, No. 1
 
* [[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]], [[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]
 
* [[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]
Line 94: Line 106:
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 
[[Category:Researcher|Bratko]]
 
[[Category:Researcher|Bratko]]
 +
[[Category:Quotes|Bratko]]
 +
[[Category:McCarthy Quotes|Bratko]]

Latest revision as of 22:30, 23 May 2021

Home * People * Ivan Bratko

Ivan Bratko [1]

Ivan Bratko,
a Slovenian computer scientist and researcher in artificial intelligence and computer chess, professor at the Faculty of Computer and Information Science University of Ljubljana. Until 2002, professor Bratko also directed the AI group at Jožef Stefan Institute in Ljubljana. In 1982, as a visiting scientist at the University of Edinburgh, Ivan Bratko and Danny Kopec designed the Bratko-Kopec Test [2] [3]

Quotes

Research Interests

Quote from Ivan Bratko's Homepage [4]:

Professor Bratko has conducted research in machine learning, knowledge-based systems, qualitative modeling, intelligent robotics, heuristic programming and computer chess. His main interests in machine learning have been in learning from noisy data, combining learning and qualitative reasoning, constructive induction, Inductive Logic Programming and various applications of machine learning, including medicine and control of dynamic systems. 

Chess Endgames

Quote by Maarten van Emden in I remember Donald Michie [5]:

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, the Machine Intelligence Research Unit was alive with work focused on 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. 

AI as Sport

Quote by John McCarthy from AI as Sport [6][7]:

Besides AI work aimed at tournament play, particular aspects of the game have illuminated the intellectual mechanisms involved. Barbara Liskov demonstrated that what chess books teach about how to win certain endgames is not a program but more like a predicate comparing two positions to see if one is an improvement on the other. Such qualitative comparisons are an important feature of human intelligence and are needed for AI. Donald Michie, Ivan Bratko, Alen Shapiro, David Wilkins, and others have also used chess as a Drosophila to study intelligence. Newborn ignores this work, because it is not oriented to tournament play.

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 cellular 8x8 arrays, to implement their Cellular logic processing emulator for chess (CLESS) [8] . CLESS used three kinds of instructions to recognize simple and more complex chess patterns:

  1. bitwise boolean operations without any interactions between squares
  2. shifts as expand instructions
  3. fill-like propagation instructions, internally using the first two kinds of instructions and conditions in loops

Selected Publications

[9] [10]

1978 ...

1980 ...

1985 ...

  • 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. ICCA Journal, Vol. 10, No. 1
  • Donald Michie, Ivan Bratko (1987). Ideas on Knowledge Synthesis ..... a Correction. 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 ...

1995 ...

Miroslav Kubat, Ivan Bratko, Ryszard Michalski (1998). A Review of Machine Learning Methods. pdf

2000 ...

2005 ...

2010 ...

2015 ...

External Links

References

Up one level