• LIPSAT

  • Referenced in 6 articles [sw28633]
  • Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic. We study probabilistic-logic reasoning ... particular, we study the satisfiability of joint probabilistic assignments, which we call LIPSAT. Although ... complete class. An exact satisfiability decision algorithm is presented which employs, as a subroutine ... decision problem for Łukasiewicz infinitely-valued (non probabilistic) logic, that is also an NP-complete...
  • APMC

  • Referenced in 29 articles [sw11483]
  • been extended recently to the verification of probabilistic systems. However, the representation of the transition ... positive LTL formula is satisfied with high confidence by a probabilistic system. Our randomized algorithm...
  • GenPSAT

  • Referenced in 4 articles [sw24009]
  • Generalized probabilistic satisfiability. We analyze a generalized probabilistic satisfiability problem (GenPSAT) which consists in deciding...
  • Pronto

  • Referenced in 3 articles [sw14757]
  • describe in detail the novel probabilistic satisfiability (PSAT) algorithm which lies at the heart ... with respect the amount of classical (non-probabilistic) knowledge. The latter is the key feature...
  • UnitWalk

  • Referenced in 36 articles [sw00993]
  • randomized algorithm for SAT, i.e., the satisfiability problem for Boolean formulas in conjunctive normal form ... also prove that our algorithm is probabilistically approximately complete...
  • CoLoSS

  • Referenced in 14 articles [sw07016]
  • uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebric ... coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily integrated into CoLoSS...
  • MC2

  • Referenced in 5 articles [sw12883]
  • Carlo Model Checker for properties written in Probabilistic Linear-time Temporal Logic with numerical constraints ... traces satisfies the property. MC2(PLTLc) can also calculate the probabilistic domains of free variables...
  • PROPhESY

  • Referenced in 13 articles [sw33602]
  • PROPhESY: A PRObabilistic ParamEter SYnthesis Tool. We present PROPhESY, a tool for analyzing parametric Markov ... these regions give rise to instantiated MCs satisfying or violating the (conditional) probability or expected...
  • libiop

  • Referenced in 9 articles [sw31793]
  • tool chain for transforming certain types of probabilistic proofs (see below) into zkSNARKs with ... complete relation that generalizes arithmetic circuit satisfiability) over smooth prime fields and binary extension fields...
  • delSAT

  • Referenced in 0 articles [sw30940]
  • Answer Set solver for Differentiable Satisfiability and Differentiable Answer Set Programming. It can be used ... solving problems in Probabilistic CNF (clauses annotated with probabilities) and satisfiable PSAT problems, for distribution...
  • prob-black-reach

  • Referenced in 2 articles [sw34625]
  • prob-black-reach: Probabilistic black-box reachability checking (extended version). Model checking has a long ... design it checks whether desired properties are satisfied. Unlike testing, it cannot be applied ... systems that allows both, non-deterministic and probabilistic behaviour. It involves model inference, testing...
  • NeVer

  • Referenced in 2 articles [sw06592]
  • possible misbehaviors with traditional analytical or probabilistic techniques. In this paper we present {sc NeVer ... safety of ANNs into the problem of satisfying corresponding Boolean combinations of linear arithmetic constraints...
  • pSPARQL

  • Referenced in 1 article [sw30286]
  • present a querying language framework for probabilistic RDF data (an important uncertain linked data), where ... pSPARQL can support the full SPARQL and satisfies some important properties such as well-definedness...
  • DEPAS

  • Referenced in 2 articles [sw06489]
  • DEPAS: a decentralized probabilistic algorithm for auto-scaling The dynamic provisioning of virtualized resources offered ... system that is running the application to satisfy the varying workload with minimum resource utilization ... paper we propose { t DEPAS}, a decentralized probabilistic auto-scaling algorithm integrated into...
  • maskVerif

  • Referenced in 2 articles [sw40780]
  • underlying assumptions that are difficult to satisfy in practice. This is due to physical defaults ... benefits of language-based approaches (specifically probabilistic information flow) for masking...
  • TerpreT

  • Referenced in 2 articles [sw29483]
  • synthesis problems. TerpreT is similar to a probabilistic programming language: a model is composed ... program (LP) relaxations for graphical models, discrete satisfiability solving, and the Sketch program synthesis system...
  • AXIOM

  • Referenced in 173 articles [sw00063]
  • Axiom is a general purpose Computer Algebra system...
  • BARON

  • Referenced in 361 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • Coq

  • Referenced in 1906 articles [sw00161]
  • Coq is a formal proof management system. It...
  • dl2asp

  • Referenced in 3 articles [sw00208]
  • dl2asp: implementing default logic via answer set programming...