Sökning: "deductive"

Visar resultat 1 - 5 av 121 avhandlingar innehållade ordet deductive.

1. 1. Explanation and deduction : a defence of deductive chauvinism

   Författare :Henrik Hållsten; Matti Sintonen; Stockholms universitet; []
   Nyckelord :HUMANITIES; HUMANIORA; HUMANIORA; HUMANITIES; Deductive explanation; Statistical explanation; Chances; Propensities; Probabilities; Sine qua non; Probabilistic causality; Indeterminism; Ideal explanatory text; Explanatory information; Explanatory sketches; Dynamic systems; Chaotic systems; Approximate solutions; Argument generating procedure. Central figures: Hempel; Coffa; Salmon; Railton; Humphreys; Kitcher; Poincaré; Suppes; Lorenz; Hénon.; Theoretical Philosophy; teoretisk filosofi;

   Sammanfattning : In this essay I defend the notion of deductive explanation mainly against two types of putative counterexamples: those found in genuinely indeterministic systems and those found in complex dynamic systems. Using Railton's notions of explanatory information and ideal explanatory text, deductivism is defended in an indeterministic setting. LÄS MER

3. 2. Towards a Deductive Compilation Approach

   Författare :Ran Ji; Chalmers University of Technology; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Software Engineering; Software Verification; Partial Evaluation; Symbolic Execution; Deductive Compilation;

   Sammanfattning : Software correctness is an important topic, however, it is difficult to achieve. This thesis is a step towards a new way to ensure the software correctness in both source code and bytecode level. KeY is a state-of-the-art verification tool for Java source code. LÄS MER

4. 3. Deductive Planning and Composite Actions in Temporal Action Logic

   Författare :Martin Magnusson; Patrick Doherty; John-Jules Meyer; Linköpings universitet; []
   Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Temporal Action Logic; deductive planning; composite actions; interval algebra; constraint logic programming; execution monitoring; Computer science; Datalogi;

   Sammanfattning : Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. LÄS MER

5. 4. Deductive Program Analysis with First-Order Theorem Provers

   Författare :Simon Robillard; Chalmers University of Technology; []
   Nyckelord :NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; HUMANIORA; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; HUMANITIES; Automated theorem proving; Program semantics; Program Verification; Program analysis; Automated reasoning; First-order logic;

   Sammanfattning : Software is ubiquitous in nearly all aspects of human life, including safety-critical activities. It is therefore crucial to analyze programs and provide strong guarantees that they perform as expected. LÄS MER

7. 5. A Labelled Deductive System for Reasoning about Random Experiments

   Författare :Björn Bjurling; RISE; []
   Nyckelord :NATURAL SCIENCES; NATURVETENSKAP;

   Sammanfattning : .... LÄS MER