CHENG-CHIA CHEN, & I-PENG LIN. (1993). The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. Information Processing Letters, 45(3), 131-136.
ISO-690 (author-date, English)CHENG-CHIA CHEN und I-PENG LIN, 1993. The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. Information processing letters. 1 Januar 1993. Vol. 45, no. 3, p. 131-136.
Modern Language Association 9th editionCHENG-CHIA CHEN, und I-PENG LIN. „The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic“. Information Processing Letters, Bd. 45, Nr. 3, Januar 1993, S. 131-6.
Mohr Siebeck - Recht (Deutsch - Österreich)CHENG-CHIA CHEN/I-PENG LIN: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic, Information processing letters 1993, 131-136.
Emerald - HarvardCHENG-CHIA CHEN und I-PENG LIN. (1993), „The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic“, Information Processing Letters, Vol. 45 No. 3, S. 131-136.