Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the undecidability of logics with converse, nominals, recursion and counting
Artificial Intelligence
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
Theoretical Computer Science - Foundations of software science and computation structures
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
CTL Model-Checking with Graded Quantifiers
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
On the undecidability of description and dynamic logics with recursion and counting
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
Graded-CTL: Satisfiability and Symbolic Model Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Enriched µ-calculi module checking
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Enriched µ-calculus pushdown module checking
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Graded computation tree logic with binary coding
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Flat coalgebraic fixed point logics
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Graded alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Presburger modal logic is PSPACE-Complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A NuSMV extension for Graded-CTL model checking
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
ACM Transactions on Computational Logic (TOCL)
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |