Alternating automata on infinite trees
Theoretical Computer Science
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Reasoning and revision in hybrid representation systems
Reasoning and revision in hybrid representation systems
Attributive concept descriptions with complements
Artificial Intelligence
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Boosting the correspondence between description logics and propositional dynamic logics
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The complexity of concept languages
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Languages, automata, and logic
Handbook of formal languages, vol. 3
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Description logics for conceptual data modeling
Logics for databases and information systems
EKAW '00 Proceedings of the 12th European Workshop on Knowledge Acquisition, Modeling and Management
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Terminological Knowledge Representation System with Complete Inference Algorithms
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
Journal of Artificial Intelligence Research
Reasoning in expressive description logics with fixpoints based on automata on infinite trees
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Towards Service Description Logics
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The description logic handbook
On the undecidability of logics with converse, nominals, recursion and counting
Artificial Intelligence
On the decidability of containment of recursive datalog queries - preliminary report
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Description Logics for Shape Analysis
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Modal Expressiveness of Graph Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
On model checking multiple hybrid views
Theoretical Computer Science
Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification
Verified Software: Theories, Tools, Experiments
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
On the undecidability of description and dynamic logics with recursion and counting
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Regular path queries in expressive description logics with nominals
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
MLAT: a tool for heap analysis based on predicate abstraction by modal logic
SE '08 Proceedings of the IASTED International Conference on Software Engineering
Logic and automata: a match made in heaven
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Enriched µ-calculi module checking
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Enriched µ-calculus pushdown module checking
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Clausal graph tableaux for hybrid logic with eventualities and difference
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Clausal Tableaux for Hybrid PDL
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Terminating tableaux for hybrid logic with eventualities
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Datalog for security, privacy and trust
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Automated verification of recursive programs with pointers
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Global view on reactivity: switch graphs and their logics
Annals of Mathematics and Artificial Intelligence
A Goal-Directed Decision Procedure for Hybrid PDL
Journal of Automated Reasoning
| Hi-index | 0.00 |
We present an ExpTime decision procedure for the full 碌-Calculus (including converse programs) extended with nominals and a universal program, thus devising a new, highly expressive ExpTime logic. The decision procedure is based on tree automata, and makes explicit the problems caused by nominals and how to overcome them. Roughly speaking, we show how to reason in a logic lacking the tree model property using techniques for logics with the tree model property. The contribution of the paper is two-fold: we extend the family of ExpTime logics, and we present a technique to reason in the presence of nominals.