On the public citation graph
Ordering Constraints over Feature Trees
0 signed · 58 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jsco.1994.1028openalex-snapshot
Regular Path Expressions in Feature Logic
inferredcites →https://doi.org/10.1007/3-540-52337-6_21openalex-snapshot
Representation and reasoning with attributive descriptions
inferredcites →https://doi.org/10.1007/3-540-56944-8_37openalex-snapshot
Entailment and disentailment of order-sorted feature constraints
inferredcites →https://doi.org/10.1007/3-540-57182-5_64openalex-snapshot
Feature constraints with first-class features
inferredcites →https://doi.org/10.1007/3-540-60406-5_15openalex-snapshot
Handling version sets through feature logic
inferredcites →https://doi.org/10.1007/3-540-61551-2_67openalex-snapshot
The independence property of a class of set constraints
inferredcites →https://doi.org/10.1007/bf01806313openalex-snapshot
Integrating logic and functional programming
inferredcites →https://doi.org/10.1007/bfb0017447openalex-snapshot
Ordering Constraints over Feature Trees
inferredcites →https://doi.org/10.1007/bfb0030609openalex-snapshot
Inclusion constraints over non-empty sets of trees
inferredcites →https://doi.org/10.1007/bfb0052371openalex-snapshot
Ordering constraints over feature trees expressed in second-order monadic logic
inferredcites →https://doi.org/10.1016/0304-3975(86)90047-2openalex-snapshot
An algebraic semantics approach to the effective resolution of type equations
inferredcites →https://doi.org/10.1016/0304-3975(94)00188-oopenalex-snapshot
A complete and recursive feature theory
inferredcites →https://doi.org/10.1016/0304-3975(94)90209-7openalex-snapshot
A feature constraint system for logic programming with entailment
inferredcites →https://doi.org/10.1016/0743-1066(86)90013-0openalex-snapshot
Login: a logic programming language with built-in inheritance
inferredcites →https://doi.org/10.1016/0743-1066(92)90039-6openalex-snapshot
Feature-constraint logics for unification grammars
inferredcites →https://doi.org/10.1016/0743-1066(93)90043-gopenalex-snapshot
Towards a meaning of life
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/0743-1066(94)90044-2openalex-snapshot
Records for logic programming
inferredcites →https://doi.org/10.1016/0743-1066(95)00033-gopenalex-snapshot
A complete axiomatization of a theory with feature and arity constraints
inferredcites →https://doi.org/10.1016/b978-0-08-050296-0.50014-0openalex-snapshot
Feature Logic with Weak Subsumption Constraints
inferredcites →https://doi.org/10.1016/s0747-7171(08)80107-1openalex-snapshot
On subsumption and semiunification in feature algebras
inferredcites →https://doi.org/10.1017/cbo9780511530098openalex-snapshot
The Logic of Typed Feature Structures
inferredcites →https://doi.org/10.1109/lics.1990.113756openalex-snapshot
On subsumption and semiunification in feature algebras
inferredcites →https://doi.org/10.1109/lics.1994.316073openalex-snapshot
Efficient inference of object types
inferredcites →https://doi.org/10.1109/lics.1999.782623openalex-snapshot
Entailment of atomic set constraints is PSPACE-complete
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1145/113413.113429openalex-snapshot
Constraint-based query optimization for spatial databases
inferredcites →https://doi.org/10.1145/232627.232642openalex-snapshot
Simplifying subtyping constraints
inferredcites →https://doi.org/10.1145/261640.261654openalex-snapshot
Unified versioning through feature logic
inferredcites →https://doi.org/10.22028/d291-25675openalex-snapshot
Expressivity and decidability of first-order languages over feature trees
inferredcites →https://doi.org/10.3115/981131.981166openalex-snapshot
A logical semantics for feature structures
inferredcites →https://doi.org/10.46298/dmtcs.267openalex-snapshot
The First-Order Theory of Ordering Constraints over Feature Trees
inferredcites →https://doi.org/10.48550/arxiv.cmp-lg/9608002openalex-snapshot
Controlling Functional Uncertainty
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0047openalex-snapshot
Operational Semantics of Constraint Logic Programs with Coroutining
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.2878openalex-snapshot
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_21openalex-snapshot
A 3-Part Type Inference Engine
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_22openalex-snapshot
Entailment of Non-structural Subtype Constraints
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_14openalex-snapshot
Type Inference for First-Class Messages with Feature Constraints
inferred← citeshttps://doi.org/10.1007/978-3-7908-1772-0_19openalex-snapshot
Retrieval of Semistructured Web Data
inferred← citeshttps://doi.org/10.1007/bfb0017466openalex-snapshot
Set constraints: A pearl in research on constraints
inferred← citeshttps://doi.org/10.1007/bfb0052371openalex-snapshot
Ordering constraints over feature trees expressed in second-order monadic logic
inferred← citeshttps://doi.org/10.1016/j.jss.2025.112434openalex-snapshot
FMSans: An efficient approach for constraints removal and parallel analysis of feature models
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00050-6openalex-snapshot
An efficient graph algorithm for dominance constraints
inferred← citeshttps://doi.org/10.1023/a:1021880119937openalex-snapshot
Ordering and Path Constraints over Semistructured Data
inferred← citeshttps://doi.org/10.1109/lics.1998.705677openalex-snapshot
The first-order theory of ordering constraints over feature trees
inferred← citeshttps://doi.org/10.1109/lics.2002.1029829openalex-snapshot
Tree extension algebras: logics, automata, and query languages
inferred← citeshttps://doi.org/10.1145/1013560.1013561openalex-snapshot
Basic theory of feature trees
inferred← citeshttps://doi.org/10.1145/1053468.1053472openalex-snapshot
Automatic discovery of covariant read-only fields
inferred← citeshttps://doi.org/10.1145/1227839.1227843openalex-snapshot
Logical definability and query languages over ranked and unranked trees
inferred← citeshttps://doi.org/10.1145/1734213.1734217openalex-snapshot
Set constraints with projections
inferred← citeshttps://doi.org/10.22028/d291-25722openalex-snapshot
Set based failure diagnosis for concurrent constraint programming
inferred← citeshttps://doi.org/10.4018/978-1-59140-050-9.ch001openalex-snapshot
Modeling and Querying Web Data
inferred← citeshttps://doi.org/10.46298/dmtcs.267openalex-snapshot
The First-Order Theory of Ordering Constraints over Feature Trees
showing the first 19 of 20 · page through all 20
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.