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

First Page		Document Content
Date: 2013-09-27 07:35:34 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 extensively Add to Reading List Source URL: alpha.uhasselt.be Download Document from Source Website File Size: 268,37 KB Share Document on Facebook