Global Numerical Constraints on Trees

DOI10.2168/LMCS-10(2:10)2014zbMath1314.68113arXiv1405.1295OpenAlexW1998912565MaRDI QIDQ4979448

Everardo Bárcenas, Jesús Lavalle

Publication date: 23 June 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.1295

zbMATH Keywords

satisfiabilityXML schemascounting constraintsquery reasoning

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Mu-calculus satisfiability with arithmetic constraints ⋮ On regular paths with counting and data tests ⋮ CTL\(^\ast\) with graded path modalities

This page was built for publication: Global Numerical Constraints on Trees