Sciweavers

268 search results - page 6 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
JSC
2006
81views more  JSC 2006»
13 years 8 months ago
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
Joris van der Hoeven, John Shackell
FMCAD
2006
Springer
14 years 4 days ago
Formal Analysis and Verification of an OFDM Modem Design using HOL
In this paper we formally specify and verify an implementation of the IEEE802.11a standard physical layer based OFDM (Orthogonal Frequency Division Multiplexing) modem using the HO...
Abu Nasser Mohammed Abdullah, Behzad Akbarpour, So...
IJAR
2008
129views more  IJAR 2008»
13 years 8 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
EDBT
2006
ACM
112views Database» more  EDBT 2006»
14 years 8 months ago
Expressiveness and Performance of Full-Text Search Languages
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugas...
COLING
1994
13 years 9 months ago
Parsing A Flexible Word Order Language
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their ...
Vladimir Pericliev, Alexander Grigorov