Paper Info
Title
Satisfiability and Completeness of Converse-PDL Replayed
Abstract
This paper reinvestigates the satisfiability problem and the issue of completeness for Propositional Dynamic Logic with Converse. By giving a game-theoretic characterisation of its satisfiability problem using focus games, an axiom system that is extracted from these games can easily be proved to be complete.
Year
DOI
Venue
2003
10.1007/978-3-540-39451-8_7
Lecture Notes in Artificial Intelligence
Keywords
Field
DocType
satisfiability
Discrete mathematics,Converse,Axiom,Computer science,Boolean satisfiability problem,Satisfiability,Propositional calculus,Game theory,Dynamic logic (digital electronics),Completeness (statistics)
Conference
Volume
ISSN
Citations 
2821
0302-9743
2
PageRank 
References 
Authors
0.49
12
1
Name
Order
Citations
PageRank
Martin Lange1444.03