4218 search results - page 87 / 844 » Complete sets of cooperations |
ISCIS
2004
Springer
14 years 2 months ago
2004
Springer
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...
AMAI
2004
Springer
14 years 23 days ago
2004
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
DAGSTUHL
2004
13 years 10 months ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
CL
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
AMAI
2005
Springer
13 years 9 months ago
2005
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...