• RSBR_

  • Referenced in 19 articles [sw02934]
  • Rough Sets with Boolean Reasoning (RSBR) respectively, for mining if-then rules in a meningitis...
  • CalCS

  • Referenced in 7 articles [sw13098]
  • constraints. Certain formal verification tasks require reasoning about Boolean combinations of non-linear arithmetic constraints ... convex constraints are produced from Boolean reasoning, we provide a procedure that generates conservative approximations...
  • CSIsat

  • Referenced in 15 articles [sw11407]
  • solver to reason about the boolean structure. We evaluate the efficiency of our tool...
  • QUBE

  • Referenced in 28 articles [sw11381]
  • Quantified Boolean Formula (QBF) is an important research issue in Artificial Intelligence. Many reasoning tasks...
  • RSat

  • Referenced in 22 articles [sw13117]
  • RSat is a complete Boolean satisfiability solver with an exhaustive search interface for applications such ... RSat is developed by the UCLA Automated Reasoning Group...
  • QuBE++

  • Referenced in 27 articles [sw00766]
  • Boolean Formulas (QBFs). To the extent of our knowledge, QuBE++ is the first QBF reasoning...
  • STABLE

  • Referenced in 2 articles [sw11913]
  • solver for hard verification problems combining Boolean reasoning with computer algebra. This paper presents...
  • ESOLID

  • Referenced in 11 articles [sw15824]
  • curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using exact representations...
  • FOOL

  • Referenced in 3 articles [sw14287]
  • TPTP. To support reasoning about properties of programs operating with Boolean values one needs theorem...
  • Boolean_Expression_Checkers

  • Referenced in 1 article [sw38023]
  • executable checkers for the following properties of boolean expressions: satisfiability, tautology and equivalence. Internally ... operate on binary decision trees and are reasonably efficient (for purely functional algorithms...
  • HiTag2

  • Referenced in 9 articles [sw14133]
  • from the construction of the two-layer Boolean function in Hitag2. Then we study some ... using a hybrid approach of logical reasoning and computer computation, we obtain the precise value...
  • InKreSAT

  • Referenced in 5 articles [sw23448]
  • InKreSAT: modal reasoning via incremental reduction to SAT. InKreSAT is a prover for the modal ... given modal satisfiability problem to a Boolean satisfiability problem, which is then solved using...
  • Cool

  • Referenced in 4 articles [sw11992]
  • coalgebraic ontology logic solver Cool, a generic reasoner that decides the satisfiability of modal ... support a general TBox and internalize a Boolean ABox. The level of generality is that ... Cool with state-of-the-art reasoners...
  • MetaPrime

  • Referenced in 4 articles [sw12542]
  • analyze event trees because such trees denote Boolean functions on which these concepts ... particular in expert system applications such as reasoning maintenance and multiple fault diagnosis. The application...
  • REBA

  • Referenced in 3 articles [sw29435]
  • article describes REBA, a knowledge representation and reasoning architecture for robots that is based ... action language is extended to support non-boolean fluents and non-deterministic causal laws ... history and used for subsequent coarse-resolution reasoning. The architecture thus combines the complementary strengths...
  • MPIDepQBF

  • Referenced in 4 articles [sw18671]
  • present a lightweight approach for solving quantified Boolean formulas (QBFs) in parallel. In particular ... solver DepQBF with assumption-based reasoning and integrated it in our novel solver MPIDepQBF...
  • DICE

  • Referenced in 1 article [sw32060]
  • real-time AI issues. DICE offers progressive reasoning as a way to handle time critical ... VAX/VMS environment. It offers both boolean and multivalued logic implementations. Some examples concerning the syntax...
  • Jimena

  • Referenced in 1 article [sw29354]
  • simulation framework Jimena we introduce and setup Boolean-tree-based data structures; (ii) corresponding algorithms ... simulated by this model in reasonable time. (iii) Stable states for discrete models are efficiently...
  • DiffSat

  • Referenced in 1 article [sw13372]
  • heuristic polarity decision-making algorithm for solving Boolean satisfiability (SAT). The algorithm inherits many features ... solve many “real-life” instances in a reasonable time while the best existing SAT solvers...
  • CodeHow

  • Referenced in 0 articles [sw27506]
  • Search Based on API Understanding and Extended Boolean Model (E). Over the years of software ... search tools are often unsatisfactory. One major reason is that existing tools lack of query ... performs code retrieval by applying the Extended Boolean model, which considers the impact of both...