10882024
Frame problem in dynamic logic
This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. We encode Pednault's syntax-based solution, Baker's state-minimization policy, and Gelfond & Lifchitz's Action Language A 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, analyzing and unifying logics of action.
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.
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.
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.
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.
8370711
Consistency of Action Descriptions
As a contribution to the metatheory of reasoning about actions, we present some characteristics of the consistency of action theories. Three levels of consistency are investigated for the evaluation of action descriptions: uniform consistency, consistency of formulas and regional consistency. The first two provide an intuitive resolution of problems of explanation conflicts and fluent dependency. The concept of regional consistency provides for a measure of ramification. A highly expressive form of action descriptions, the normal form, is introduced to facilitate this analysis. The relative satisfiability of the situation calculus is generalized to accommodate non-deterministic effects and ramifications.
9840052
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP asks for a set of all fastest paths from s to e, one for each sub-interval of I. Note that the query algorithm should find a partitioning of I into sub-intervals. Existing methods can only be used to solve a very special case of the problem, when the leaving time is a single time instant. A straightforward solution to the allFP query is to run existing methods many times, once for every time instant in I. This paper proposes a solution based on novel extensions to the A* algorithm. Instead of expanding the network many times, we expand once. The travel time on a path is kept as a function of leaving time. Methods to combine travel-time functions are provided to expand a path. A novel lower-bound estimator for travel time is proposed. Performance results reveal that our method is more efficient and more accurate than the discrete-time approach.
6039211
Harmonic maps and their applications in surface matching
The surface-matching problem is investigated in this paper using a mathematical tool called harmonic maps. The theory of harmonic maps studies the mapping between different metric manifolds from the energy-minimization point of view. With the application of harmonic maps, a surface representation called harmonic shape images is generated to represent and match 3D freeform surfaces. The basic idea of harmonic shape images is to map a 3D surface patch with disc topology to a 2D domain and encode the shape information of the surface patch into the 2D image. This simplifies the surface-matching problem to a 2D image-matching problem. Due to the application of harmonic maps in generating harmonic shape images, harmonic shape images have the following advantages: they have sound mathematical background; they preserve both the shape and continuity of the underlying surfaces; and they are robust to occlusion and independent of any specific surface sampling scheme. The performance of surface matching using harmonic maps is evaluated using real data. Preliminary results are presented in the paper.
34860384
Computer Simulation Study on Central Pattern Generator: from Biology to Engineering
Central pattern generator (CPG) is a neuronal circuit in the nervous system that can generate oscillatory patterns for the rhythmic movements. Its simplified format, neural oscillator, is wildly adopted in engineering application. This paper explores the CPG from an integral view that combines biology and engineering together. Biological CPG and simplified CPG are both studied. Computer simulation reveals the mechanism of CPG. Some properties, such as effect of tonic input and sensory feedback, stable oscillation, robustness, entrainment etc., are further studied. The promising results provide foundation for the potential engineering application in future.
40685843
Experimental analysis of Harmonic Shape Images
In our early work, a representation called Harmonic Shape Images for 3D free-form surfaces was proposed and applied to solve the surface matching problem (D. Zhang and M. Hebert, 1999). Extensive experiments using real data are conducted to analyze the performance of Harmonic Shape Images with respect to discriminability, stability and robustness to resolution and occlusion. The results show that Harmonic Shape Images are an appropriate representation for 3D surface comparison. Examples of surface comparison using real data are presented.
11522705
A supply chain network equilibrium model with random demands
Abstract In this paper, we develop a supply chain network model consisting of manufacturers and retailers in which the demands associated with the retail outlets are random. We model the optimizing behavior of the various decision-makers, derive the equilibrium conditions, and establish the finite-dimensional variational inequality formulation. We provide qualitative properties of the equilibrium pattern in terms of existence and uniqueness results and also establish conditions under which the proposed computational procedure is guaranteed to converge. Finally, we illustrate the model through several numerical examples for which the equilibrium prices and product shipments are computed. This is the first supply chain network equilibrium model with random demands for which modeling, qualitative analysis, and computational results have been obtained.