Sciweavers

316 search results - page 50 / 64
» Expressiveness of graph conditions with variables
Sort
View
STACS
2010
Springer
15 years 4 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
82
Voted
CSL
2009
Springer
15 years 4 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
78
Voted
SIGIR
2004
ACM
15 years 3 months ago
Dependence language model for information retrieval
This paper presents a new dependence language modeling approach to information retrieval. The approach extends the basic language modeling approach based on unigram by relaxing th...
Jianfeng Gao, Jian-Yun Nie, Guangyuan Wu, Guihong ...
RULEML
2004
Springer
15 years 3 months ago
R-DEVICE: A Deductive RDF Rule Language
In this paper we present R-DEVICE, a deductive rule language for reasoning about RDF metadata. R-DEVICE includes features such as normal and generalized path expressions, stratifie...
Nick Bassiliades, Ioannis P. Vlahavas
CORR
2007
Springer
177views Education» more  CORR 2007»
14 years 9 months ago
N3Logic: A Logical Framework For the World Wide Web
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi ...