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 24 for “"Model Counting"”.

  1. Scalable Model Counting for Program Analysis

    Various model counting techniques have been proposed to show their scalability for problem domains such as combinatorics, safety analysis, probabilistic inference and quantitative information-flow analysis of software. In particular, random hashing-based methods have shown to be highly successful …

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

  2. Weighted Model Counting with Algebraic Decision Diagrams

    … an algorithm to compute exact literal-weighted model counts of Boolean formulas in conjunctive normal form. Our algorithm employs dynamic programming and uses algebraic decision diagrams as the primary data structure. We implement this technique in ADDMC, a new model counter. We empirically …

    rice Repository record for Weighted Model Counting with Algebraic Decision Diagrams (opens in a new tab)

  3. Machine learning for structural reasoning in Boolean Satisfiability

    … to enhance Boolean Satisfiability and Model Counting. Building upon the foundational understanding of SAT and its role as an NP-complete problem, this work addresses challenges related to structural reasoning, satisfiability and model counting prediction, feature extraction and instance …

    cork Repository record for Machine learning for structural reasoning in Boolean Satisfiability (opens in a new tab)

  4. ANSWER SET COUNTING AND ITS APPLICATIONS

    … systems for computing answer sets (also known as models). While traditional research has focused on satisfiability, there is growing interest in more advanced tasks such as answer set (model) counting, which is central to probabilistic reasoning and probabilistic logic programming. This thesis …

    nus Repository record for ANSWER SET COUNTING AND ITS APPLICATIONS (opens in a new tab) Download file for ANSWER SET COUNTING AND ITS APPLICATIONS (opens in a new tab)

  5. Exploiting Structure in Backtracking Algorithms for Propositional and Probabilistic Reasoning

    … into a CNF formula and then performing weighted model counting is an effective method for exact probabilistic inference. I present two encodings for improving this approach with noisy-OR and noisy-MAX relations. In our experiments, our new encodings are more space efficient and can speed up the …

    waterloo Repository record for Exploiting Structure in Backtracking Algorithms for Propositional and Probabilistic Reasoning (opens in a new tab)

  6. Quantitative Reasoning on Hybrid Formulas with Dynamic Programming

    … the Weighted Satisfiability (WSAT), Weighted Model Counting (WMC), Weighted Projected Model Counting (WPMC), and Existential-Random Satisfiability (ERSAT) problems. SSAT has been used to model power-transmission reliability, machine-learning fairness, and other applications. Prior work on SSAT …

    rice Repository record for Quantitative Reasoning on Hybrid Formulas with Dynamic Programming (opens in a new tab)

  7. Program analysis for machine learning models

    Machine learning models have many applications, being used for example in pattern analysis, image classification, or sentiment analysis for textual data, and also in medical diagnosis or perception and control in autonomous driving, which bring safety and security concerns. Machine learning models …

    texas Repository record for Program analysis for machine learning models (opens in a new tab)

  8. Enhancements to solving constraints written as imperative predicates

    … constraint-based data structure repair, and model counting. While prior work explored various optimizations to enhance the performance and usability of Korat, scalability continues to remain a key challenge and applicability remains rather limited. Our work makes a threefold contribution. …

    texas Repository record for Enhancements to solving constraints written as imperative predicates (opens in a new tab)

  9. Korat-API : an API for building constraint solving problems for Korat

    … (1) using Korat as a backend engine for model counting; and (2) using Korat as test generator. We believe our work introduces a promising approach for making the ability of Korat to efficiently solve imperative predicates more widely applicable, possibly even in new application contexts …

    texas Repository record for Korat-API : an API for building constraint solving problems for Korat (opens in a new tab)

  10. ON SCALABILITY OF KNOWLEDGE COMPILATION APPLICATIONS

    … planning and combinatorial testing, as well as model counting for pseudo-boolean formulas. The three key pillars of the ERA framework for scaling up knowledge compilation applications are a) Efficient usage of knowledge compilation forms b) Recoverable approximations whenever appropriate and c) …

    nus Repository record for ON SCALABILITY OF KNOWLEDGE COMPILATION APPLICATIONS (opens in a new tab) Download file for ON SCALABILITY OF KNOWLEDGE COMPILATION APPLICATIONS (opens in a new tab)

  11. On Hashing-Based Approaches to Approximate DNF-Counting

    Propositional model counting is a fundamental problem in AI. For DNF formulas, Monte Carlo-based techniques provide a fully polynomial randomized approximation scheme (FPRAS). For CNF constraints, hashing-based techniques are highly successful. It was recently shown that hashing techniques also …

    rice Repository record for On Hashing-Based Approaches to Approximate DNF-Counting (opens in a new tab)

  12. Improving formal reasoning for software systems using machine learning and symbolic approaches

    … concentrates on the widely-used software modeling tool, Alloy. Alloy and its analyzer are extensively applied for complex system modeling across diverse fields, including security, system analysis and verification, and design. In the back-end layer, this dissertation seeks to enhance …

    texas Repository record for Improving formal reasoning for software systems using machine learning and symbolic approaches (opens in a new tab)

  13. Probabilistic Techniques For Constraint Satisfaction Problems

    … part of the dissertation describes approaches to counting number of solutions of a CSP with the help of Belief Propagation and statistics. We also provide a novel hybrid algorithm for minimizing the number of violated constraints, which employs both systematic and local search, harnessing their …

    cornell Repository record for Probabilistic Techniques For Constraint Satisfaction Problems (opens in a new tab)

  14. Implementation of Tetris as a Model Counter

    … for handling natural database joins, as an exact model counter for the #SAT problem, where we want to count the number of satisfying solutions to a SAT formula. Tetris uses a simple geometric framework, yet manages to achieve the fractional hypertree-width bound. While the original Tetris paper …

    buffalo Repository record for Implementation of Tetris as a Model Counter (opens in a new tab)

  15. Planning and Execution for Discrete Integration

    Discrete integration is a fundamental problem in artificial intelligence, with applications in probabilistic reasoning, planning, inexact computing, engineering reliability, and statistical physics. The task is to count the total weight, subject to a given weight function, of the set of solutions …

    rice Repository record for Planning and Execution for Discrete Integration (opens in a new tab)

  16. On Tractability and Consistency of Probabilistic Inference in Relational Domains

    … distributions over relational structures. SRL models can succinctly represent the complex dependencies in relational data and admit learning and inference under uncertainty. However, these models are significantly limited when it comes to the tractability of learning and inference. This …

    trento Repository record for On Tractability and Consistency of Probabilistic Inference in Relational Domains (opens in a new tab)

  17. Partial compilation of constraint problems

    … used many times to answer queries related to model counting, satisfiability, equivalence, etc. Most such queries are NP-hard problems. Knowledge Compilation (KC) methods were developed to deal with the complexity of solving combinatorial problems online by creating a representation offline …

    cork Repository record for Partial compilation of constraint problems (opens in a new tab)

  18. Imperative constraint solver prediction and analysis

    … provides a new approach to tackle the problem of model counting, i.e., counting the number of solutions of the given formula. While our focus is Korat, we believe our techniques can generalize to other forms of constraints and solving methods, and enhance other constraint solvers.

    texas Repository record for Imperative constraint solver prediction and analysis (opens in a new tab)

  19. Domain-Driven Approaches for Constrained Counting and Sampling

    Constrained Counting and Sampling are two fundamental problems in Computer Science, where the task is to count the number of solutions or satisfying assignments to a given set of constraints, or to sample a solution uniformly at random. Counting and sampling along with their approximate and …

    rice Repository record for Domain-Driven Approaches for Constrained Counting and Sampling (opens in a new tab)

  20. Extending SAT Solver with Parity Reasoning

    … areas such as circuit verification, bounded model checking, logical cryptanalysis, and approximate model counting, some requirements can be succinctly captured with parity (xor) constraints. However, satisfy ability solvers that typically operate in conjunctive normal form (CNF) may perform …

    aalto Repository record for Extending SAT Solver with Parity Reasoning (opens in a new tab)

Page 1 of 2