A Description Logic with Transitive and Inverse Roles and Role
... The algorithms that we will present use the tableaux method [16], in which the satisfiability of a concept D is tested by trying to construct a model of D. The model is represented by a tree in which nodes correspond to individuals and edges correspond to roles. Each node x is labelled with a set of ...
... The algorithms that we will present use the tableaux method [16], in which the satisfiability of a concept D is tested by trying to construct a model of D. The model is represented by a tree in which nodes correspond to individuals and edges correspond to roles. Each node x is labelled with a set of ...
Learning a Maximum Margin Subspace for Image
... based on Laplacian Eigenmaps and can be thought of as its linear variants. Out of the state-of-the-art linear manifold learning algorithms, ARE is the most relevant to our algorithm. ARE performs the relevance feedback image retrieval by using three graphs, that is, the similarity relational graph o ...
... based on Laplacian Eigenmaps and can be thought of as its linear variants. Out of the state-of-the-art linear manifold learning algorithms, ARE is the most relevant to our algorithm. ARE performs the relevance feedback image retrieval by using three graphs, that is, the similarity relational graph o ...
Some definable Galois theory and examples
... Several papers and/or preprints have appeared recently, giving a version of the Galois correspondence when the “constants” of the base field are not necessarily “closed” in the appropriate senses. The point of our current paper is to explain how these results are implicit or explicit in the model-th ...
... Several papers and/or preprints have appeared recently, giving a version of the Galois correspondence when the “constants” of the base field are not necessarily “closed” in the appropriate senses. The point of our current paper is to explain how these results are implicit or explicit in the model-th ...
