Sciweavers

193 search results - page 21 / 39
» Decidable logics combining heap structures and data
Sort
View
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
13 years 11 months ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer
ICML
2005
IEEE
14 years 8 months ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...
FOSSACS
2007
Springer
14 years 1 months ago
Logical Reasoning for Higher-Order Functions with Local State
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
Nobuko Yoshida, Kohei Honda, Martin Berger
TIME
2007
IEEE
14 years 1 months ago
Constructing a Temporal Relation Tagged Corpus of Chinese Based on Dependency Structure Analysis
This paper describes an annotation guideline for a temporal relation-tagged corpus of Chinese. Our goal is construction of corpora to be used for a corpus-based analysis of tempor...
Yuchang Cheng, Masayuki Asahara, Yuji Matsumoto
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...