Stephan Kepser  Home/Search
Context Related
| tcl.sfs.nphil.unituebingen...fgmol.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcl.sfs.nphil.unituebinge...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ... (Update)
Cited by: More
Czech Clitics In Higher Order Grammar - Hana (2004) (Correct)
Active bibliography (related documents): More All
1.2: A Coalgebraic Modelling of Head-Driven Phrase Structure Grammar - Kepser (2000) (Correct)
0.5: Towards Truth In Head-Driven Phrase Structure Grammar - King (1999) (Correct)
0.4: Formal Grammar (HPSG) - Przepiórkowski (2000) (Correct)
Similar documents based on text: More All
1.8: RSRL For HPSG - Richter (1999) (Correct)
1.5: A Formal Interpretation of Relations and Quantification in.. - Richter, Sailer, Penn (1999) (Correct)
0.6: An RSRL Formalization of Serbo-Croatian Second Position Clitic.. - Penn (Correct)
BibTeX entry: (Update)
@misc{ kepser-complexity,
author = "Stephan Kepser",
title = "On the Complexity of RSRL",
url = "citeseer.ist.psu.edu/article/stephan01complexity.html" }
Citations (may not include all citations):620 Head-Driven Phrase Structure Grammar - Pollard, Sag - 1994
294 Finite Model Theory (context) - Ebbinghaus - 1995
67 A variant of a recursively unsolvable problem (context) - Post - 1946
39 Expressibility as a complexity measure: Results and directio.. (context) - Immerman - 1987
28 A note on the entscheidungsproblem (context) - Church - 1936
10 A Mathematical Formalism for Linguistic Theories with an App.. (context) - Richter - 2000
8 A Satisfiability Algorithm for a Typed Feature Logic - Kepser - 1994
7 A Formal Interpretation of Relations and Quantification in H.. - Richter, Sailer et al. - 1999
4 The complexity of modellability in finite and computable sig.. - King, Simov et al. - 1999
3 Towards truth in HPSG - King - 1999
2 A Logical Formalism for Head-Driven Phrase Struture Grammar (context) - King - 1989
1 Information Based Syntax and Semantics, Vol. 1: Fundamentals (context) - Pollard, Sag - 1987
Documents on the same site (http://tcl.sfs.nphil.uni-tuebingen.de/~kepser/papers/pubs.html): More
A Coalgebraic Modelling of Head-Driven Phrase Structure Grammar - Kepser (2000) (Correct)
A Satisfiability Algorithm for a Typed Feature Logic - Kepser (1994) (Correct)
Combination of Constraint Systems II: Rational Amalgamation - Schulz, Kepser (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC