Results 11  20
of
170
A new approach to nontermination analysis of Logic Programs
, 2009
"... In this paper, we present a new approach to nontermination analysis of logic programs based on moded SLDNFresolution. Moded SLDNFresolution is a symbolic execution for moded goals developed for termination prediction. To prove nontermination, we use a complete loop checker to create a finite sym ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper, we present a new approach to nontermination analysis of logic programs based on moded SLDNFresolution. Moded SLDNFresolution is a symbolic execution for moded goals developed for termination prediction. To prove nontermination, we use a complete loop checker to create a finite
Vnus Language Specification  Version 2.1
, 2000
"... this report is very similar to the style used in The Java Language Specification[2]. The grammar consists of a series of productions, where each production specifies the derivation of a nonterminal symbol from terminals and other nonterminals. Nonterminal symbols are shown in an italic font, termin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
this report is very similar to the style used in The Java Language Specification[2]. The grammar consists of a series of productions, where each production specifies the derivation of a nonterminal symbol from terminals and other nonterminals. Nonterminal symbols are shown in an italic font
Generating Asymptotically NonTerminant Initial Variable Values for Linear Diagonalizable Programs
"... We present the key notion of asymptotically nonterminant initial variable values for nonterminant loop programs. We show that those specific values are directly associated to inital variable values for which the corresponding loop program does not terminate. Considering linear diagonalizable progr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
programs, we describe powerful computational methods that generate automatically and symbolically a semilinear space represented by a linear system of equalities and inequalities. Each element of this space provides us with asymptotically nonterminant initial variable values. Our approach is based
On the Closure Properties of Linear Conjunctive Languages
"... Linear conjunctive grammars are conjunctive grammars in which the body of each conjunct contains no more than a single nonterminal symbol. They can at the same time be thought of as a special case of conjunctive grammars and as a generalization of linear contextfree grammars. ..."
Abstract

Cited by 13 (12 self)
 Add to MetaCart
Linear conjunctive grammars are conjunctive grammars in which the body of each conjunct contains no more than a single nonterminal symbol. They can at the same time be thought of as a special case of conjunctive grammars and as a generalization of linear contextfree grammars.
Capacity Bounded Grammars and Petri Nets
"... A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and their Petri net controlled counterparts are inves ..."
Abstract
 Add to MetaCart
A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and their Petri net controlled counterparts
Single Tree Grammars
, 1992
"... A contextfree grammar is a singletree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various properties of this class of grammars are studied. Although most properties of STG's are undecidable, every linear STG ..."
Abstract
 Add to MetaCart
A contextfree grammar is a singletree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various properties of this class of grammars are studied. Although most properties of STG's are undecidable, every linear
Learning ContextFree Grammars with a Simplicity Bias
 Proceedings of the Eleventh European Conference on Machine Learning
, 2000
"... . We examine the role of simplicity in directing the induction of contextfree grammars from sample sentences. We present a rational reconstruction of Wolff's SNPR  the Grids system  which incorporates a bias toward grammars that minimize description length. The algorithm alternates bet ..."
Abstract

Cited by 46 (4 self)
 Add to MetaCart
between merging existing nonterminal symbols and creating new symbols, using a beam search to move from complex to simpler grammars. Experiments suggest that this approach can induce accurate grammars and that it scales reasonably to more difficult domains. 1 Introduction In this paper we focus
Bayesian SymbolRefined Tree Substitution Grammars for Syntactic Parsing
"... We propose SymbolRefined Tree Substitution Grammars (SRTSGs) for syntactic parsing. An SRTSG is an extension of the conventional TSG model where each nonterminal symbol can be refined (subcategorized) to fit the training data. We aim to provide a unified model where TSG rules and symbol refinemen ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We propose SymbolRefined Tree Substitution Grammars (SRTSGs) for syntactic parsing. An SRTSG is an extension of the conventional TSG model where each nonterminal symbol can be refined (subcategorized) to fit the training data. We aim to provide a unified model where TSG rules and symbol
Small Grammars and Primitive Wordsl
"... In [4] P&l Domosi, Dirk Hauschildt, Geza Horvath and Manfred Kudlek gave all contextfree grammars in Chomsky normal form with not more than three nonterminals generating only primitive words. In this paper we extend the characterization for grammars with four nonterminals generating only primit ..."
Generating all permutations by contextfree grammars in Chomsky normal form
 Theoretical Computer Science (TCS
"... Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1). We consider contextfree grammars Gn in Chomsky normal form that generate Ln. In particular we study a few families {Gn}n≥1, satisfying L(Gn) = Ln for n ≥ 1, with respect to their descriptional com ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
complexity, i.e., we determine the number of nonterminal symbols and the number of production rules of Gn as function of n.
Results 11  20
of
170