• MONA

  • Referenced in 118 articles [sw06170]
  • DAGification, guided tree automata, three-valued logic, eager minimization, BDD-based automata representations, and cache...
  • OTTER

  • Referenced in 313 articles [sw02904]
  • semigroups, ternary Boolean algebra, logic calculi, combinatory logic, group theory, lattice theory, and algebraic geometry ... being actively developed, and maintenance and support minimal. We recommend using Otter/Mace2’s successor Prover9/Mace4...
  • ESPRESSO

  • Referenced in 6 articles [sw08227]
  • comparison of logic minimization strategies using EXPRESSO: an APL program package for partitioned logic minimalization ... Espresso is a two-level (PLA) logic minimizer developed at the University of California, Berkeley...
  • Cmodels

  • Referenced in 66 articles [sw04435]
  • search engine for enumerating models of the logic program -- possible solutions, in case of disjunctive ... zChaff is also used for verifying the minimality of found models. The system Cmodels ... answer set and the completion semantics for logic programs. For big class of programs called...
  • PARAMESH

  • Referenced in 99 articles [sw00677]
  • existing serial code which uses a logically Cartesian structured mesh into a parallel code with ... Alternatively, in its simplest use, and with minimal effort, it can operate as a domain...
  • Metaopt

  • Referenced in 4 articles [sw34722]
  • system which iteratively learns lower cost logic programs, each time further restricting the hypothesis space ... large numbers of examples, Metaopt converges on minimal cost programs, and our experiments show that ... training examples, is guaranteed to learn minimal cost logic programs, including minimal time-complexity programs...
  • Minlog

  • Referenced in 2 articles [sw30424]
  • Minlog: A minimal logic theorem prover. Minlog is a theorem prover for propositional minimal logic...
  • MOCUS

  • Referenced in 9 articles [sw12553]
  • obtain minimal sets from fault trees. From a description of the Boolean failure logic ... resolve the fault tree to obtain the minimal sets. A key point of the algorithm ... size of path sets. Other types of logic gates must be described in terms...
  • AUTODYN-3D

  • Referenced in 7 articles [sw03363]
  • coupling interfaces and by minimizing input requirements using safe logical defaults...
  • GNT

  • Referenced in 22 articles [sw00367]
  • stable model semantics for disjunctive logic programs [Gelfond and Lifschitz, 1991]. Our implementation is based ... model candidates while the other checks for minimality, as required from disjuctive stable models...
  • S-TaLiRo

  • Referenced in 16 articles [sw09775]
  • TaLiRo: A tool for temporal logic falsification for hybrid systems. S-TaLiRo is a Matlab ... toolbox that searches for trajectories of minimal robustness in Simulink/Stateflow diagrams. It can analyze arbitrary...
  • FATRAM

  • Referenced in 3 articles [sw25821]
  • have been developed for determining minimal cut sets for logic models (in particular, fault trees ... presents a new method for determining the minimal cut sets, which makes more efficient...
  • BarcelogicTools

  • Referenced in 9 articles [sw02001]
  • minimal and simple interface [Ganzingeretal2004CAV]. Currently, Barcelogic for SMT supports difference logic over the integers...
  • Mosel

  • Referenced in 5 articles [sw30493]
  • approach to the logic, based on a formal semantics for a minimal subset, its modular...
  • LUMA

  • Referenced in 2 articles [sw26402]
  • architecture is modular and arranged logically using a minimal amount of object-orientation to maintain...
  • N3Logic

  • Referenced in 9 articles [sw02003]
  • anyone can assert anything. N3Logic is a logic that allows rules to be expressed ... goal of N3Logic is to be a minimal extension to the RDF data model such ... same language can be used for logic and data. In this paper, we describe N3Logic...
  • ProGolem

  • Referenced in 4 articles [sw13855]
  • based on relative minimal generalisation. Over the last decade inductive logic programming systems have been ... bottom-up approaches to the construction of logic programs. In particular, we explore variants ... paper we show that with asymmetric relative minimal generalisations (or ARMGs) relative to a bottom...
  • PULi

  • Referenced in 1 article [sw28623]
  • axioms, then its justification is a minimal subset of axioms for which the entailment holds ... debugging of incorrect entailments in Description Logic ontologies. Recently a number of SAT-based methods ... inferences in propositional Horn logic, and finding minimal models that correspond to justifications using...
  • TCB

  • Referenced in 4 articles [sw13591]
  • very small: it consists of the logic in which predicates and proofs are expressed ... proof checker. We have built a minimal proof checker, and we explain its design principles ... representation issues of the logic, safety predicate, and safety proofs. We show that the Trusted...
  • EL2MCS

  • Referenced in 6 articles [sw28624]
  • important relationship between minimal axiom sets and minimal unsatisfiable subformulas in the propositional domain. Experimental ... existing axiom pinpointing approaches for lightweight description logics...