• GHC

  • Referenced in 43 articles [sw23765]
  • additional syntactic construct, guard. Although Guarded Horn Clauses can be classified into the family ... viewed as a generalization of these frameworks. The simplicity and generality of GHC will make ... parallel programming languages. Moreover, it is simple enough to be regarded as a computation model ... implementation of exhaustive solution search for Horn- clause programs. We showed how to automatically compile...
  • Idris

  • Referenced in 34 articles [sw20011]
  • Idris is a general purpose pure functional programming language with dependent types. Dependent types allow ... Full dependent types with dependent pattern matching; Simple foreign function interface (to C); Compiler-supported ... write code using the types; where clauses, with rule, simple case expressions, pattern matching...
  • Irdis

  • Referenced in 19 articles [sw09690]
  • language with dependent types. Idris is a general purpose pure functional programming language with dependent ... with dependent pattern matching; where clauses, with rule, simple case expressions, pattern matching...
  • DLog

  • Referenced in 7 articles [sw09839]
  • present paper, actually works on more general clauses than those obtainable by applying step ... which can be either executed using a simple interpreter or further extended to executable Prolog ... specific to our approach, while others are general enough to be interesting for DL reasoner...
  • Subsumer

  • Referenced in 3 articles [sw13854]
  • present a relatively simple (≈1000 lines in Prolog) but efficient and general θ-subsumption engine ... dynamic and recursive decomposition of a clause in sets of independent components. Also important...
  • MixLog

  • Referenced in 1 article [sw01565]
  • rule-based languages MixLog is a simple generalization of Prolog, deductive databases, and other rule ... translated into Prolog with embedded implications in clause bodies, provided rule consumption is used...
  • Coq

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

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

  • Referenced in 8836 articles [sw00771]
  • R is a language and environment for statistical...
  • SCIP

  • Referenced in 484 articles [sw01091]
  • SCIP is currently one of the fastest non...
  • ML

  • Referenced in 517 articles [sw01218]
  • ML (’Meta Language’) is a general-purpose functional...
  • Ada95

  • Referenced in 290 articles [sw01753]
  • Ada is a structured, statically typed, imperative, wide...
  • OTTER

  • Referenced in 316 articles [sw02904]
  • Our current automated deduction system Otter is designed...
  • Eiffel

  • Referenced in 289 articles [sw03522]
  • Eiffel is an ISO-standardized, object-oriented programming...
  • CPLEX

  • Referenced in 2641 articles [sw04082]
  • IBM® ILOG® CPLEX® offers C, C++, Java, .NET...
  • TPTP

  • Referenced in 383 articles [sw04143]
  • The TPTP (Thousands of Problems for Theorem Provers...
  • Walksat

  • Referenced in 207 articles [sw04328]
  • GSAT and WalkSat are local search algorithms to...
  • CUDD

  • Referenced in 148 articles [sw04446]
  • The CUDD package provides functions to manipulate Binary...
  • Mosek

  • Referenced in 418 articles [sw04618]
  • MOSEK is a tool for solving mathematical optimization...