Author image not provided
 Saguy Benaim

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.50
Citation Count5
Publication count2
Publication years2013-2016
Available for download1
Average downloads per article122.00
Downloads (cumulative)122
Downloads (12 Months)36
Downloads (6 Weeks)6
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
November 2016 ACM Transactions on Computational Logic (TOCL): Volume 17 Issue 4, November 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 36,   Downloads (Overall): 122

Full text available: PDFPDF
Verification of properties expressed in the two-variable fragment of first-order logic FO 2 has been investigated in a number of contexts. The satisfiability problem for FO 2 over arbitrary structures is known to be NEXPTIME-complete, with satisfiable formulas having exponential-sized models. Over words, where FO 2 is known to have ...
Keywords: Trees, logic

2
July 2013 ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

Verification of properties expressed in the two-variable fragment of first-order logic FO 2 has been investigated in a number of contexts. The satisfiability problem for FO 2 over arbitrary structures is known to be NEXPTIME-complete, with satisfiable formulas having exponential-sized models. Over words, where FO 2 is known to have ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us