• HOCL

• Referenced in 9 articles [sw07078]
• formalised as associative, commutative, conditional rewritings of multisets where rewrite rules and multisets represent chemical...

• SPEKTR

• Referenced in 3 articles [sw01114]
• axioms represented by generalized condition term rewriting rules, strategies of their application, and decision procedures ... standard form of axioms is extended by conditions in premises and in the built...

• INT

• Referenced in 3 articles [sw23776]
• package, PRESS, to check the conditions of rewrite rules and the solutions to equations...

• MTT

• Referenced in 25 articles [sw09783]
• development of the theory of termination of rewriting, its application to high-level programming languages ... need for features such as conditional equations and rules, types and subtypes, (possibly programmable) strategies ... inference system rather than just by a rewriting relation. In particular, Generalized Rewrite Theories...

• ChC 3

• Referenced in 11 articles [sw09781]
• checker tool for conditional order-sorted rewrite theories. For a rewrite theory to be executable ... modulo the given axioms A, and their rules should be (ground) coherent with E modulo ... have equations E and rules R that are both conditional, have axioms A involving various ... ground coherence checking for order-sorted rewrite theories under these general assumptions. We also explain...

• GMTE

• Referenced in 2 articles [sw07046]
• graph rewriting rules. In addition, for the graph matching, GMTE uses a conditional rule schemata...

• SymbolicUtils.jl

• Referenced in 1 article [sw41450]
• rule-based rewriting language can be used to find subexpressions that satisfy arbitrary conditions ... also contains a set of useful simplification rules for expressions of numeric symbols and numbers...

• lp2normal

• Referenced in 7 articles [sw25505]
• modeling of complex conditions and constraints. Normalization means replacing such extended rules with identically functioning ... sets of normal rules. In this system description, we present lp2normal, which is a state ... translate away choice rules, cardinality rules, and weight rules, and to rewrite optimization statements using...

• ConCon

• Referenced in 3 articles [sw21589]
• confluence checker for oriented first-order conditional term rewrite systems (CTRSs). It is written ... prover Waldmeister. ConCon first tries to simplify rules and remove infeasible rules from the input...

• ACL2

• Referenced in 283 articles [sw00060]
• ACL2 is both a programming language in which...

• Coq

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

• GAP

• Referenced in 3189 articles [sw00320]
• GAP is a system for computational discrete algebra...

• IBM Scratchpad

• Referenced in 34 articles [sw00429]
• Axiom is a general purpose Computer Algebra system...

• Isabelle

• Referenced in 713 articles [sw00454]
• Isabelle is a generic proof assistant. It allows...

• Magma

• Referenced in 3315 articles [sw00540]
• Computer algebra system (CAS). Magma is a large...

• Maple

• Referenced in 5373 articles [sw00545]
• The result of over 30 years of cutting...

• Mathematica

• Referenced in 6355 articles [sw00554]
• Almost any workflow involves computing results, and that...

• MiniSat

• Referenced in 566 articles [sw00577]
• An extensible SAT-solver. MiniSat is a minimalistic...

• REDUCE

• Referenced in 746 articles [sw00789]
• REDUCE is an interactive system for general algebraic...

• SageMath

• Referenced in 1994 articles [sw00825]
• Sage (SageMath) is free, open-source math software...