Journal of the ACM (JACM)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query automata over finite trees
Theoretical Computer Science
A Good Class of Tree Automata and Application to Inductive Theorem Proving
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Feature Automata and Recognizable Sets of Feature Trees
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
TQL Algebra and its Implementation
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The Complexity of the Graded µ-Calculus
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Logic-based web information extraction
ACM SIGMOD Record
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science - Foundations of software science and computation structures
Journal of Computer and System Sciences
Expressiveness and complexity of graph logic
Information and Computation
Alternating two-way AC-tree automata
Information and Computation
On Symbolic Verification of Weakly Extended PAD
Electronic Notes in Theoretical Computer Science (ENTCS)
Languages Modulo Normalization
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Tree Automata for Non-linear Arithmetic
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Satisfiability and relevance for queries over active documents
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML schema, tree logic and sheaves automata
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
ACM Transactions on Computational Logic (TOCL)
Kleene, Rabin, and Scott are available
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
On intersection problems for polynomially generated sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computing transitive closures of hedge transformations
International Journal of Critical Computer-Based Systems
Adding monotonic counters to automata and transition graphs
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Unranked tree automata with sibling equalities and disequalities
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries, we extend classical monadic second-order logic by Presburger predicates which pose numerical restrictions on the children (content) of an element node and provide a precise automata-theoretic characterization. While the existential fragment of the resulting logic is decidable, it turns out that satisfiability of the full logic is undecidable. Decidable satisfiability and a querying algorithm even with linear data complexity can be obtained if numerical constraints are only applied to those contents of elements where ordering is irrelevant. Finally, it is sketched how these techniques can be extended also to answer questions like, e.g., whether the total price of the jazz music downloaded so far exceeds a user's budget.