| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950779 | Information Processing Letters | 2017 | 6 Pages |
Abstract
If (1) action guards are in disjunctive normal form, or are short, i.e., of size logarithmic in the size of P, and (2) the number of shared variables is logarithmic in the size of P, then the triple normal form program has size polynomial in the size of P, and the transformation is computable in polynomial time.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paul C. Attie,