Which Comparability Graphs are Embeddable into Trees?

Recently, we have shown that satisfiability for CTL* with constraints over the integers is decidable using a new technique. Our approach reduces the satisfiability problem of CTL* with constraints over a class of structures C to the problem whether C has a certain property EHomDef. Here we try to apply this approach to concrete domains that are tree-like and obtain several results. 13: 00 14: 30 Lunch

Authors

• Claudia Carapelle

Keywords

No keywords are indexed for this paper.