Quentin Elhaik, M-C Rousset, and Bernard Ycart. Generating Random Benchmarks for Description Logics. In Proceedings of DL'98. 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Stopping tests for Markov Chain Monte-Carlo methods - Ycart (1999) Self-citation (Ycart) (Correct)
....to make sure that the cutoff time has been reached. Those results are the object of section 2. 3 The method we propose can be summarized as follows. First choose an initial state i and a state function f . In problems of practical interest, some choices are usually more natural than others (see [5]) In general, the target value hf; i is not known. It has to be estimated by a confidence interval, over a few trajectories. This is the analogue of the warm up period for single chain methods. Then the n independent copies should be run until some hitting time. This hitting time can be the ....
Elhaik, Q., Rousset, M.C., and Ycart, B. Generating random benchmarks for description logics. Proceedings of the 1998 Int. Workshop on Description Logics 22 (DL'98), Trento, 95--99, 1998.
Cutoff for Markov chains: some examples and applications - Ycart Self-citation (Ycart) (Correct)
....in general on the initial distribution, though some uniform results will be given, in particular in sections 2 and 5. This text is not meant as a review of the fast growing literature on the subject, but rather as a presentation of a few results obtained recently, essentially those of references [11, 21, 31, 32], with a strong bias towards applications and unification of seemingly distinct notions. We shall give full proofs only for some results (Propositions 2.1, 2.2, 3.1 and 4.1) and outline briefly the proofs of some others, referring to [11, 21, 31, 32] for more details. Section 2 deals with ....
....recently, essentially those of references [11, 21, 31, 32] with a strong bias towards applications and unification of seemingly distinct notions. We shall give full proofs only for some results (Propositions 2.1, 2.2, 3.1 and 4. 1) and outline briefly the proofs of some others, referring to [11, 21, 31, 32] for more details. Section 2 deals with n samples of i.i.d. finite Markov chains both in discrete (2.1) and in continuous time (2.2) The application to MCMC algorithms is treated in section 3. Several notions of hitting times are defined and their asymptotic equivalence to the cutoff time is ....
[Article contains additional citation context not shown here]
Q. Elhaik, M.C. Rousset, and B. Ycart. Generating random benchmarks for description logics. Proceedings of the 1998 Int. Workshop on Description Logics (DL'98), 95--99, Trento, 1998.
Making an Abox Persistent - Elhaik, Rousset (1998) (1 citation) Self-citation (Elhaik Rousset) (Correct)
....for building facts and concepts. In this paper, we consider Aboxes composed of instances of concepts and roles in the setting of the DL language (referred to as core CLASSIC) having the constructors u; 8; nR) nR) and : on basic concepts only) The paper is organized as follows. Section 2 provides the basic definitions of the problem that we consider. In section 3, we propose an encoding for core Classic Aboxes. In section 4, we provide an algorithm which, given a database encoding an Abox A, and a fact f to be added, computes the set of facts in the database that are relevant to ....
....and O a set of individuals. An Abox relative to V, L and O is a set of facts of the form C(a) or R(a; b) where C and R are concept and role expressions that can be built from V using the constructors of L, and a and b are individuals of O. Example 2. 1: Let A 1 : f( 1 R 0 ) a 0 ) 2 R 1 ) a 1 ) 8R 2 A 2 ) a 1 ) 8R 0 (8R 2 :A 2 ) a 3 ) R 0 (a 0 ; a 1 ) R 1 (a 1 ; a 2 )g A 1 is an Abox relative to the vocabulary V 1 = fA 1 ; A 2 ; A 3 ; R 0 ; R 1 ; R 2 g, the language core CLASSIC, and the set O of individuals fa 0 ; a 1 ; a 2 ; a 3 g. Definition 2.2: Let A be an Abox ....
[Article contains additional citation context not shown here]
Quentin Elhaik and M-C Rousset and Bernard Ycart. Generating Random Benchmarks for Description Logics. In Proceedings of DL'98, 1998.
Benchmarking DAML+OIL Repositories - Yuanbo Guo Jeff (2003) (Correct)
No context found.
Quentin Elhaik, M-C Rousset, and Bernard Ycart. Generating Random Benchmarks for Description Logics. In Proceedings of DL'98. 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC