Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

2000

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 14461 - 14462 of 14462

Full-Text Articles in Entire DC Network

Wittgenstein And The Grammar Of Physics: A Study Of Ludwig Wittgenstein's 1929-1930 Manuscripts And The Roots Of His Later Philosophy, Anton Alterman Jan 2000

Wittgenstein And The Grammar Of Physics: A Study Of Ludwig Wittgenstein's 1929-1930 Manuscripts And The Roots Of His Later Philosophy, Anton Alterman

Dissertations, Theses, and Capstone Projects

In 1929 Wittgenstein began to work on the first philosophical manuscripts he had kept since completing the Tractatus Logico-Philosophicus (TLP) in 1918. The impetus for this was his conviction that the logic of the TLP was flawed: it was unable to account for the fact that a proposition that assigns a single value on a continuum to a simple object thereby excludes all assignments of different values to the object (the "color exclusion" problem). Consequently Wittgenstein's "atomic propositions" could not be logically independent of one another.

Initially he thought he could replace the "logically perfect language" of the TLP with …


Complete Randomized Cutting Plane Algorithms For Propositional Satisfiability, Stephen Lee Hansen Jan 2000

Complete Randomized Cutting Plane Algorithms For Propositional Satisfiability, Stephen Lee Hansen

CCAC Theses and Dissertations

The propositional satisfiability problem (SAT) is a fundamental problem in computer science and combinatorial optimization. A considerable number of prior researchers have investigated SAT, and much is already known concerning limitations of known algorithms for SAT. In particular, some necessary conditions are known, such that any algorithm not meeting those conditions cannot be efficient. This paper reports a research to develop and test a new algorithm that meets the currently known necessary conditions.

In chapter three, we give a new characterization of the convex integer hull of SAT, and two new algorithms for finding strong cutting planes. We also show …