In this paper, possibilistic linear programming problems are investigated. After reviewing relations among conjunction and implication functions, necessity fractile optimization models with various implication functions are applied to the possibilistic linear problems. We show that the necessity fractile optimization models are reduced to semi-infinite linear programming problems. A simple nume...

In this paper, a new construction method of a fuzzy implication from two given ones, called e-generation method, is introduced. This method allows to control, up to a certain level, the increasingness on the second variable of the fuzzy implication through an adequate scaling on that variable of the two given implications. The natural propagation of the most usual properties of fuzzy implicatio...

In this paper, we address the complexity issue of reasoning with implication constraints. We consider the IC-RFT problem, which is the problem of deciding whether a conjunctive yes/no query always produces the empty relation (\no" answer) on database instances satisfying a given set of implication constraints, as a central problem in this respect. We show that several other important problems, ...

We investigate the semantics of the logical systems obtained by introducing the modalities and ♦ into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Then, in the spirit of the LDS (Labelled Deductive Systems) methodology, we “import” this semantics into the classical proof system KE. This leads to the formulation of a uniform labelled...

We study the implication problem of measure-based constraints. These constraints are formulated in a framework for measures generalizing that for mathematical measures. Measures arise naturally in a wide variety of domains. We show that measure constraints, for particular measures, correspond to constraints that occur in relational databases, data mining applications, cooperative game theory, a...

it is well-known that “casual conditional” in islamic logics has been used with two meanings: “specific conditional” and “general conditional”. however, viewing the works of the muslim logicians, we find out that these two meanings of “casual conditional” have been interpreted in two various ways: each of the general and specific conditionals is sometimes interpreted as the condition of “non-ne...

Various proof methods have been proposed to solve the implication problem , i.e. proving that properties of the form : 8(P ! Q)-where P and Q denote conjunctions of atoms-are logical consequences of logic programs. Nonetheless, it is a commonplace to say that it is still quite a diicult problem. Besides, the advent of the constraint logic programming scheme constitutes not only a major step tow...

We consider semistructured data as multi rooted edge-labeled directed graphs, and path inclusion constraints on these graphs. A path inclusion constraint p q is satisfied by a semistructured data if any node reached by the regular query p is also reached by the regular query q. In this paper, two problems are mainly studied: the implication problem and the problem of the existence of a finite e...

With the growing use of XML as a format for the permanent storage of data, the study of functional dependencies in XML (XFDs) is of fundamental importance in understanding how to effectively design XML databases without redundancy or update problems. We investigate a central problem in dependency theory, that of determining when a set of XFDs logically implies another XFD in the context of XML ...

Human diseases have been investigated in the context of single genes as well as complex networks of genes. Though single gene approaches have been extremely successful in the past, most human diseases are complex and better characterized by multiple interacting genes commonly known as networks or pathways. With the advent of high-throughput technologies, a recent trend has been to apply network...