1445 search results - page 114 / 289 » Uniformly Hard Languages |
147
Voted
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
167
Voted
AGP
2010
IEEE
15 years 9 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
151
click to vote
ADBIS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
137
click to vote
AMET
1998
Springer
15 years 8 months ago
1998
Springer
We present a simple and uniform communication framework for an agent-based market infrastructure, the goal of which is to enable automation of consumer goods markets distributed ov...
129
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...