Compositional models were initially described for discrete probability theory, and later extended for possibility theory and for belief functions in Dempster-Shafer (D-S) theory of evidence. Valuation-based system (VBS) is an unifying theoretical framework generalizing some of the well known and frequently used uncertainty calculi. This generalization enables us to not only highlight the most i...

This article presents a system created in the computer-aided composition environment OpenMusic in order to handle complex compositional data related to sound synthesis processes. This system gathers two complementary strategies: the use of sound analysis data as basic material, and the specification of abstract rules in order to automatically process and extend this basic material.

Systems applying fuzzy logic are rule based ones. The collection of the rules the so called rule base can be characterized as dense or sparse depending on whether there exist rules for all the possible observations. In the sparse case for some observations there are no rules whose antecedent part would overlap the observation at least partially. Therefore the classical compositional reasoning m...

justice rule is among the legal rules that have less dealt with. application of this rule is based on achievement of justice as an attribute for legal rulings. some jurists have no regarded human beings to be capable of comprehending the legal rulings as just and have subjected it to the legislator’s view. thus, using this rule in inference of legal issues and extending it to jurisprudence has ...

Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks such as controlling fluid levels in a reactor, automatical lens focussing in cameras and adjusting an aircraft’s navigation to the change of winds and so on. Contrary to the intuition often seen as the feeding ground of fuzz...

This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker or a theorem prover, uses known state invariants to prove state and transition invariants. Two proof rules are presented: a standard incremental proof rule analogous to Manna and Pnueli’s incremental proof rule and a c...