1993•Information Processing LettersRequires access

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

Cheng‐Chia Chen, I-Peng Lin

Open publisher page 27 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Linear temporal logic, Satisfiability, Horn clause, Temporal logic, Computational complexity theory, Propositional variable, Computer science, Mathematics

Back to paper search Browse research topics Original source

The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic — Research Paper | ScholarLens