Guarded logics have been shown to be amazingly versatile and tractable logics since their inception by Andréka, van Benthem, Németi. Results to be surveyed include finite and small model properties, decidability results, complexity and expressive completeness issues, and guarded bisimulations.
@InProceedings{otto:LIPIcs.CSL.2011.2, author = {Otto, Martin}, title = {{The Freedoms of Guarded Bisimulation}}, booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL}, pages = {2--2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-32-3}, ISSN = {1868-8969}, year = {2011}, volume = {12}, editor = {Bezem, Marc}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.2}, URN = {urn:nbn:de:0030-drops-32163}, doi = {10.4230/LIPIcs.CSL.2011.2}, annote = {Keywords: model theory, guarded logic, bisimulation, hypergraphs} }
Feedback for Dagstuhl Publishing