Trust is an approach to managing the uncertainty about autonomous entities and the information they store, and so can play an important role in any decentralized system. As a result, trust has been widely studied in multiagent systems and related fields such as the semantic web. Here we introduce a simple approach to reasoning about trust with logi

Granularity is the concept of breaking down an event into smaller parts or granules such that each individual granule plays a part in the higher level event. Humans can seamlessly shift their granularity perspectives while reading or understanding a text. To emulate such a mechanism, we describe a theory for inferring this information automatically from raw input text descriptions and some background knowledge to learn the global behavior of event descriptions from local behavior of components. We also elaborate on the importance of discovering granularity structures for solving NLP problems such as — automated question answering and text summarization.

Temporal encoding schemes using RDF and OWL are often plagued by a massive proliferation of useless "container" objects. Reasoning and querying with such representations is extremely complex, expensive, and error-prone. We present a temporal extension of the Hayes and ter Horst entailment rules for RDFS/OWL. The extension is realized by extending RDF triples with further temporal arguments and requires only some lightweight forms of reasoning. The approach has been implemented in the forward chaining engine HFC.

In this paper we contribute to bridging the gap between human reasoning as studied in Cognitive Science and commonsense reasoning based on formal logics and formal theories. Stenning and van Lambalgen presented an approach to model human reasoning by means of logic programs. In this paper, we extend a refined version of their approach by abduction and demonstrate that this permits to adequately model various empiric results on the suppression task reported from Cognitive Science.

We are developing an ontology of microsocial concepts for use in an instructional system for teaching cross-cultural communication. We report here on that part of the ontology relating to interpersonal relationships. We first explicate the key concepts of commitment, shared plans, and good will. Then in terms of these we present a formal account of the host-guest relationship.

I begin by considering examples of practical reasoning. In the remainder of the paper, I try to say something about what Example 8. Playing soccer. Soccer is like table tennis, but a logical approach that begins to do justice to the subject with the added dimension of teamwork and the need to might be like. This task was selected as a benchmark problem in robotics, and has been extensively Example 1. Ordering a meal at a restaurant. Here, the problem is deciding what to eat and drink. Typing an email message, Even if the only relevant factors are price and preferences composing it as you go along, starts perhaps with a general about food, the number of possible combinations is very idea of what to say.

Starting from a general characterization of roles, we focus on the ways in which roles are specified, we examine the formal constraints on their definitions, and propose definitional schemas motivating different kinds of roles. This classification, in addition to clarify the notion of role itself, helps us to reconsider the two standard solutions that have been proposed for the famous counting problem, and to suggest that a third mixed approach may be considered.

It has been argued that causal rules are necessary for representing both implicit side-effects of actions and action qualifications, and there have been a number different approaches for representing causal rules in the area of formal theories of actions. These different approaches in general agree on rules without cycles. However, they differ on causal rules with mutual cyclic dependencies, both in terms of how these rules are supposed to be represented and their semantics. In this paper we show that by adding one more minimization to Lin's circumscriptive causal theory in the situation calculus, we can have a uniform representation of causal rules including those with cyclic dependencies. We also demonstrate that sometimes causal rules can be compiled into logically equivalent (under a proposed semantics) successor state axioms even in the presence of cyclical dependencies between fluents.

This paper presents the formalization of a biological process, cell division, in modular action language ALM. We show how the features of ALM — modularity, separation between an uninterpreted theory and its interpretation — lead to a simple and elegant solution that can be used in answering questions from biology textbooks.

In this work, we present a causal extension of logic programming under the stable models semantics where, for a given stable model, we capture the alternative causes of each true atom. The syntax is extended by the simple addition of an optional reference label per each rule in the program. Then, the obtained causes rely on the concept of a causal proof: an inverted tree of labels that keeps track of the ordered application of rules that has allowed deriving a given true atom.