Name
Abstract | ||
|---|---|---|
We propose an extension of primal grammars (Hermann and Galbavý, Theor Comp Sci 176(1---2):111---158, 1997), called P-grammars. Primal grammars are term grammars with a high expressive power and good computational properties. P-grammars have exactly the same properties but are more modular, more concise, and easier to use, as shown by some examples. We prove that P-grammars are exponentially more concise than primal grammars. An algorithm, called p2primal, transforming any P-grammar into an equivalent primal grammar is provided, thus making the original formalism much easier to handle from a practical point of view. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s10472-010-9200-3 | Ann. Math. Artif. Intell. |
Keywords | DocType | Volume |
Term schematisation,Grammars,Automated deduction,68Q42 | Journal | 58 |
Issue | ISSN | Citations |
3-4 | 1012-2443 | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent Aravantinos | 1 | 86 | 10.29 |
| Ricardo Caferra | 2 | 303 | 29.85 |
| Nicolas Peltier | 3 | 50 | 11.84 |