Searching Fragment Spaces with Feature Trees

2009 ◽  
Vol 49 (2) ◽  
pp. 270-279 ◽  
Author(s):  
Uta Lessel ◽  
Bernd Wellenzohn ◽  
Markus Lilienthal ◽  
Holger Claussen
Keyword(s):  
Feature Trees

Improving Similarity-Driven Library Design: Customized Matching and Regioselective Feature Trees

2011 ◽  
Vol 51 (9) ◽  
pp. 2156-2163 ◽  
Author(s):  
J. Robert Fischer ◽  
Uta Lessel ◽  
Matthias Rarey
Keyword(s):  
Library Design ◽  
Feature Trees

TYPE INFERENCE FOR FIRST-CLASS MESSAGES WITH FEATURE CONSTRAINTS

2000 ◽  
Vol 11 (01) ◽  
pp. 29-63
Author(s):  
MARTIN MÜLLER ◽  
SUSUMU NISHIMURA
Keyword(s):  
Polynomial Time ◽  
Type System ◽  
Type Inference ◽  
Satisfiability Problem ◽  
Recent Proposal ◽  
Inference Problem ◽  
Np Complete ◽  
Feature Constraints ◽  
Feature Trees ◽  
Selection Constraint

We present a constraint system, OF, of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of feature constraints by a selection constraint x <y> z, "by first-class feature tree" y, which is in contrast to the standard selection constraint x[f]y, "by fixed feature" f. We investigate the satisfiability problem of OF and show that it can be solved in polynomial time, and even in quadratic time if the number of features is bounded. We compare OF with Treinen's system EF of feature constraints with first-class features, which has an NP-complete satisfiability problem. This comparison yields that the satisfiability problem for OF with negation is NP-hard. Further we obtain NP-completeness, for a specific subclass of OF with negation that is useful for a related type inference problem. Based on OF we give a simple account of type inference for first-class messages in the spirit of Nishimura's recent proposal, and we show that it has polynomial time complexity: We also highlight an immediate extension of this type system that appears to be desirable but makes type inference NP-complete.

Feature Trees: Theory and Applications from Large‐scale Virtual Screening to Data Analysis

2006 ◽  
pp. 81-116 ◽  
Author(s):  
Matthias Rarey ◽  
Sally Hindle ◽  
Patrick Maaß ◽  
Günther Metz ◽  
Christian Rummey ◽  
...  
Keyword(s):  
Data Analysis ◽  
Virtual Screening ◽  
Large Scale ◽  
Feature Trees

Feature structures and indices

Phonology ◽  
1991 ◽  
Vol 8 (1) ◽  
pp. 137-144 ◽  
Author(s):  
Steven Bird
Keyword(s):  
Current Method ◽  
Complete Agreement ◽  
Phonological Structure ◽  
Feature Structures ◽  
Feature Trees

Hayes (1990) proposes the adoption of a new notation for representing hierarchical phonological structure, in response to a notational problem which he calls the DIPHTHONGISATION PARADOX. More generally, he seeks to find a replacement for the current method of depicting feature trees, which is not ideally suited to the clear expression of rules and derivations. While I am in complete agreement with this standpoint and fully support Hayes' assertion that certain ambiguities of interpretation have crept into the graphical conventions currently in widespread use, I nevertheless believe his proposal suffers from a number of problems. Once identified, these problems can be solved with further notational and formal refinements.

Sign in / Sign up

Export Citation Format

Share Document