364 search results - page 2 / 73 » Generalized normal forms and polynomial system solving |
77
Voted
COLING
1992
14 years 10 months ago
1992
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for...
CASC
2007
Springer
15 years 1 months ago
2007
Springer
We find a full system of invariants with respect to gauge transformations L g-1 Lg for third-order hyperbolic linear partial differential operators on the plane. The operators are...
RTA
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...