Abstract
In this paper we present a computability and a complexity result on Relational Speciate Reentrant Logic (RSRL). RSRL is a description logic designed to formalise the linguistic framework and theory Head-Driven Phrase Structure Grammar. We show here that given an RSRL-formula and a finite RSRL-interpretation it is in general not decidable if the formula is true in the given interpretation by reduction to Post Correspondence Problems. For so-called chainless RSRL, a semantically weaker version in which the expressive power of RSRL is significantly reduced, we show that if a class of finite structures is definable in chainless RSRL it is decidable by a Turing machine polynomially time bounded in the size of the input structures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
