8413 search results - page 136 / 1683 » Ordering Problem Subgoals |
PLILP
1993
Springer
15 years 4 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
107
Voted
AAAI
2008
15 years 3 months ago
2008
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
118
click to vote
AISC
2008
Springer
15 years 2 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
100
Voted
AAAI
2006
15 years 2 months ago
2006
In this work, a generalized method for learning from sequence of unlabelled data points based on unsupervised order-preserving regression is proposed. Sequence learning is a funda...
119
Voted
FLAIRS
2006
15 years 2 months ago
2006
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...