4218 search results - page 219 / 844 » Complete sets of cooperations |
107
Voted
AIML
2008
15 years 2 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...
106
click to vote
CLA
2006
15 years 2 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...
103
Voted
ACL
1997
15 years 2 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 ...
115
Voted
IJCAI
1989
15 years 1 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...
AIPS
2009
15 years 1 months ago
2009
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MD...