The relational database model has been proven to be a very useful model in database management systems and has been widely applied [4]. The inherence of the relational database model is effective for precise and unambiguous data. However, realworld applications often involve incomplete information. In this study, a logical fuzzy relational database model was proposed to accommodate incomplete i...

Burst-tonic (BT) neurons in the prepositus hypoglossi and adjacent medial vestibular nuclei are important elements of the neural integrator for horizontal eye movements. While the metrics of their discharges have been studied during conjugate saccades (where the eyes rotate with similar dynamics), their role during disjunctive saccades (where the eyes rotate with markedly different dynamics to ...

In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programming and Disjunctive Deductive Databases. While the semantics of non-disjunctive programs is fairly well understood, the declarative and computational foundations of disjunctive logic programming proved to be much more elusive and diicult. Recently, two new and promising semantics have bee...

Nowadays, many researchers are working on Constraint Satisfaction Problems (CSPs). Many CSPs can be modelled as non-binary CSPs and, theoretically, they can be transformed into an equivalent binary CSP, using some of the current techniques. However, this transformation may be an inadequate or inefficient way to manage certain types of non-binary constraints. In this paper, we propose an algorit...

Set-valued information systems are generalized models of single-valued information systems. Its semantic interpretation can be classified into two categories: disjunctive and conjunctive. We focus on the former in this paper. By introducing four types of dominance relations to the disjunctive set-valued information systems, we establish a dominance-based rough sets approach, which is mainly bas...

We propose three equivalent domain-theoretic semantics for dis-junctive logic programs in the style of Gelfond and Lifschitz. These are (i) a resolution-style inference semantics; (ii) a model-theoretic semantics; and (iii) a (nondeterministic) state-transition semantics. We show how these three semantics generalize \for free" to disjunctive logic programming over any Scott domain. We also rela...