Publications International

Full Papers in Refereed Journals and Proceedings

Hitoshi Ohsaki and Yuji Sato:
Launch of AIST Journal "Synthesiology": Discussion with Japanese Researchers at the University of Illinois at Urbana-Champaign,
Synthesiology - International edition, volume 1(3), pp. 222–228, AIST, 2009. (PDF)

Naoki Kobayashi and Hitoshi Ohsaki:
Tree Automata for Non-Linear Arithmetic,
In proceedings of 19th International Conference on Rewriting Techniques and Applications (RTA'08), Hagenberg (Austria), July 2008.  * RTA best paper award
Lecture Notes in Computer Science 5117, pp. 291–305, Springer. (PDF)

Joe Hendrix and Hitoshi Ohsaki:
Combining Equational Tree Automata Over AC and ACI Theories,
In proceedings of 19th International Conference on Rewriting Techniques and Applications (RTA'08), Hagenberg (Austria), July 2008.
Lecture Notes in Computer Science 5117, pp. 142–156, Springer. (PDF)

Hitoshi Ohsaki and Hiroyuki Seki:
Languages Modulo Normalization.
In proceedings of 6th International Symposium on Frontiers of Combining Systems (FroCoS'07), Liverpool (England), September 2007.
Lecture Notes in Artificial Intelligence 4720, pp. 221–236, Springer. (PDF)

Joe Hendrix, José Meseguer and Hitoshi Ohsaki:
Sufficient Completeness Checking with Propositional Tree Automata.
In proceedings of 18th International Workshop on Algebraic Development Techniques (WADT'06), Chateau Floreal La Roche en Ardenne (Belgium), June 2006.
Draft available as Technical Report UIUCDCS–R–2005–2635, Department of Computer Science, University of Illinois at Urbana-Champaign, September 2005. (PDF)

Joe Hendrix, Hitoshi Ohsaki and Mahesh Viswanathan:
Propositional Tree Automata.
In proceedings of 17th International Conference on Rewriting Techniques and Applications (RTA'06), Seattle (Washington), August 2006.
Lecture Notes in Computer Science 4098, pp. 50–65, Springer. (PDF)

Joe Hendrix, José Meseguer and Hitoshi Ohsaki:
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms.
In proceedings of 3rd International Joint Conference on Automated Reasoning (IJCAR'06), Seattle (Washington) August 2006.
Lecture Notes in Artificial Intelligence 4130, pp. 151–155, Springer. (PDF)

Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison and Yves Roos:
Monotone AC-Tree Automata.
In proceedings of 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'05), Montego Bay (Jamaica), December 2005.
Lecture Notes in Artificial Intelligence 3835, pp. 337–351, Springer. (PDF)

Hitoshi Ohsaki and Toshinori Takai:
ACTAS: A System Design for Associative and Commutative Tree Automata Theory.
In proceedings of 5th International Workshop on Rule-Based Programming (RULE'04), Aachen (Germany), June 2004.
Electronic Notes in Theoretical Computer Science 124, pp. 97–111, Elsevier Science. (PDF)

Hitoshi Ohsaki, Hiroyuki Seki and Toshinori Takai:
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.
In proceedings of 14th International Conference on Rewriting Techniques and Applications (RTA'03), Valencia (Spain), June 2003.
Lecture Notes in Computer Science 2706, pp. 483–498, Springer. (PDF)

Hitoshi Ohsaki and Toshinori Takai:
Decidability and Closure Properties of Equational Tree Languages.
In proceedings of 13th International Conference on Rewriting Techniques and Applications (RTA'02), Copenhagen (Denmark), July 2002.
Lecture Notes in Computer Science 2378, pp. 114–128, Springer. (PDF)

Hitoshi Ohsaki:
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.
In proceedings of 15th International Conference of the European Association for Computer Science Logic (CSL'01), Paris (France), September 2001.
Lecture Notes in Computer Science 2142, pp. 539–553, Springer. (PDF)

Hitoshi Ohsaki, Aart Middeldorp and Jürgen Giesl:
Equational Termination by Semantic Labelling.
In proceedings of 14th International Conference of the European Association for Computer Science Logic (CSL'00), Fischbachau (Germany), August 2000.
Lecture Notes in Computer Science 1862, pp. 457–471, Springer. (PDF)

Hitoshi Ohsaki and Aart Middeldorp:
Type Introduction for Equational Rewriting.
Acta Informatica, volume 36, number 12, pp. 1007–1029, Springer, 2000;
Early version in proceedings of 4th International Symposium on Logical Foundations of Computer Science (LFCS'97), Yaroslavl (Russia), July 1997.
Lecture Notes in Computer Science 1234, pp. 283–293, Springer. (PDF)

Aart Middeldorp, Hitoshi Ohsaki and Hans Zantema:
Transforming Termination by Self- Labelling.
In proceedings of 13th International Conference on Automated Deduction (CADE'96), New Brunswick (New Jersey), July 1996.
Lecture Notes in Artificial Intelligence 1104, pp. 373–387, Springer. (PDF)