2214 search results - page 77 / 443 » Complexity of Reasoning |
121
click to vote
NIPS
2007
15 years 4 months ago
2007
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
103
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
101
Voted
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
150
click to vote
RR
2010
Springer
15 years 1 months ago
2010
Springer
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped co...
122
click to vote
ILP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Reasoning plays a central role in intelligent systems that operate in complex situations that involve time constraints. In this paper, we present the Adaptive Logic Inter...