1. Preliminaries In general, for languages which allow a flexible order of major constituents, the grammatical variations of simple sentences are truth-conditionally equivalent regardless of the constituent sequences and of the intonational patterns. In Spanish, for instance, the six logically possible variations of sentences containing three constituents, namely, subject, verb, and object are ...

In this paper, we investigate the extraction of fuzzy rules from data tables based on possibility theory. A possibilistic decision language is used to represent the extracted fuzzy rules. The algorithm for rule extraction is presented and the complexity analysis is carried out. Since the results of the rule induction process strongly depend on the representation language, we also discuss some a...

Possibility theory offers a qualitative framework for modeling decision under uncertainty. In this setting, pessimistic and optimistic decision criteria have been formally justified. The computation by means of possibilistic logic inference of optimal decisions according to such criteria has been proposed. This paper presents an Answer Set Programming (ASP)-based methodology for modeling decisi...

DL-Lite is a powerful and tractable family of description logics specifically tailored for applications that use huge volumes of data. In many real world applications, data are often provided by several and potentially conflicting sources of information having different levels of priority. Possibility theory offers a very natural framework to deal with ordinal and qualitative uncertain beliefs ...

Valuation-based systems (VBS) can be considered as a generic uncertainty framework that has many uncertainty calculi, such as probability theory, a version of possibility theory where combination is the product t-norm, Spohn’s epistemic belief theory, and DempsterShafer belief function theory, as special cases. In this paper, we focus our attention on conditioning, which is defined using the co...

This paper motivates the study of counterpossibles (logically impossible counterfactuals) as necessary for developing a decision theory suitable for generally intelligent agents embedded within their environments. We discuss two attempts to formalize a decision theory using counterpossibles, one based on graphical models and another based on proof search.

In this paper, we analyze the formalism proposed by Yager[6] to represent default knowledge in the framework of possibility theory. Three different application schemes are examined. The results produced by these application schemes are compared with those by Reiter’s default logic. It is shown that for a restricted class of default theories, there is some kinds of correspondence between Yager’s...

This short paper relates the conditional object-based and possibility theorybased approaches for reasoning with conditional statements pervaded with exceptions, to other methods in nonmonotonic reasoning which have been independently proposed: namely, Lehmann's preferential and rational closure entailments which obey normative postulates, the infinitesimal probability approach, and the conditio...

This paper presents a justiication of two qualitative counterparts of the expected utility criterion for decision under uncertainty, which only require bounded, linearly ordered, valuation sets for expressing uncertainty and preferences. This is carried out in the style of Savage, starting with a set of acts equipped with a complete preordering relation. Conditions on acts are given that imply ...

Numerical possibility measures can be interpreted as systems of upper betting rates for events. As such, they have a special part in the unifying behavioural theory of imprecise probabilities, proposed by Walley. On this interpretation, they should arguably satisfy certain rationality, or consistency, requirements, such as avoiding sure loss and coherence. Using a version of Walley’s notion of ...