1234389
Nonmonotonic Reasoning and Multiple Belief Revision
The aim of the present paper is to reveal the interrelation between general patterns of nonmonotonic reasoning and multiple belief revision. For this purpose we de ne a nonmonotonic inference frame in which individual inference rules have been proposed in the literature but their combination as a system has not been investigated. It is shown that such a system is so strong that almost all the rules (including the supracompactness) suggested for nonmonotonic inference relations in the literature hold in it. We prove that this nonmonotonic inference frame is strictly correspendent with multiple belief revision operation. On the basis of this result we analyse a speci c paradigm of defult theory which satis es all the rules under consideration and discuss limitations of methods based on consequence relations for the study of nonmonotonic reasoning.
9693532
Negotiation mechanism for TAC SCM component market
This paper presents a new negotiation mechanism and a new supplier model for Trading Agent Competition Supply Chain Management(TAC SCM). Under the new negotiation mechanism, an agent is allowed to negotiate with component suppliers on price, delivery date and supply quantity while a supplier can autonomously vary its production capacity with market demands and allocate its products to buyers through auction. A mathematical analysis is given to ensure the new negotiation mechanism and supplier model effectively solve the existing problems while keeping most good features of the original TAC SCM game model.
10744441
Autonomy of Autonomous Agents
Autonomy is one of the most notable attributes of agency, and this paper presents a formal framework for modelhng it. By representing the mental states of agents, we provide an analysis of some attributes of autonomy. In particular, we define three sorts of autonomous agents and examine their structure. We also outline features of higher autonomy. Our framework can be a basis for cleissifying hierarchies of autonomy of agency.
35603840
State Minimization Re-visited
A well-known circumscription policy in situation calculus theories of actions is to minimize the Abnormality predicate by varying the Holds predicate. Unfortunately this admitted counter-intuitive models. A different policy of varying the Result function eliminated these models. Explanations of how it did this are not entirely satisfactory, but seem to appeal to informal notions of state minimization. We reexamine this policy and show that there are simple justifications for it that are based on classical automata theory. It incidentally turns out that the description "state minimization" for the varying Result policy is more accurate than the original nomenclature had intended.
1042778
Axiomatic Analysis of Negotiation Protocols
This paper presents an axiomatic approach to negotiation protocol analysis. We consider a negotiation procedure as multiple stages of mutual belief revision. A set of postulates in AGM-style of belief revision are proposed to specify rational behavior of negotiation. An explicit construction of negotiation function is given in which negotiation process is viewed as the interaction of two iterated revision operations. As a result the proposed axiomatic system is proved to be consistent. Finally, we examine our approach with an instantiation of Rosenschein and Zlotkin’s Monotonic Concession Protocol of Negotiation.
15449547
Encoding Solutions of the Frame Problem in Dynamic Logic
We investigate the relationship amongst some solutions to the frame problem. We encode Pednault's syntax-based solution [20], Baker's state-minimization policy [1], and Gelfond & Lifchitz's Action Language A [7] in the propositional dynamic logic (PDL). The formal relationships among these solutions are given. The results of the paper show that dynamic logic, as one of the formalisms for reasoning about dynamic domains, can be used as a formal tool for comparing and unifying logics of action.
7615477
Efficient mining of max frequent patterns in a generalized environment
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment.
8536303
Web Based Question Answering with Aggregation Strategy
The Web is apparently an ideal source of answers to a large variety of questions, due to the tremendous amount of information available online. This paper describes a question answering system LAMP, which can instantly find answers from the Web. LAMP is publicly accessible on the Web, and its performance is comparable to the state-of-the-art question answering systems. One novel characteristic of this system is that its answer selection method is based on aggregation, which is shown to be more effective than the common methods based on individual or redundancy.
8809044
Adaptive Vision for Playing Table Soccer
For real time object recognition and tracking often color-based methods are used. While these methods are very efficient, they usually dependent heavily on lighting conditions. In this paper we present a robust and efficient vision system for the table soccer robot KiRo. By exploiting knowledge about invariant characteristics of the table soccer game, the system is able to adapt to changing lighting conditions dynamically and to detect relevant objects on the table within a few milliseconds. We give experimental evidence for the robustness and efficiency of our approach.
13991122
Multi-scale classification of 3-D objects
We describe an approach to the classification of 3-D objects using a multi-scale representation. This approach starts with a smoothing algorithm for representing objects at different scales. Smoothing is applied in curvature space directly, thus avoiding the usual shrinkage problems and allowing for efficient implementations. A 3-D similarity measure that integrates the representations of the objects at multiple scales is introduced. Given a library of models, objects that are similar based on this multi-scale measure are grouped together into classes. The objects that are in the same class are combined into a single prototype object. Finally, the prototypes are used for hierarchical recognition by first comparing the scene representation to the prototypes and then matching it only to the objects in the most likely class rather than to the entire library of models. Beyond its application to object recognition, this approach provides an attractive implementation of the intuitive notions of scale and approximate similarity for 3-D shapes.
489296
Multimodal Integration for Meeting Group Action Segmentation and Recognition
We address the problem of segmentation and recognition of sequences of multimodal human interactions in meetings. These interactions can be seen as a rough structure of a meeting, and can be used either as input for a meeting browser or as a first step towards a higher semantic analysis of the meeting. A common lexicon of multimodal group meeting actions, a shared meeting data set, and a common evaluation procedure enable us to compare the different approaches. We compare three different multimodal feature sets and our modelling infrastructures: a higher semantic feature approach, multi-layer HMMs, a multi-stream DBN, as well as a multi-stream mixed-state DBN for disturbed data.