Now showing items 11-15 of 15
Interval-based uncertain reasoning
This thesis examines three interval based uncertain reasoning approaches: reasoning under interval constraints, reasoning using necessity and possibility functions, and reasoning with rough set theory. In all these ...
On the perfect orderability of unions of two graphs
A graph G is perfectly orderable if it admits an order < on its vertices such that the sequential coloring algorithm delivers an optimum coloring on each induced subgraph (H, <) of (G, <). A graph is a threshold graph ...
Compiling Prolog to Logic-inference Virtual Machine
The Logic-inference Virtual Machine (LVM) is a new Prolog execution model consisting of a set of high-level instructions and memory architecture for handling control and unification. Different from the well-known Warren's ...
Compact sets in Banach spaces
Connections between several compact spaces are studied in this thesis. Proofs are given when one implies another, and so are counterexamples when one does not. The spaces discussed in this thesis are: uniform Eberlein ...