On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensively - Presburger arithmetic - Document - PDFSEARCH.IO

First Page	Meta Content
	On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensively Add to Reading List Document Date: 2013-09-27 07:35:34 Open Document File Size: 268,37 KB Share Result on Facebook Currency pence / / Facility University of Edinburgh Abstract / / IndustryTerm machinery / elementary algorithm / easier tools / / Organization In Section / University of Edinburgh Abstract / Tony Tan School of Informatics / / Person Leonid Libkin / / ProgrammingLanguage XML / / ProvinceOrState Virginia / / Technology XML / / SocialTag Theoretical computer science Model theory Automata theory Regular language Presburger arithmetic Structure Decision problem Mathematics Mathematical logic Formal languages

On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensivelyAdd to Reading List