• PVM

  • Referenced in 50 articles [sw06610]
  • present a class of fast first-order finite volume solvers, called PVM (polynomial viscosity matrix ... generally, for nonconservative hyperbolic systems. They are defined in terms of viscosity matrices computed...
  • NLambda

  • Referenced in 7 articles [sw23172]
  • language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite...
  • CoqMT

  • Referenced in 6 articles [sw19139]
  • computational mechanism, validity entailment for user-defined first-order equational theories. Such a mechanism strictly...
  • BLOG

  • Referenced in 41 articles [sw22025]
  • illustrates BLOG, a formal language for defining probability models over worlds with unknown objects ... specifies a unique probability distribution over first-order model structures that can contain varying...
  • SHRAD

  • Referenced in 6 articles [sw02663]
  • avoided. 3) All the computable first-order functions are defined in the language (expressivity...
  • BradleyTerry2

  • Referenced in 22 articles [sw09554]
  • reduced maximum likelihood in which the first-order asymptotic bias of parameter estimates is eliminated ... handling missing covariate data, and suitably-defined residuals for diagnostic checking of the linear predictor...
  • FACTORIE

  • Referenced in 13 articles [sw08947]
  • tied parameters; at issue is how to define these structures in a powerful and flexible ... declarative language, such as SQL or first-order logic, we advocate using an imperative language ... significant efficiencies. We have implemented such imperatively defined factor graphs in a system we call...
  • SCR

  • Referenced in 19 articles [sw06939]
  • requirements, surprisingly, its semantics is not well defined. The symbols used in this method ... semantics by enabling events in first-order logic via two symbols pred and succ. This...
  • Leon

  • Referenced in 11 articles [sw09159]
  • Leon are expressed in terms of user-defined functions. We discuss several techniques that ... efficient semi-decision procedure for first-order constraints with recursive functions, which is the core...
  • RISCAL

  • Referenced in 2 articles [sw26269]
  • behavior with respect to user-defined theories in first-order logic. This language is based...
  • SQEMA

  • Referenced in 40 articles [sw03056]
  • introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae ... semantic one, viz. downward monotonicity. For the first, and most general, extension SemSQEMA we prove ... containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing...
  • Gmeta

  • Referenced in 4 articles [sw10110]
  • presents GMeta: a generic framework for first-order representations of variable binding that provides once ... object languages we define datatype-generic libraries of infrastructure for first-order representations such...
  • PPlan

  • Referenced in 2 articles [sw20685]
  • semantics of the first-order preference language is defined using the situation calculus. The truth...
  • CoqMTU

  • Referenced in 3 articles [sw19138]
  • predicative hierarchy of universes and a first-order theory T built in its conversion relation ... constructors, a set of defined symbols, axioms expressing that constructors are free and defined symbols ... completely defined, and a generic elimination principle relying on crucial properties of first-order structures...
  • FOOL

  • Referenced in 4 articles [sw14287]
  • sorted first-order logic, in which the boolean sort is treated as a first-class ... define the syntax and semantics of FOOL and its model-preserving translation to first-order...
  • UnQL

  • Referenced in 10 articles [sw20018]
  • cyclic data, structural recursion can be defined in two equivalent ways: as a recursive function ... structural recursion can be expressed in first-order logic extended with transitive closure; its data ... model is based on value equality, formally defined with bisimulation. Structural recursion is shown...
  • GRASShopper

  • Referenced in 6 articles [sw23304]
  • supports mixing of separation logic and first-order logic assertions, yielding expressive yet concise specifications ... simple procedural imperative language that supports user-defined struct types and arrays. The specification logic...
  • Pyhybridanalysis

  • Referenced in 3 articles [sw14549]
  • Automata are logic-based and their are defined as described in [CPP09]. Starting with ... each step, the algorithm builds the first-order formula corresponding to the evolution ... Tarski’s theory (i.e., is a first-order formula involving polynomials), the sphere semantics ... semantics, and the easy semantics of are definable in the Tarski’s theory...
  • DREAM

  • Referenced in 3 articles [sw25782]
  • provides means to define the homogeneous solutions of the higher-order recurrence ... relations (and can construct those of the first-order recurrence relations automatically). Therefore, this package...
  • Lambda Free RPOs

  • Referenced in 4 articles [sw28792]
  • This Isabelle/HOL formalization defines recursive path orders (RPOs) for higher-order terms without lambda-abstraction ... them. The main order fully coincides with the standard RPO on first-order terms also...