Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The logic of typed feature structures
The logic of typed feature structures
Languages, automata, and logic
Handbook of formal languages, vol. 3
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Monadic second-order logic on tree-like structures
Theoretical Computer Science
Query automata over finite trees
Theoretical Computer Science
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Describing semistructured data
ACM SIGMOD Record
A Query Language Based on the Ambient Logic
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Towards Regular Languages over Infinite Alphabets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Reasoning about The Past with Two-Way Automata
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
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Regular Tree Languages Without Unary Symbols are Star-Free
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Query Evaluation on Compressed Trees (Extended Abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Logical Definability and Query Languages over Unranked Trees
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive queries over trees
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Deciding validity in a spatial logic for trees
Journal of Functional Programming
Temporal Logics over Unranked Trees
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Journal of Computer and System Sciences
Structural characterizations of the semantics of XPath as navigation tool on a document
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Interactive learning of node selecting tree transducer
Machine Learning
Journal of Computer and System Sciences
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Model Checking: From Tools to Theory
25 Years of Model Checking
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Adding nesting structure to words
Journal of the ACM (JACM)
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
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Combining temporal logics for querying XML documents
ICDT'07 Proceedings of the 11th international conference on Database Theory
Patterns and types for querying XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
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 |
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.