Name
Abstract | ||
|---|---|---|
Graphs are among the most frequently used structures in Computer Science. Some of the properties that must be checked in many applications are connectivity, acyclicity and the Eulerian and Hamiltonian properties. In this work, we analyze how we can express these four properties with modal logics. This involves two issues: whether each of the modal languages under consideration has enough expressiv... |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1093/jigpal/jzp021 | Logic Journal of the IGPL |
Keywords | Field | DocType |
Computational Complexity,Frame-Checking,Graphs,Modal Logic,Model-Checking | Modal μ-calculus,Discrete mathematics,Hybrid logic,Normal modal logic,Accessibility relation,Multimodal logic,Algorithm,Modal operator,Theoretical computer science,Modal logic,Mathematics,Dynamic logic (modal logic) | Journal |
Volume | Issue | ISSN |
17 | 5 | 1367-0751 |
Citations | PageRank | References |
7 | 0.55 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mario R. F. Benevides | 1 | 143 | 23.75 |
| L. Menasché Schechter | 2 | 23 | 4.84 |