"The Computational Complexity of the Satisfiability of Modal Horn Clauses ..."

Cheng-Chia Chen, I-Peng Lin (1994)

> Home

Details and statistics

DOI: 10.1016/0304-3975(94)90082-5

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/ChenL94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChenL94
Cheng-Chia Chen, I-Peng Lin:
The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics. Theor. Comput. Sci. 129(1): 95-121 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.