3172 search results - page 211 / 635 » On the Random-Self-Reducibility of Complete Sets |
182
click to vote
AIPS
2007
15 years 9 months ago
2007
High-level actions (HLAs) lie at the heart of hierarchical planning. Typically, an HLA admits multiple refinements into primitive action sequences. Correct descriptions of the ef...
169
click to vote
AIML
2008
15 years 8 months ago
2008
We present a complete axiomatization of a logic denoted by MTML (Mereo-Topological Modal Logic) based on the following set of mereotopological relations: part-of, overlap, underlap...
169
click to vote
CLA
2006
15 years 8 months ago
2006
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
173
click to vote
ACL
1997
15 years 8 months ago
1997
This paper presents a method to combine a set of unsupervised algorithms that can accurately disambiguate word senses in a large, completely untagged corpus. Although most of the ...
175
click to vote
IJCAI
1989
15 years 7 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...