On the Relationship between -automata and Temporal Logic Normal Forms

DOI10.1093/logcom/12.4.561zbMath1007.03014OpenAlexW1990608809WikidataQ98283988 ScholiaQ98283988MaRDI QIDQ3146301

No author found.

Publication date: 22 March 2003

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/12.4.561

zbMATH Keywords

automatatheorem provingnormal formstemporal logicclausal resolution

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)

Related Items (3)

Alternating automata and temporal logic normal forms ⋮ A clausal resolution method for extended computation tree logic ECTL ⋮ Variable and clause elimination for LTL satisfiability checking

This page was built for publication: On the Relationship between  -automata and Temporal Logic Normal Forms