Sökning: "Conjecture Generation"
Hittade 4 avhandlingar innehållade orden Conjecture Generation.
1. Snarks : Generation, coverings and colourings
Sammanfattning : For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson's conjecture and Tutte's 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll's poem, a \emph{snark} is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. LÄS MER
2. Theory Exploration for Programs and Proofs
Sammanfattning : We have built two theory exploration systems, Cohipster and RoughSpec . Theory exploration is a method of automatically conjecturing properties about the functions and structures that appear in a computer program or a formalization of a mathematical theory. LÄS MER
3. A Method for the Study of Unsteady Cavitation - Observations on Collapsing Sheet Cavities
Sammanfattning : When subjected to sufficiently low pressures, water will eventually come apart. Gas-filled cavities appear in the water: it is said to cavitate. When the cavities collapse, they often do so quite vigorously, causing noise, vibrations and erosion. A well-known example of cavitation is that found on heavily loaded ship propellers. LÄS MER
4. An Essay on Thomas Reid´s Philosophy of Science
Sammanfattning : Though generally recognized as a formative force in his philosophy, Thomas Reid’s Newtonianism and his philosophy of science has not received due attention among scholars. My aim is to inaugurate a detailed survey. In ch. LÄS MER