8825 search results - page 122 / 1765 » All for one or one for all |
111
click to vote
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
124
click to vote
ILP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
KR
2004
Springer
15 years 6 months ago
2004
Springer
This paper offers two main contributions. On the one hand, it establishes a general formal framework for developing a foundational ontology of socially constructed entities, in th...
106
click to vote
PADL
2004
Springer
15 years 6 months ago
2004
Springer
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
PAKDD
2004
ACM
15 years 6 months ago
2004
ACM
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...