| The subject of the research reported in this thesis belongs to the area known as Propositional Satisfiability, an area located in the intersection of Theoretical Computer Science, Artificial Intelligence, and Mathematical Logic.; In this thesis I show that the set of satisfying truth-value assignments of a satisfiable propositional formula can be constructed from the syntactic structure of the formula in a deterministic way, without explicit reference to semantics. I use this construction to obtain a novel characterization of satisfiability in the syntax of classical propositional logic.; I also perform an analysis of a specific subclass of truth-value assignments defined syntactically using the above mentioned construction. I show that these truth-value assignments contain enough information to identify some other truth value assignments as non-satisfying a given formula, thus confirming and completing previous results obtained by Stachniak.; This thesis is a contribution to the study of structural satisfiability---the study of the theory and the applications of structure-based approaches to propositional satisfiability. |
