| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4951459 | Journal of Logical and Algebraic Methods in Programming | 2017 | 16 Pages |
Abstract
Several properties of SOS specifications with negative premises, often used to define what it means for a specification to be meaningful, are proved undecidable. This includes the existence of least or unique supported or stable models, and specification completeness.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bartek Klin, Beata NachyÅa,