نتایج جستجو برای: partial order

تعداد نتایج: 1109688  

2003
Yannick Pencolé

Failure diagnosis in large and complex systems is a critical and challenging task. In the realm of model based diagnosis on discrete event systems, computing a failure diagnosis means computing the set of system behaviours that could explain observations. Depending on the diagnosed system, such behaviours can be numerous, so that a problem of representing them is induced. The paper discusses ab...

Journal: :J. Comput. Physics 2016
Jörn Zimmerling Lei Wei Paul Urbach Rob Remis

Article history: Received 20 November 2015 Received in revised form 8 March 2016 Accepted 25 March 2016 Available online 31 March 2016

2003
Joëlle Provasi Anne Bobin-Bègue

Spontaneous motor tempo and rhythmical synchronisation were studied in 21⁄2to 4-year-old children. Children were tested in three sessions, each of which included three consecutive tasks: first, spontaneous manual tapping tempo, second, synchronisation to external tempo, followed by spontaneous manual tapping tempo again. Results showed that regular spontaneous manual tapping tempo could be obse...

2008
Yi Zhou Leon van der Torre Yan Zhang

Partial implication semantics in the context of a background theory has been introduced to formalize partial goal satisfaction in the context of beliefs. In this paper, we introduce strong partial implication prohibiting redundancies and weak partial implication allowing side effects, we study their semantic as well as complexity properties, and we apply the three notions of partial implication...

Journal: :J. Artif. Intell. Res. 2011
Lirong Xia Vincent Conitzer

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial orders instead. Then, given a voting rule, a profile of partial orders, and an alternative (candidate) c, two important questions arise: first, is it still poss...

1993
Mark Ryan

We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relations, which elements of the set are best? That is, which elements are most preferred by a consensus of the preference relations which takes account of their relative priority? The problem is posed in a deliberately general way, ...

2011
Sylvia Encheva

The importance of hints in an intelligent tutoring system is well understood. The problems however related to their delivering are quite a few. In this paper we propose delivering of hints to be based on considering their usefulness. By this we mean that a hint is regarded as useful to a student if the student has succeeded to solve a problem after the hint was suggested to her/him. Methods fro...

2004
Yi Zhou Xiaoping Chen

Motivational attitudes play an important role in investigations into intelligent agents. One of the key problems of representing and reasoning about motivational attitudes is which propositions are the desirable ones. The answer based on classical logic is that the propositions that logically imply the goal are desirable and the others are not. We argue that this criterion is inadequate for the...

2011
T. Binazadeh M. J. Yazdanpanah

In this paper, the problem of partial stabilization is considered for nonlinear control systems and a general approach for partial stabilization is proposed. In this approach, by introducing the notion of partially passive systems, some theorems for partial stabilization are developed. For this purpose, the nonlinear system is divided into two subsystems based on stability properties of system’...

Journal: :Math. Log. Q. 2005
Serikzhan A. Badaev Dieter Spreen

The different behaviour of total and partial numberings with respect to the reducibility preorder is investigated. Partial numberings appear quite naturally in computability studies for topological spaces. The degrees of partial numberings form a distributive lattice which in the case of an infinite numbered set is neither complete nor contains a least element. Friedberg numberings are no longe...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید