Modified 2 Satisfiability Reverse Analysis Method via Logical Permutation?perator

Logical Primes, Metavariables and Satisfiability

For formulas F of propositional calculus I introduce a "metavariable" MF and show how it can be used to define an algorithm for testing satisfiability. MF is a formula which is true/false under all possible truth assignments iff F is satisfiable/unsatisfiable. In this sense MF is a metavariable with the "meaning" 'F is SAT'. For constructing MF a group of transformations of the basic variables ...

Correctness of Java Card Method Lookup via Logical Relations

We formalise the Java Card bytecode optimisation from class file to CAP file format as a set of constraints between the two formats, and define and prove its correctness. Java Card bytecode is formalised as an abstract operational semantics, which can then be instantiated into the two formats. The optimisation is given as a logical relation such that the instantiated semantics are observably eq...

Solving Satisfiability Via Boltzmann Machines

Modal Satisfiability via SMT Solving

Modal logics extend classical propositional logic, and they are robustly decidable. Whereas most existing decision procedures for modal logics are based on tableau constructions, we propose a framework for obtaining decision procedures by adding instantiation rules to standard SAT and SMT solvers. Soundness, completeness, and termination of the procedures can be proved in a uniform and elementa...

Stability analysis of fractional-order nonlinear Systems via Lyapunov method

‎In this paper‎, ‎we study stability of fractional-order nonlinear dynamic systems by means of Lyapunov‎ ‎method‎. ‎To examine the obtained results‎, ‎we employe the developed techniques on test examples‎.