no code implementations • 16 Jan 2014 • Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
The satisfiability problem is shown to be undecidable for this new logic, but we introduce a very general class of schemata, called bound-linear, for which this problem becomes decidable.
