Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Backofen, G. Smolka (1993)
A Complete and Recursive Feature Theory
K. Compton, C. Henson (1990)
A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical TheoriesAnn. Pure Appl. Log., 48
Martin Müller, Joachim Niehren, R. Treinen (1998)
The first-order theory of ordering constraints over feature treesProceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
R. Backofen (1995)
A Complete Axiomatization of a Theory with Feature and Arity ConstraintsJ. Log. Program., 24
J. Jaffar, Michael Maher (1994)
Constraint Logic Programming: A SurveyJ. Log. Program., 19/20
G. Smolka, R. Treinen (1994)
Records for Logic ProgrammingJ. Log. Program., 18
Martin Müller, Joachim Niehren, A. Podelski (1997)
Ordering Constraints over Feature TreesConstraints, 5
R. Backofen, R. Treinen (1994)
How to Win a Game with FeaturesInf. Comput., 142
H. Aït-Kaci, A. Podelski (1993)
Entailment and Disentailment of Order-Sorted Feature Constraints
M. Fischer, M. Rabin (1974)
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
S. Vorobyov (1996)
An Improved Lower Bound for the Elementary Theories of Trees
H. Aït-Kaci, A. Podelski, G. Smolka (1994)
A Feature Constraint System for Logic Programming with EntailmentTheor. Comput. Sci., 122
G. Smolka (1989)
Feature-Constraint Logics for Unification GrammarsJ. Log. Program., 12
Martin Müller, Joachim Niehren (2000)
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic LogicInf. Comput., 159
(2002)
Received February ACM Transactions on Computational Logic
We present a decision algorithm for the problem Val ( FT ) of deciding validity of first-order sentences in the theory of feature trees. Its time complexity is exp ⌊c·m⌋ ( c · n ) where n is the length of a sentence, m is the quantifier depth of a sequence, and c is a constant. The function exp i ( j ) is an exponential tower of 2's of height i , to power j (exp 0 ( j ) = j and exp i +1 ( j ) = 2 exp i ( j ) ). Moreover we prove that the presented algorithm is optimal, deriving a lower bound which matches the upper one.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jul 1, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.