KR

This paper offers two main contributions. On the one hand, it establishes a general formal framework for developing a foundational ontology of socially constructed entities, in the broadest sense of this notion; on the other hand, it further contributes to understanding the ontological nature of roles. The key choice here is to put all social entities in the domain of discourse: besides social individuals, we also consider 'reified' social concepts and roles, as well as their descriptions, i.e, the 'social conventions' or 'contexts' that define them. This allows us to formally characterize in a first-order theory the relationships among all these entities.

In this paper, we explore the links between measures of in- consistency for a belief base and the minimal inconsistent subsets of that belief base. The minimal inconsistent subsets can be considered as the relevant part of the base to take into account to evaluate the amount of inconsistency. We define a very natural inconsistency value from these minimal incon- sistent sets. Then we show that the inconsistency value we obtain is a particular Shapley Inconsistency Value, and we provide a complete axiomatization of this value in terms of five simple and intuitive axioms. Defining this Shapley In- consistency Value using the notion of minimal inconsistent subsets allows us to look forward to a viable implementation of this value using SAT solvers.

This paper describes a logic-based formalism which combines techniques for reasoning about actions with standard mathematical techniques for modelling dynamic systems using the differential calculus. The formalism inherits a robust solution to the ...

An algorithm is presented which eliminates second{order quantiers over predicate vari- ables in formulae of type 9P1; ... ;Pn where is an arbitrary formula of rst{order pred- icate logic. The resulting formula is equiva- lent to the original formula { if the algorithm terminates. The algorithm can for example be applied to do interpolation, to eliminate the second{order quantiers in

This paper offers two main contributions. On the one hand, it establishes a general formal framework for developing a foundational ontology of socially constructed entities, in the broadest sense of this notion; on the other hand, it further contributes to understanding the ...

This paper offers two main contributions. On the one hand, it establishes a general formal framework for developing a foundational ontology of socially constructed entities, in the broadest sense of this notion; on the other hand, it further contributes to understanding the ...

Intentions, an integral part of the mental state of an agent, play an important role in determining the behavior of rational agents as they seek to attain their goals. In this paper, a formalization of intentions based on a branching-time possible-worlds model is presented. ...

John McCarthy's situation calculus has left an enduring mark on artificial intelligence research. This simple yet elegant formalism for modelling and reasoning about dynamic systems is still in common use more than forty years since it was first proposed. The ability to reason about action and change has long been considered a necessary component for any intelligent system. The situation

The computational grounding problem–the gap between the mental models of an agent and its computational model–is a well known problem within the agent research community. For years, it has been believed that obscure ontological status is the principal ...

The goal of this paper is to describe and thoroughly test a decision procedure, called Ksat, checking satisfiability in the terminological logic ALC. Ksat is said to be SAT-based as it is defined in terms of a decision procedure for propositional satisfiability (SAT). The tests are performed comparing Ksat with, among other procedures, Kris, a state-of-the-art tableau-based implementation of a decision procedure for ALC. Ksat outperforms Kris of orders of magnitude. Furthermore, the empirical results highlight an intrinsic weakeness that tableau-based decision procedures have with respect to SAT-based decision procedures.

The topic of preference modeling has recently attracted the interest of a number of sub-disciplines in artificial intelli-gence such as the nonmonotonic reasoning and action and change communities. The approach in these communities fo-cuses on qualitative preferences and preference models which provide more natural representations from a commonsense perspective. In this paper, we show how generalized circum-scription can be used as a highly expressive framework for qualitative preference modeling. Generalized circumscrip-tion proposed by Lifschitz allows for predicates (and thus formulas) to be minimized relative to arbitrary pre-orders (reflexive and transitive). Although it has received little at-tention, we show how it may be used to model and reason about elaborate qualitative preference relations. One of the perceived weaknesses with any type of circumscription is the 2nd-order nature of the representation. The paper shows how a large variety of preference theories represented ...

We show that by introducing an appropriate schema concept and exploiting the higher-level features of a resonance function in a neural network it is possible to define a form of nonmonotonic inference relation between the input and the output of the network. This inference relation satisfies some of the most fundamental postulates for nonmonotonic logics. The construction presented in the paper is an example of how symbolic features can emerge from the subsymbolic level of a neural network.

A formal language for representing and reasoning about time and action is presented. We employ an action representation in the style of Allen, where an action is represented by describing the time course of events while the action occurs. In this sense, an action is de ned by means of temporal constraints on the world states, which pertain to the action itself, and on other more elementary actions occurring over time. A distinction between action types and individual actions is supported by the formalism. Plans are seen ...

An unprecedented combination of simulative and metaphor based reasoning about beliefs is achieved in an AI system, ATT-Meta. Much mundane discourse about beliefs productively uses conceptual metaphors such as MIND AS CONTAINER and IDEAS AS INTERNAL UTTERANCES, and ATT-Meta's metaphor-based reasoning accordingly leads to crucial discourse comprehension decisions. ATT-Meta's non-metaphorical mode of belief reasoning includes simulative reasoning (SR).

This paper offers two main contributions. On the one hand, it establishes a general formal framework for developing a foundational ontology of socially constructed entities, in the broadest sense of this notion; on the other hand, it further contributes to understanding the ...

The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal the- ory satisfying the Negation As Default principle (alias Closed World Assumption). Moreover, unlike well-known transla- tions of logic programs to other nonmonotonic formalisms, the established correspondence between

... Oren Etzioni Keith Golden Daniel Weld Department of Computer Science and Engineering University of Washington Seattle, WA 98195 fetzioni, kgolden, weldg@cs.washington.edu Abstract ... To see this, consider a singleton LCW query such as LCW(parent:dir(f; /kr94)). ...

I have been asked about the paper "What's in a Link": how it came to be, what was happening in the field at the time, and how the ideas have evolved since then. This talk will describe my perspective on some of the things that I saw happening around me that led me to write the paper, some of the background thoughts that led to the ideas presented there, and how some of those ideas have evolved since then. In this abstract, I will list some of the threads that I will discuss and provide some of the relevant references. "What's in a Link" (Woods, 1975), advocated a standard of rigor for the representational conventions used in semantic networks and pointed out some of the different things that a link can be used for and some of the confusions that were present in many informal notions of network representation. The message of that paper has been well received, and my goals of stimulating more attention to the semantics of representational devices has been...