that extenstve dtrect restrictions on production/investment pohcy would be expenstve to employ and are not observed. However, dividend and tinancmg pohcy restricttons are wrttten to give stockholders incentives to follow a firm-value-maxtmizmg production/mvestment pohcy. Takmg mto account how contracts control

There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of preference judgments, i.e., statements to the effect that one instance should be ranked ahead of another. We outline

. An algorithm for a restricted form of higher-order matching is described. The intended usage is for rewrite rules that use functionvalued variables in place of some unknown term structure. The matching algorithm instantiates these variables with suitable -abstractions when given the term

Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solved form that we call answer. By allowing a restricted form of universal quantification, answers provide a more compact

In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T n in all finite types which are suited to formalize substantial parts of analysis but nevertheless have provably recursive function(al)s of low growth. We reduce the use of instances of these principles in T n -proofs of a large class of formulas to the use of instances of certain arithmetical principles thereby determining faithfully the arithmetical content of the former. This is achieved using the method of elimination of Skolem functions for monotone formulas which was introduced by the author in a previous paper. As

being aware of any aliasing. Ownership types form a static type system that indicates object ownership. This provides a flexible mechanism to limit the visibility of object references and restrict access paths to objects, thus controlling a system's dynamic topology. The type system is shown

. The one-level taxonomies are the basic building block of Multi-level taxonomy. Our process for forming taxonomy tree is a type of unsupervised learning. Our method is restricted a binary trees of classes in unsupervised fashion, i.e., no a priori model of the data is assumed except that the values

equivalence and subtyping that are induced by a model, an ordering on infinite trees, an algorithm, and a set of type rules. We show soundness and completeness between the rules, the algorithm, and the tree semantics. We also prove soundness and a restricted form of completeness for the model. To address

-DL, and which, additionally, do not affect its decidability. We consider complex role inclusion axioms of the form R ◦ S ˙ ⊑ R or S ◦ R ˙ ⊑ R to express propagation of one property along another one, which have proven useful in medical terminologies. Furthermore, we extend SHOIN with reflexive, symmetric

it does, oc-casionally transmits a propositional clause2 to the CMS. The Reasoner is also permitted to query the CMS any time it feels so inclined. A query takes the form of a proposi-tional clause C. The CMS is expected to respond with every shortest clause S for which the clause S V C is a log