(Enter summary)
Abstract: . One may identify two main approaches to the description of
type hierarchies. In total specification, a unique hierarchy is described.
In open specification, a set of constraints identifies properties of the hierarchy,
without providing a complete description. Open specification
provides increased expressive power, but at the expense of considerable
computational complexity, with essential tasks being NP-complete or
NP-hard. In this work, a formal study of the structural and... (Update)
Active bibliography (related documents): More All
0.3: Efficient Inference Algorithms for Databases of Type Hierarchies.. - Hegner
(Correct)
0.3: A Constraint-Based Case Frame Lexicon Architecture - Oflazer, Yilmaz
(Correct)
0.2: Foundations Of Supermanifold Theory: The Axiomatic.. - Bartocci, Bruzzo.. (1992)
(Correct)
Similar documents based on text: More All
0.4: User Manual for sucseq-marker Software for the Project Text.. - Hegner
(Correct)
0.3: Symmetry in Class and Type Hierarchy - Zhao, Coplien (2002)
(Correct)
0.3: Horn Clauses and Feature-Structure Logic: Principles and.. - Hegner (1993)
(Correct)
BibTeX entry: (Update)
@article{ hegner01computational,
author = "Stephen J. Hegner",
title = "Computational and Structural Aspects of Openly Specified Type Hierarchies",
journal = "Lecture Notes in Computer Science",
volume = "2014",
pages = "48--??",
year = "2001",
url = "citeseer.ist.psu.edu/hegner98computational.html" }
Citations (may not include all citations):
620
Head-Driven Phrase Structure Grammar
- Pollard, Sag - 1994
572
Computers and Intractability (context) - Garey, Johnson - 1979
370
A Mathematical Introduction to Logic (context) - Enderton - 1972
318
Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
207
The Logic of Typed Feature Structures
- Carpenter - 1992
191
Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
146
Domain-independent extensions to GSAT: Solving large structu..
- Selman, Kautz - 1993
94
Expressiveness and tractability in knowledge representation (context) - Levesque, Brachman - 1987
65
General Lattice Theory (context) - Gratzer - 1978
39
An algebraic semantics approach to the effective resolution .. (context) - Ait-Kaci - 1986
38
Allyn and Bacon (context) - Herrlich, Strecker - 1973
27
ALE: The Attribute Logic Engine user's guide (context) - Carpenter, Penn - 1998
20
Why Horn formulas matter in computer science: Initial struct.. (context) - Makowsky - 1987
16
Technical report
- Zajac, the et al. - 1991
15
Feature logic with disjunctive unification (context) - Dorre, Eisele - 1990
12
The correct and efficient implementation of appropriateness ..
- Gerdemann, King - 1994
11
Computer Science Press (context) - Horowitz, Sahni et al. - 1998
7
Efficient implementation of lattice operations
- Ait-Kaci, Boyer et al. - 1989
5
CUF -- a formalism for linguistic knowledge representation (context) - Doerre, Dorna - 1993
4
Cambridge University Press (context) - Briscoe, de Paiva et al. - 1993
3
Types and constraints in the LKB (context) - de Paiva - 1993
1
Properties of Horn clauses in feature-structure logic (context) - Hegner - 1994
Documents on the same site (http://www.cs.umu.se/~hegner/Publications/HTML/compling.html): More
User Manual for sucseq-marker Software for the Project Text.. - Hegner
(Correct)
Horn Extended Feature Structures: Fast Unification With Negation.. - Hegner (1991)
(Correct)
A Family of Decidable Feature Logics which Support HPSG-Style Set .. - Hegner
(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