Intuitively, a collision resistant function (CRF) f is a function for which it is hard to find two inputs s.t. their images collide: If x 6= x′, then w.h.p. f(x) 6= f(x′). It is easy to see that any one-to-one function satisfies this requirement. However, we are interested in functions that are many-to-one, specifically, functions that map long inputs to short inputs, i.e., |f(x)| < |x|. One im...

We present an attempt to reconcile the theoretical work on reasoning about action with the realization of agents, in particular mobile robots. Speci cally, we present a logical framework for representing dynamic systems based on description logics, which allows for the formalization of sensing actions. We address the generation of conditional plans by de ning a suitable reasoning method in whic...

W e model a firm's decisions about product innovation, focusing on the extent to which features should be improved or changed in the succession of models that comprise a life cycle. We show that the structure of the internal and external environment in which a firm operates suggests when to innovate to the technology frontier. The criterion is maxi-mization of the expected present value of prof...

This paper presents a formalization of the energy management problem in hybrid electric vehicles and a comparison of three known methods for solving the resulting optimization problem. Dynamic programming (DP), Pontryagin’s minimum principle (PMP), and equivalent consumption minimization strategy (ECMS) are described and analyzed, showing formally their substantial equivalence. Simulation resul...

In this paper we discuss an alternative definition of a program. We name this formalization as a mapcode and attempt to explore the theoretical issues of computability by mapcodes. We show that mapcodes not only define programs as mathematical entities in a natural manner, but also they are equivalent to Turing machines. The equivalence is shown by proving that the class of mapcode computable f...

This paper presents a theoretical and methodological framework to take into consideration the social dimension in a sustainable development project. To do this, the authors have developed the SocLab software environment, which implements a formalization of a well-established sociological theory, and enables the modeling of social organizations, to analyze their properties and to simulate social...

We model a rm's decisions about product innovation, focusing on the extent to which features should be improved or changed in the succession of models that comprise a life cycle. We show that the structure of revenues and costs can suggest when a rm should pursue radical innovation. We use the criterion of maximizing the expected present value of pro ts during the life cycle. Computational stud...

Protection unconstrained by rules often varies substantially over time. Rules-based disciplines like OECD industrial tariff bindings negotiated under GATT since 1947 and new Uruguay Round bindings on agricultural and services trade and on developing country industrial tariffs, constrain this variability. We examine the theoretical effects of such constraints on the expected cost of protection a...

In the light of the epistemic approaches to logic as agent-based procedures of knowledge, a basic dynamics for type theory is introduced. The formalization provides epistemic explanations for the basic notions of belief state and belief set, by referring to assertion conditions for typetheoretical judgements; it interprets expectations in terms of default assumptions for such a structure; it ad...

This thesis is an inquiry into the nature of the high-level, rhetorical structure of unrestricted natural language texts, computational means to enable its derivation, and two applications (in automatic summarization and natural language generation) that follow from the ability to build such structures automatically. The thesis proposes a rst-order formalization of the high-level, rhetorical st...