Language and Theorem Proving

• Yamasaki,S. et al., The satisfiablity problems for some classes of extended Horn sets in the propositional logic, The Trans. of the IECEJ, E65, 7, pp.390-396, 1982.
• Yamasaki,S. et al., The satisfiablity problem for a class consisting of Horn sentences and some non-Horn sentences in propositional logic, Information and Control, 59, 1-3, pp.1-12, 1983 (Erratum, 61, 2, p.174, 1984).
• Yamasaki,S. et al., A new combination of input and unit deductions for Horn sentences, Information Processing Letters, 18, 4, pp.209-214, 1984.
• Yamasaki,S. et al., Resolution deduction to detect satisfiablity for another class including non-Horn sentences in propositional logic, Information Processing Letters, 23, 201-207, 1986.
• Yamasaki,S., A network of communicating logic programs and its semantics, Proc. of 10th IJCAI-87, Milan, 1, pp.24-29, 1987.
• Yamasaki,S. and Tonomura,T., On a bottom-up least error correction algorithm for context-free languages, 19pp., 1987: Translation from IPSJ, 18, 8, pp.781-788.
• Yamasaki,S., Control problem of a class of pushdown automata based on posets and its application to resolution deduction, IEICE Trans. on Information and Systems, E78-D, 11, pp.1488-1497, 1995.