Dealing Automatically with Exceptions by Introducing Specificity in ASP

Answer Set Programming (ASP), via normal logic programs, is known as a suitable framework for default reasoning since it offers both a valid formal model and operational systems. However, in front of a real world knowledge representation problem, it is not easy to represent information in this framework. That is why the present article proposed to deal with this issue by generating in an automatic way the suitable normal logic program from a compact representation of the information. This is done by using a method, based on specificity, that has been developed for default logic and which is adapted here to ASP both in theoretical and practical points of view

Influence of Context on Decision Making during Requirements Elicitation

Requirements engineers should strive to get a better insight into decision making processes. During elicitation of requirements, decision making influences how stakeholders communicate with engineers, thereby affecting the engineers' understanding of requirements for the future information system. Empirical studies issued from Artificial Intelligence offer an adequate groundwork to understand how decision making is influenced by some particular contextual factors. However, no research has gone into the validation of such empirical studies in the process of collecting needs of the future system's users. As an answer, the paper empirically studies factors, initially identified by AI literature, that influence decision making and communication during requirements elicitation. We argue that the context's structure of the decision should be considered as a cornerstone to adequately study how stakeholders decide to communicate or not a requirement. The paper proposes a context framework to categorize former factors into specific families, and support the engineers during the elicitation process.Comment: appears in Proceedings of the 4th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge (ARCOE), 2012, Montpellier, France, held at the European Conference on Artificial Intelligence (ECAI-12

Coping with the Limitations of Rational Inference in the Framework of Possibility Theory

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does not provide expected results either because it cannot produce them, or even provide counter-intuitive conclusions. This state of facts is not due to the principle of selecting a unique ordering of interpretations (which can be encoded by one possibility distribution), but rather to the absence of constraints expressing pieces of knowledge we have implicitly in mind. It is advocated in this paper that constraints induced by independence information can help finding the right ordering of interpretations. In particular, independence constraints can be systematically assumed with respect to formulas composed of literals which do not appear in the conditional knowledge base, or for default rules with respect to situations which are "normal" according to the other default rules in the base. The notion of independence which is used can be easily expressed in the qualitative setting of possibility theory. Moreover, when a counter-intuitive plausible conclusion of a set of defaults, is in its rational closure, but not in its preferential closure, it is always possible to repair the set of defaults so as to produce the desired conclusion.Comment: Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996

Probabilistic Default Reasoning with Conditional Constraints

We propose a combination of probabilistic reasoning from conditional constraints with approaches to default reasoning from conditional knowledge bases. In detail, we generalize the notions of Pearl's entailment in system Z, Lehmann's lexicographic entailment, and Geffner's conditional entailment to conditional constraints. We give some examples that show that the new notions of z-, lexicographic, and conditional entailment have similar properties like their classical counterparts. Moreover, we show that the new notions of z-, lexicographic, and conditional entailment are proper generalizations of both their classical counterparts and the classical notion of logical entailment for conditional constraints.Comment: 8 pages; to appear in Proceedings of the Eighth International Workshop on Nonmonotonic Reasoning, Special Session on Uncertainty Frameworks in Nonmonotonic Reasoning, Breckenridge, Colorado, USA, 9-11 April 200