The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic

Resource

Information Processing Letters: 45 (3): 131-136

Journal

Information Processing Letters

Journal Volume

45

Journal Issue

3

Pages

131-136

Date Issued

1993

Date

1993

Author(s)

Chen, Cheng-Chia

Lin, I-Peng

URI

Type

journal article

File(s)

Name

04.pdf

Size

627.13 KB

Format

Adobe PDF

Checksum

(MD5):1453e0f544d1768565c2853dfb6984b0