Reversible automata and induction of the English auxiliary system

Authors:
Robert C. Berwick;Samuel F. Pilato
Affiliations:
MIT Artificial Intelligence Laboratory, Cambridge, MA;MIT Artificial Intelligence Laboratory, Cambridge, MA
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 1
Cited 1

Inference of Reversible Languages

Journal of the ACM (JACM)

Learnability of CFLs: inferring syntactic models from constituent structure

ACM SIGART Bulletin - Special issue on knowledge acquisition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a type inference method for Prolog programs. The new idea is to describe a superset of the success set by associating a type substitution (an assignment of sets of ground terms to variables) with each head of definite clause. ...