Abductive and Consistency-Based Diagnosis Revisited: a Modeling Perspective

Diagnostic reasoning has been characterized logically as consistency-based reasoning or abductive reasoning. Previous analyses in the literature have shown, on the one hand, that choosing the (in general more restrictive) abductive definition may be appropriate or not, depending on the content of the knowledge base [Console&Torasso91], and, on the other hand, that, depending on the choice of the definition the same knowledge should be expressed in different form [Poole94]. Since in Model-Based Diagnosis a major problem is finding the right way of abstracting the behavior of the system to be modeled, this paper discusses the relation between modeling, and in particular abstraction in the model, and the notion of diagnosis.Comment: 5 pages, 8th Int. Workshop on Nonmonotonic Reasoning, 200

Defeasible Reasoning in SROEL: from Rational Entailment to Rational Closure

In this work we study a rational extension $SROEL^R T$ of the low complexity description logic SROEL, which underlies the OWL EL ontology language. The extension involves a typicality operator T, whose semantics is based on Lehmann and Magidor's ranked models and allows for the definition of defeasible inclusions. We consider both rational entailment and minimal entailment. We show that deciding instance checking under minimal entailment is in general $\Pi^P_2$-hard, while, under rational entailment, instance checking can be computed in polynomial time. We develop a Datalog calculus for instance checking under rational entailment and exploit it, with stratified negation, for computing the rational closure of simple KBs in polynomial time.Comment: Accepted for publication on Fundamenta Informatica

Reasoning about Actions with Temporal Answer Sets

In this paper we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal Answer Set for domain descriptions, based on the usual notion of Answer Set. Also, we provide a translation of domain descriptions into standard ASP and we use Bounded Model Checking techniques for the verification of DLTL constraints.Comment: To appear in Theory and Practice of Logic Programmin

TellEat: sharing experiences on the move

In a context where, due to the proliferation of mobile devices, virtual social environments on the Web are taking up a very concrete role in the way people experience their surroundings, the Future Internet seems to be headed toward a mixture of Social Web, Semantic Web and Augmented Reality. As a part of a larger project that aims at building a social network of both people and things, we designed and developed TellEat, an iPhone-based application that allows users in mobility to share facts concerning people or objects that participate in the social network, and to discover pertinent events that have been told by others. In this paper we discuss both the client application, with the interaction model and interface metaphors that have been designed to make the experience as playful as possible for users, and the server-side services that provide the necessary knowledge and reasoning mechanisms. We also present the results of preliminary tests with users