Other papers

• Maria Paola Bonacina and David A. Plaisted. Semantically-guided goal-sensitive theorem proving (Abstract).
  Annual Meeting of the IFIP Working Group in Term Rewriting (WG 1.6) satellite of the joint 25th International Conference on Rewriting Techniques and Applications (RTA) and 12th International Conference on Typed Lambda Calculi and Applications (TLCA) held at the 6th Federated Logic Conference (FLoC), Vienna, Austria, July 2014.

• Maria Paola Bonacina. A note on the analysis of theorem-proving strategies.
  Newsletter of the Association for Automated Reasoning, 36:2-8, April 1997. [BibTeX]

• Maria Paola Bonacina. Future directions of automated deduction: Strategy analysis for theorem proving.
  NSF Workshop on Future Directions of Automated Deduction, Chicago, Illinois, USA, April 1996. [BibTeX]

• Maria Paola Bonacina. Future directions of automated deduction: Distributed automated deduction.
  NSF Workshop on Future Directions of Automated Deduction, Chicago, Illinois, USA, April 1996. [BibTeX]

• Maria Paola Bonacina and Jieh Hsiang. Incompleteness of the RUE/NRF inference systems.
  Newsletter of the Association for Automated Reasoning, 20:9-12, May 1992. [BibTeX]

• Maria Paola Bonacina. Problems in Lukasiewicz logic.
  Newsletter of the Association for Automated Reasoning, 18:5-12, June 1991. [BibTeX]

• Fabio Baj, Maria Paola Bonacina, Massimo Bruschi and Antonella Zanzi. Another term rewriting based proof of the `non-obvious' theorem.
  Newsletter of the Association for Automated Reasoning, 13:4-8, September 1989. [BibTeX]

• Maria Paola Bonacina. Petri nets for knowledge representation.
  Petri Nets Newsletter, 27:28-36, August 1987. [BibTeX]

Maria Paola Bonacina