Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 CHARACTERIZING LOGIC GRAMMARS: A
 

Summary: J. LOGIC PROGRAMMING 1994:19, 20:1--679 1
CHARACTERIZING LOGIC GRAMMARS: A
SUBSTRUCTURAL LOGIC APPROACH
JAMES ANDREWS, VERONICA DAHL, AND FRED
POPOWICH
. A characterization of Static Discontinuity Grammars (SDGs), a logic gram­
mar formalism due to Dahl, is given in this paper. A substructural logic
sequent calculus proof system is given which is shown to be equivalent to
SDGs for parsing problems, in the sense that a string of terminal symbols is
accepted by a grammar if and only if the corresponding sequent is derivable
in the calculus. One calculus is given for each of the two major interpre­
tations of SDGs; the two calculi differ by only a small restriction in one
rule. Since SDGs encompass other major grammar formalisms, including
DCGs, the calculi serve to characterize those formalisms as well. /
It is the authors' wish that no agency should ever derive military benefit from the publication
of this paper. Authors who cite this work in support of their own are requested to qualify similarly
the availability of these results.
Address correspondence to School of Computing Science, Simon Fraser University, Burnaby,
BC, Canada V5A 1S6.
THE JOURNAL OF LOGIC PROGRAMMING

  

Source: Andrews, Jamie - Department of Computer Science, University of Western Ontario

 

Collections: Computer Technologies and Information Sciences