Sciweavers

1826 search results - page 257 / 366
» Using Random Forests in the Structured Language Model
Sort
View
LFCS
2007
Springer
15 years 8 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
SIGIR
1993
ACM
15 years 6 months ago
A Model of Information Retrieval Based on a Terminological Logic
According to the logical model of Information Retrieval (IR), the task of IR can be described as the extraction, from a given document base, of those documents d that, given a que...
Carlo Meghini, Fabrizio Sebastiani, Umberto Stracc...
130
Voted
DSRT
2009
IEEE
15 years 6 months ago
Statemachine Matching in BOM Based Model Composition
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
Imran Mahmood, Rassul Ayani, Vladimir Vlassov, Far...
125
Voted
CADE
2007
Springer
16 years 2 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
107
Voted
NLDB
2007
Springer
15 years 8 months ago
Combining Vector Space Model and Multi Word Term Extraction for Semantic Query Expansion
Abstract. In this paper, we target document ranking in a highly technical field with the aim to approximate a ranking that is obtained through an existing ontology (knowledge stru...
Eric SanJuan, Fidelia Ibekwe-Sanjuan, Juan Manuel ...