Sciweavers

681 search results - page 7 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
TOCL
2008
128views more  TOCL 2008»
13 years 7 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
FM
2003
Springer
104views Formal Methods» more  FM 2003»
14 years 28 days ago
Proving the Shalls
Incomplete, inaccurate, ambiguous, and volatile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods o...
Steven P. Miller, Alan C. Tribble, Mats Per Erik H...
FLAIRS
2009
13 years 5 months ago
Organizing Knowledge as an Ontology of the Domain of Resilient Computing by Means of Natural Language Processing - An Experience
Scientists typically need to take a large volume of information into account in order to deal with re-occurring tasks such as inspecting proceedings, finding related work, or revi...
Algirdas Avizienis, Gintare Grigonyte, Johann Hall...
SEMWEB
2010
Springer
13 years 5 months ago
Supporting Natural Language Processing with Background Knowledge: Coreference Resolution Case
Systems based on statistical and machine learning methods have been shown to be extremely effective and scalable for the analysis of large amount of textual data. However, in the r...
Volha Bryl, Claudio Giuliano, Luciano Serafini, Ka...