Logical Approaches to Non-deterministic Polynomial Time over Semirings
By: Timon Barlag , Nicolas Fröhlich , Teemu Hankala and more
Potential Business Impact:
Makes computers solve harder problems faster.
We provide a logical characterization of non-deterministic polynomial time defined by BSS machines over semirings via existential second-order logic interpreted in the semiring semantics developed by Gr\"adel and Tannen. Furthermore, we show that, similarly to the classical setting, the satisfiability problem of propositional logic in the semiring semantics is the canonical complete problem for this version of NP. Eventually, we prove that the true existential first-order theory of the semiring is a complete problem for the so-called Boolean part of this version of NP.
Similar Papers
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.
Implication Problems over Positive Semirings
Logic in Computer Science
Organizes data for smarter computer decisions.
Computational and Categorical Frameworks of Finite Ternary $Γ$-Semirings: Foundations, Algorithms, and Industrial Modeling Applications
Rings and Algebras
Organizes math rules for computers to use.