60th TRS Meeting

October 7 – October 9, 2024

News

Invited Talk

Speaker
Tobias Nipkow
Title
Alpha-Beta Pruning Explored, Extended and Verified
Abstract
Alpha-beta pruning is an efficient search strategy for two-player game trees. It was invented in the late 1950s and is at the heart of most implementations of combinatorial game playing programs. In this talk I will survey my recent formalizations and verifications of a number of standard variations of alpha-beta pruning. Findings include:
  • Basic variants already having a property ascribed to an improved version
  • Authors being confused about which algebraic structure they actually work in
  • Generalizations to new algebraic structures
  • The implementation in a famous paper is flawed

Program

October 7 (Mon)

10:00 – 12:00Free Discussion
14:30 – 15:30 Invited Talk
Alpha-Beta Pruning Explored, Extended and Verified Tobias Nipkow
15:30 – 15:50Break
15:50 – 16:30 All-Path Reachability for Starvation Freedom Under Process Fairness Naoki Nishida Nagoya U.
16:30 – 17:20 On algorithms to solve Quadratic Diophantine equation Yuto Nakamura JAIST
17:20 – 18:00 What I formalized in Isabelle/HOL Yasuhiko Minamide Science Tokyo
18:30 –Dinner
Trattoria&Pizzeria LOGIC Odaiba (map)

October 8 (Tue)

10:00 – 10:40 Formalizing Logically Constrained Rewriting in Isabelle/HOL Akihisa Yamada AIST
10:40 – 11:20 TBA Tetsuya Sato Science Tokyo
11:20 – 12:00 A Formalization of the Lévy-Prokhorov Metric in Isabelle/HOL Michikazu Hirata Science Tokyo
12:00 – 14:00Lunch Break
14:00 – 14:50 Linear Termination is Undecidable Aart Middeldorp U. Innsbruck (online)
14:50 – 15:30 Disproving Termination of O-like Combinators by Tree Automata Munehiro Iwami Iwate Prefectural University (online)
15:30 – 15:50Break
15:50 – 16:30 Proof Automation Based On Completion In Coq Soichi Yajima Kyoto U.
16:30 – 17:10 Lexicographic Combinations of Reduction Pairs Nao Hirokawa JAIST
17:10 –Business Meeting
18:00 –Dinner
Haibana 南風花 アクアシティお台場店 (map)

October 9 (Wed)

10:00 – 10:40 Proving Absence of Spiraling Terms by Semantic Path Orders Teppei Saito JAIST
10:40 – 11:20 TBA Mirai Ikebuchi Kyoto U.
11:20 – 12:00 Applicative Multiset Path Orders Wataru Yachi JAIST

About TRS meeting

Term Rewriting Meeting (TRS Meeting) is a biannual informal workshop that aims at promoting the research on rewriting and related areas. Participants are requested to give a talk of approximately 15–60 minutes in English on their research activities. See also Rewriting Researchers Forum for further information. We should like to invite all of you to the upcoming TRS Meeting held online. Partial participation is also welcome.

Basic Information

Dates:
October 7 – October 9, 2024
Venue:
AIST Tokyo Waterfront Annex, Meeting Room 1 (会議室1), 11th floor
Fees:
Free

Registration

Please send the registration form below to Akihisa Yamada (akihisa.yamada at aist.go.jp) no later than September 23.
----------------------------------------------------------------------
              Registration Form of the 60th TRS meeting

Name:
Affiliation:
Title of talk (*):
Duration of talk (*):
----------------------------------------------------------------------
The items marked with * can be sent later.

Participants

  1. Aart Middeldorp (U. Innsbruck, online)
  2. Akihisa Yamada (AIST)
  3. Michikazu Hirata (Science Tokyo)
  4. Mirai Ikebuchi (Kyoto U.)
  5. Mizuhito Ogawa (JAIST)
  6. Munehiro Iwami (Iwate Prefectural U., online)
  7. Nao Hirokawa (JAIST)
  8. Naoki Nishida (Nagoya U., hybrid)
  9. Soichi Yajima (Kyoto U.)
  10. Teppei Saito (JAIST)
  11. Tetsuya Sato (Science Tokyo)
  12. Tobias Nipkow
  13. Wataru Yachi (JAIST)
  14. Yasuhiko Minamide (Science Tokyo)
  15. Yuto Nakamura (JAIST)

Contact

Akihisa Yamada