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 16 of 16 for “"Propositional Formula"”.

  1. Parallel architectures for solving combinatorial problems of logic design

    … can be expressed in the form of the Generalized Propositional Formula (GPF) : a Boolean product of clauses, where each clause is a sum of products of negated or non-negated literals.

    portland-state Repository record for Parallel architectures for solving combinatorial problems of logic design (opens in a new tab)

  2. First order model checking of w-Automata using multiway decision graphs

    … produced by the system violating the property formula. The checking method comprises four steps: (1) transforming the first-order property into a propositional formula by constructing ASMs for the atomic formulas of the property; (2) generating an }-automaton from the negation of the …

    concordia Download PDF for First order model checking of w-Automata using multiway decision graphs (opens in a new tab)

  3. Impact of the LZW-based common subexpression elimination algorithm on SAT-solving efficiency

    … of finding an assignment that satisfies a given propositional formula. SAT is effective in solving many important problems in areas such as automated reasoning, computer-aided design, and planning in Artificial Intelligence. The need to solve these problems in a reduced amount of time has geared …

    ttu Repository record for Impact of the LZW-based common subexpression elimination algorithm on SAT-solving efficiency (opens in a new tab)

  4. Satisfiability and Optimization in Periodic Traffic Flow Problems

    … the encoding of this generic model into a binary propositional formula is introduced and the appropriate usage of several techniques like SAT solving and MaxSAT to calculate and optimize the corresponding instances will be presented accordingly. Computational results for real-world scenarios …

    qucosa-diss

  5. SAT Compilation for Constraints over Structured Finite Domains

    A constraint is a formula in first-order logic expressing a relation between values of various domains. In order to solve a constraint, constructing a propositional encoding is a successfully applied technique that benefits from substantial progress made in the development of modern SAT solvers. …

    qucosa-diss

  6. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability

    … an assignment of variables which makes a Boolean formula evaluate to True. SAT is a convenient representation for many naturally occurring optimization and decisions problems such as planning and circuit verification. SAT is most commonly solved by a form of backtracking search which …

    waterloo Repository record for Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability (opens in a new tab)

  7. Exploiting Problem Structure in QBF Solving

    Deciding the truth of a Quantified Boolean Formula (QBF) is a canonical PSPACE-complete problem. It provides a powerful framework for encoding problems that lie in PSPACE. These include many problems in automatic verification, and problems with discrete uncertainty or non-determinism. Two person …

    toronto-retro Repository record for Exploiting Problem Structure in QBF Solving (opens in a new tab)

  8. Generalized Satisfiability Problems

    … problem is the satisfiability problem of propositional formulas (SAT). Here we get a propositional formula as an input and it must be decided whether an assignment for the propositional variables exists, such that this assignment satisfies the given formula. The intensive study of NP led …

    wurz-thes Repository record for Generalized Satisfiability Problems (opens in a new tab)

  9. Computation by origami-templated DNA walkers

    … interactions between DNA walkers can evaluate formulae posed in propositional logic.</p> <p>When anchorages in the track are viewed as networked machines and the DNA walker is viewed as a coordinated message passed between them, DNA walker circuits can be modelled as a distributed system. …

    oxford Repository record for Computation by origami-templated DNA walkers (opens in a new tab)

  10. Feature Model Synthesis

    … algorithm for extracting a feature graph from a propositional formula in either conjunctive normal form (CNF), or disjunctive normal form (DNF). A feature graph describes all feature diagrams that are complete with respect to the input. We evaluated our algorithms against related synthesis …

    waterloo Repository record for Feature Model Synthesis (opens in a new tab)

  11. Scalable Model Counting for Program Analysis

    … in computing bounds on the model count of a propositional formula. These hashing-based algorithms repeatedly check the satisfiability of a formula subject to random parity constraints (XOR streamlining) and give an estimate of the model count with a probabilistic range and confidence. …

    umn Repository record for Scalable Model Counting for Program Analysis (opens in a new tab)

  12. Finding near-optimal configurations in colossal product spaces of highly configurable systems

    … to encode features with numerical values into a propositional formula and use existing tools to SRS configurations. Compared to the tools that inherently support reasoning with numerical values, this approach is faster and achieves SRS. Lastly, we compare our sampling methods with …

    texas Repository record for Finding near-optimal configurations in colossal product spaces of highly configurable systems (opens in a new tab)

  13. On bounded model checking of asynchronous systems

    … property. Answering this question is reduced to propositional satisfiability, i.e., to a propositional formula that is satisfiable iff there is such a violating execution. The translation from a system to a formula is polynomial in the size of the system but the running time of the propositional …

    aalto Repository record for On bounded model checking of asynchronous systems (opens in a new tab)

  14. Exploring Constraint Satisfiability Techniques in Formal Verification

    Due to the widespread demands for efficient Propositional Satisfiability (SAT) solvers and its derivatives in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. This dissertation aims to enhance the performance of SAT and related SAT …

    vt Repository record for Exploring Constraint Satisfiability Techniques in Formal Verification (opens in a new tab)

  15. Exploring and Visualizing Fact-Based Software Models to Improve Program Comprehension

    … a presence condition (PC), where the PC is a propositional formula that represents the product(s) for which the result holds. Thus, interpreting the variable analysis results of an SPL model involves determining the program variant (or group of variants) that applies to specific results, which …

    waterloo Repository record for Exploring and Visualizing Fact-Based Software Models to Improve Program Comprehension (opens in a new tab)

  16. Enhancing SAT-based Formal Verification Methods using Global Learning

    … signal relationships into the original CNF formula of the circuit under verification and hence reduce the complexity of the SAT instance. This efficient and effective preprocessing quickly builds up the implication graph for the circuit under verification, yielding a large set of logic …

    vt Repository record for Enhancing SAT-based Formal Verification Methods using Global Learning (opens in a new tab)