Sciweavers

767 search results - page 151 / 154
» Logic for Mathematical Writing
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 10 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
FLAIRS
2007
13 years 9 months ago
Indexing Documents by Discourse and Semantic Contents from Automatic Annotations of Texts
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
Brahim Djioua, Jean-Pierre Desclés
PASTE
2010
ACM
13 years 9 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
IJCAI
2007
13 years 9 months ago
Cooperating Reasoning Processes: More than Just the Sum of Their Parts
Using the achievements of my research group over the last 30+ years, I provide evidence to support the following hypothesis: By complementing each other, cooperating reasoning pro...
Alan Bundy
SCS
2003
13 years 8 months ago
A New Component Concept for Fault Trees
The decomposition of complex systems into manageable parts is an essential principle when dealing with complex technical systems. However, many safety and reliability modelling te...
Bernhard Kaiser, Peter Liggesmeyer, Oliver Mä...