James Rogers

I have moved

Current Page This page should redirect momentarily. (Sorry about trapping your "back" button in a loop. There seems to be no way to avoid it.)

Assistant Professor
Computer Science Department
Earlham College

Campus Address:

Computer Science Department
Drawer 98
Earlham College
Richmond, IN 47374, USA
(765)983-1671 Fax:(765)983-1497
jrogers@cs.earlham.edu

Home Address:

3304 Glen Hills Dr.
Richmond, IN 47374
(765)939-7340

Research

My research focuses on the logical foundations of grammar formalisms. Currently I am most actively involved in two areas:

model-theoretic approaches to theories of syntax and
descriptive characterizations of language-theoretic complexity classes.

I am also pursuing application of results in these areas to the problem of developing and maintaining large grammars. Finally, along with my students, I have been working towards an interactive system for formalizing behavioral specifications expressed in English and for translating formal verification results back into English, a sort of "wrapper" for formal verification or synthesis tools.

For a slightly more detailed research abstract see (postscript) (pdf)

My doctoral studies were carried out in the Computer and Information Sciences Department at the University Delaware under K. Vijay-Shanker. Copies of my dissertation Studies in the Logic of Trees with Applications to Grammar Formalisms are available from the Univ. of Delaware as Technical Report No. 95-04, email requests to dasaro@cis.udel.edu This is not yet available electronically, although an abstract is available here.

The following preprints and drafts are available here. Comments are welcome. I'm interested in who else is interested in this stuff; drop me a note if you pick one of these up.

Generalized Tree-Adjoining Grammar. (gzipped postscript, 131K) (pdf, 268K) (abstract) A paper presented at the Sixth Meeting on Mathematics of Language.
A Descriptive Characterization of Tree-Adjoining Languages (Full Version) (gzipped postscript, 78K) (abstract) This is the full version of a paper to appear in the proceedings of COLING-ACL'98 as a project note.
On Defining TALs with Logical Constraints (gzipped postscript 65K) Paper presented at the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), Phila. Aug. 1999.
Thomas Cornell and ---. Model Theoretic Syntax (gzipped postscript 79K) To appear in The Glot International State of the Article Book I Holland Academic Graphics.
The Descriptive Complexity of Generalized Local Sets (gzipped postscript 111K): A paper on the class of sets of trees definable in $L^2_{K,P}$ if we do not include an explicit finite bound on the branching. To appear in Mathematics of Syntactic Structure. Mouton/deGruyter. Collected papers from the workshop of the same name at ESSLLI'96, Prague.
A Unified Notion of Derived and Derivation Structures in TAG (Preliminary version.) (gzipped postscript, 52K) : This is an extended abstract which appears in the MOL 5 proceedings. A full version is in preparation.
Strict LT_2 : Regular :: Local : Recognizable (gzipped postscript 104K): A paper on the descriptive complexity of local sets and on parallels between language-theoretic complexity classes in the domain of strings and those in the domain of trees which was presented at the Logical Aspects of Computational Linguistics conference, Villers-l\`es-Nancy, Sept. 1996.
A Model-Theoretic Framework for Theories of Syntax (gzipped postscript, 47K) (abstract): A preprint of a paper which is to appear in Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics.
``Grammarless'' Phrase Structure Grammar (gzipped postscript, 112K) (abstract) A preprint of an article that appears in Linguistics and Philosophy, v20:721--746. (Following TR is related.)
What Does a Grammar Formalism Say About a Language? (gzipped postscript 96K) (abstract): A draft of a TR in which a model-theoretic reinterpretation of GPSG is used as the basis of an exploration of some issues in linguistic metatheory.
A First-Order Axiomatization of the Theory of Finite Trees (compressed postscript, 150K) (abstract): A preprint of an article, co-authored by Rolf Backofen and K. Vijay-Shanker, which appears in Vol 4 (pp 5--39) of the Journal of Logic, Language, and Information.
On Descriptive Complexity, Language Complexity,and GB (compressed postscript, 130K) (abstract): A preprint of an article which is to appear in Specifying Syntactic Structures, papers from the Logic, Structures, and Syntax workshop, Amsterdam, Sept. 1994). This is a brief sketch of the topics covered in A Descriptive Approach to Language-Theoretic Complexity.
Obtaining Trees from Their Descriptions: An Application to Tree-Adjoining Grammars (gzipped postscript 109K) (abstract): A preprint of an article which appears in Vol 10 (pp 401--421) of Computational Intelligence.
Capturing CFLs with Tree Adjoining Grammars (gzipped postscript 54K) (abstract): A preprint of a paper which appears in Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics.
More to come ...

Some other files

ACL'97 Tutorial

Logical Approaches to Syntactic Theories

Other associations

Join the Blue Ribbon Online Free Speech Campaign!

James Rogers

Last modified: Thu Jan 7 19:01:37 EST 1999