On the undecidability of logics with converse, nominals, recursion and counting

DOI10.1016/j.artint.2004.04.012zbMath1085.68158OpenAlexW2041580396MaRDI QIDQ814615

Piero A. Bonatti, Adriano Peron

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2004.04.012

zbMATH Keywords

Description logicsGraded modalitiesHybrid \(\mu\)-calculusNumber restrictionsRegular roles

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25)

Related Items (6)

Complexity of modal logics with Presburger constraints ⋮ A logic of reachable patterns in linked data-structures ⋮ Reasoning within intuitionistic fuzzy rough description logics ⋮ Enriched μ–Calculus Pushdown Module Checking ⋮ On the adaptive control of a class of SISO dynamic hybrid systems ⋮ Reasoning within expressive fuzzy rough description logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An essay in combinatory dynamic logic
• General canonical models for graded normal logics. (Graded modalities. IV)
• Determinism and looping in combinatory PDL
• PDL with data constants
• Graded modalities. I
• Modal logic with names
• The modal logic of inequality
• Practical reasoning for very expressive description logics
• The undecidability of the domino problem

This page was built for publication: On the undecidability of logics with converse, nominals, recursion and counting