Thesis (Ph. D.)--Tampere University of Technology, 2002. / Includes bibliographical references. Also available on the World Wide Web.

Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.

Thesis (M.S.)--University of Nevada, Reno, 2007. / "May, 2007." Includes bibliographical references (leaves 128-129). Library also has microfilm. Ann Arbor, Mich. : ProQuest Information and Learning Company, [2008]. 1 microfilm reel ; 35 mm. Online version available on the World Wide Web.

Thesis (M.S.)--Ohio University, August, 1998. / Title from PDF t.p.

Thesis (M.S.)--Ohio University, August, 1998. / Title from PDF t.p.

Thesis(M.S.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references.

Thesis (doctoral)--Universität Bonn, 1986. / Includes bibliographical references (p. 121-124).

Thesis (M.S.)--University of Wisconsin--Madison, 1965. / eContent provider-neutral record in process. Description based on print version record. Bibliography: 1 l. at end.

Logic programming realizes the ideal of "computation as deduction," except when floating-point arithmetic is involved. In that respect, logic programming languages suffer the same deficiency as conventional algorithmic languages: floating-point operations are only approximate and it is not easy to tell how good the approximation is. This dissertation proposes a framework to extend the benefits of logic programming to computations involving floating-point arithmetic. John Cleary incorporated a relational form of interval arithmetic into Prolog so that variables already bound can be bound again. In this way, the usual logical interpretation of computation no longer holds. Based on Cleary's idea, we develop a technique for narrowing intervals. We present a relaxation algorithm for coordinating the applications of the interval narrowing operations to constraints in a network. We incorporate relational interval arithmetic into two constraint logic programming languages: CHIP and CLP(R). We modify CHIP by allowing domains to be intervals of real numbers. In CLP(R) we represent intervals by inequality constraints. The enhanced languages ICHIP and ICLP(R) preserve the semantics of logic so that numerical computations are deductions, even when floating-point arithmetic is used. We have constructed a prototype of ICLP(R) consisting of a meta-interpreter executed by an existing CLP(R) system. We show that interval narrowing belongs to the class of domain restriction operations in constraint-satisfaction algorithms. To establish a general framework for these operations, we use and generalize Ashby's notions of cylindrical closure and cylindrance. We show that Mackworth's algorithms can be placed in our framework. / Graduate

In 1854 Cayley proposed an interesting sequence 1,1,3,13,75,541,... in connection with analytical forms called trees. Since then there has been various combinatorial interpretations of the sequence. The sequence has been interpreted as the number of preferential arrangements of members of a set with n elements. Alternatively the sequence has been interpreted as the number of ordered partitions; the outcomes in races in which ties are allowed or geometrically the number of vertices, edges and faces of simplicial objects. An interesting application of the sequence is found in combination locks. The idea of a preferential arrangement has been extended to a wider combinatorial object called barred preferential arrangement with multiple bars. In this thesis we study barred preferential arrangements combinatorially with application to resistance of certain electrical circuits. In the process we derive some results on cyclic properties of the last digit of the number of barred preferential arrangements. An algorithm in python has been developed to find the number of barred preferential arrangements.