The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

Resource

Theoretical Computer Science: 129 (1): 95-121

Journal

Theoretical Computer Science:

Journal Volume

129

Journal Issue

1

Pages

95-121

Date Issued

1994

Date

1994

Author(s)

Chen, Cheng-Chia

Lin, I-Peng

URI

Type

journal article

File(s)

Name

06.pdf

Size

2.04 MB

Format

Adobe PDF

Checksum

(MD5):11c543bc2c133ab83792785d424a8e8f