Browse Research and Tech Reports - Computer Science by Subject "finite variant property (FVP)"

  • Skeirik, Stephen; Meseguer, José (2016-06-07)
    Variant satisfiability is a theory-generic algorithm to decide quantifier-free satisfiability in an initial algebra when its corresponding theory has the finite variant property and its constructors satisfy a compactness ...

    application/pdf

    application/pdfPDF (582kB)
  • Gutierrez, Raul; Meseguer, Jose (2017-06-27)
    Decision procedures can be either theory specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure ...

    application/pdf

    application/pdfPDF (439kB)
  • Meseguer, José (2015-11)
    Although different satisfiability decision procedures can be combined by algorithms such as those of Nelson-Oppen or Shostak, current tools typically can only support a finite number of theories to use in such ...

    application/pdf

    application/pdfPDF (656kB)