Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 21 for “"decision procedure"”.

  1. Automated methods for checking differential privacy

    … guarantees (but no proofs). We propose the first decision procedure for checking differential privacy of a non-trivial class of probabilistic computations. Our procedure takes as input a program P parametrized by a privacy budget epsilon and either proves differential privacy for all possible …

    uiuc Repository record for Automated methods for checking differential privacy (opens in a new tab)

  2. Decision Problems in the Lattice of P01 Classes

    … ∩, ∪, 0, 1) are different and provide a decision procedure for the AE-theory of ( LP01 * , ∩, ∪, 0, 1).

    uiuc Repository record for Decision Problems in the Lattice of P01 Classes (opens in a new tab)

  3. SET THEORY FOR KNOWLEDGE REPRESENTATION

    The decision problem in set theory has been intensively investigated in the last decades, and decision procedures or proofs of undecidability have been provided for several quantified and unquantified fragments of set theory. In this thesis we study the decision problem for three novel quantified …

    catania Repository record for SET THEORY FOR KNOWLEDGE REPRESENTATION (opens in a new tab)

  4. Term rewriting with built-in numbers and collection data structures

    … tight integration of inductive reasoning with a decision procedure, thus resulting in a high degree of automation. Finally, conditions under which the inductive theorem proving method is guaranteed to succeed in proving or disproving a conjecture without any user intervention are identified. …

    unm Repository record for Term rewriting with built-in numbers and collection data structures (opens in a new tab)

  5. Exact geometry algorithms for robotic motion planning

    … in task and motion planning by giving a decision procedure for prehensile task and motion planning. In the second section, we present a holonomic motion planning algorithm that can almost always identify the exact optimal solution as a system of differential equations, which can be …

    mit Repository record for Exact geometry algorithms for robotic motion planning (opens in a new tab)

  6. Modular data structure verification

    … 3) proving the resulting approximation using a decision procedure or a theorem prover. I present three concrete logics; for each logic I show how to use it to approximate HOL formulas, and how to decide the validity of formulas in this logic. First, I present an approximation of HOL based on a …

    mit Repository record for Modular data structure verification (opens in a new tab)

  7. A formal description language for specifying and verifying real-time software systems.

    … conditions can be validated using an existing decision procedure. The preprocessor can be used to compose an overall system starting from a single module leading to a tree-like structure with leaf nodes containing fully refined description of all RDL components. A library containing predefined …

    rgu Repository record for A formal description language for specifying and verifying real-time software systems. (opens in a new tab)

  8. Federalism and Federation in Europe: A Comparative Study of The Germanic Tradition

    … access to and are accommodated within the decision-procedure of the centre. Meanwhile, "federalism" is taken to signify the philosophical, or ideological prescription, or promotion, of such a union. The thesis commences by identifying the major shortcomings of the Anglo-Saxon academic …

    plymouth Repository record for Federalism and Federation in Europe: A Comparative Study of The Germanic Tradition (opens in a new tab)

  9. Theorem proving with the real numbers

    … analysis. We also describe . an advanced derived decision procedure for the 'Tarski subset' of real algebra as well as some more modest but practically useful tools for automating explicit calculations and routine linear arithmetic reasoning. Finally, we consider in more detail two interesting …

    cambridge

  10. Low level and intermediate level vision in aerial images

    … reducing sensitivity to noise. Secondly, a Bayes decision procedure for automatic gradient threshold selection that produces results which are superior to those obtained by the best subjective threshold. Thirdly, the new gradient operator and automatic gradient threshold selection are used in …

    vt Repository record for Low level and intermediate level vision in aerial images (opens in a new tab)

  11. Logical representations for automated reasoning about spatial relationships

    … intuitionistic representation is examined and a procedure is presented with is shown to be of O(n3) complexity in the number of relations involved. In order to make this kind of representation sufficiently expressive the concepts of model constraint and entailment constraint are introduced. By …

    whiterose Repository record for Logical representations for automated reasoning about spatial relationships (opens in a new tab)

  12. Development of a decision-support tool for TxDOT delivery methods selection

    … its projects lead to the need of a formal decision process. This work presents the existent approaches made by different owner entities to formalize the delivery method decision. This research provides with decision procedures, criteria and principles to develop a quantitative …

    texas Repository record for Development of a decision-support tool for TxDOT delivery methods selection (opens in a new tab)

  13. Verificación formal en ACL2 del algoritmo de Buchberger

    … partial correctness are proved and a verified decision procedure for the ideal membership problem is supplied.

    cadiz Repository record for Verificación formal en ACL2 del algoritmo de Buchberger (opens in a new tab)

  14. The computational complexity of prefix classes of logical theories

    … by analyzing the quantifier elimination procedure for this theory described by Gottsch. We show that the formulas in $\Sigma\sb{m}\cup\Pi\sb{m}$ in this theory can be decided in $NSPACE$(exp$\sb{m}(cmn\sp3))$. Finally we get close upper and lower bounds for the prefix classes of the …

    uiuc Repository record for The computational complexity of prefix classes of logical theories (opens in a new tab)

  15. A Feminist Defense of Moderate Moral Intuitionism

    … article. Henry Sidgwick attempted to develop a decision procedure for this purpose in The Methods of Ethics, positing four major criteria, the fulfilment of which would confer the highest possible level of certainty on an intuition. Sidgwick's four tests are evaluated primarily with reference to …

    uwo Repository record for A Feminist Defense of Moderate Moral Intuitionism (opens in a new tab)

  16. Verificación formal en acl2 de polinomios de múltiples variables y su aplicación al problema de la decisión en la lógica proposicional clásica

    … of this verified library, we formalize a decision procedure for classical propositional logic from normalised Boolean polynomials, allowing the logical formulae to be represented in Zhegalkin normal form. Two algorithms are presented, one for deciding whether a formula is contradictory and …

    cadiz Repository record for Verificación formal en acl2 de polinomios de múltiples variables y su aplicación al problema de la decisión en la lógica proposicional clásica (opens in a new tab)

  17. Symcretic testing of programs

    … that are problematic for the symbolic decision procedure and defers their solution until the second phase. The second phase of symcretic execution begins when the symbolic execution reaches an entry point. In this phase, symcretic execution uses concrete forward execution and heuristic …

    uiuc Repository record for Symcretic testing of programs (opens in a new tab)

  18. Automata-based decision procedures for weak arithmetics

    … as a <br>tool for effectively mechanizing decision procedures for such logical <br>theories. A notable example is Presburger arithmetic for which <br>effective decision procedures can be built using automata. Despite <br>the practical use of automata, many research questions in the …

    freiburg-diss Repository record for Automata-based decision procedures for weak arithmetics (opens in a new tab)

  19. Experimental Democracy - Collective Intelligence for a Diverse and Complex World

    … unless we have a definite idea what "better decision-making" might be, it is not obvious which institutional reforms or changes in democratic structures would actually promote it. Democracy is a wide concept, and not all institutional constellations and rules and regulations that can be …

    columbia-diss Repository record for Experimental Democracy - Collective Intelligence for a Diverse and Complex World (opens in a new tab)

  20. Automatic techniques for proving correctness of heap-manipulating programs

    … powerful decidable fragments. The general decision procedures can be used in not only proving programs correct but also in software analysis and testing. Dryad is a family of logics, including Dryad-tree as a first-order logic for trees and Dryad-sep as a dialect of separation logic. Both …

    uiuc Repository record for Automatic techniques for proving correctness of heap-manipulating programs (opens in a new tab)

Page 1 of 2