M. Lange and C. Stirling. Focus games for satisfiability and completeness of temporal logic. In Proc. 16th Symp. on Logic in Computer Science, LICS'01, Boston, MA, USA, June 2001. IEEE. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Comparing Tableaux, Automata and Games for Modal and Temporal.. - Lange (2001) (Correct)
....amount of handling data structures they face the criticism of not being suitable for e#cient solutions. Game based model checking algorithms exist for the calculus [Sti95] as well as CTL # [LS00, VB00] The latter work has led to game based satisfiability checkers for temporal and dynamic logics [LS01a, LS01b] which easily yield complete axiom systems. There it is shown that games neatly relate satisfiability and consistency of a formula by constructing the axiom system from the rules and winning conditions of the satisfiability game. Moreover, instead of explicitly building a model for a formula the ....
M. Lange and C. Stirling. Focus games for satisfiability and completeness of temporal logic. Submitted, 2001.
Game Over: The Foci Approach to LTL Satisfiability and Model.. - Dax, Lange (2004) Self-citation (Lange) (Correct)
No context found.
M. Lange and C. Stirling. Focus games for satisfiability and completeness of temporal logic. In Proc. 16th Symp. on Logic in Computer Science, LICS'01, Boston, MA, USA, June 2001. IEEE.
Satisfiability Games for CTL* - Lange, Stirling Self-citation (Lange Stirling) (Correct)
No context found.
M. Lange and C. Stirling. Focus games for satisfiability and completeness of temporal logic. In Proc. 16th Annual IEEE Symp. on Logic in Computer Science, LICS'01, Boston, MA, USA, June 2001. IEEE Computer Society Press.
Satisfiability and Completeness of Converse-PDL Replayed - Lange (2003) Self-citation (Lange) (Correct)
No context found.
M. Lange and C. Stirling. Focus games for satisfiability and completeness of temporal logic. In Proc. 16th Symp. on Logic in Computer Science, LICS'01, Boston, MA, USA, June 2001. IEEE.
Satisfiability and Completeness of PDL replayed - Lange, Stirling (2001) (1 citation) Self-citation (Lange Stirling) (Correct)
....because it does not capture the regeneration of least fixed point constructs correctly. To overcome this we employ an additional structure on sets called focus. This approach was first used in [6] to solve the model checking problem for the temporal logics LTL and CTL # in a game based way. In [7] it is shown how this technique solved satisfiability for the temporal logics LTL and CTL, and at the same time led to simple completeness proofs. It is, as this paper shows, also applicable to PDL. The axiom system can easily be extracted from the satisfiability games. Thus, it is divided into ....
M. Lange and C. Stirling. Focus games for satisfiability and completeness of temporal logic. Submitted, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC