Foundations of logic programming
Foundations of logic programming
Artificial Intelligence
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Feature structures: a logical theory with application to language analysis
Feature structures: a logical theory with application to language analysis
A logic for partially specified data structures
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Extensions to unification grammar for the description of programming languages
Extensions to unification grammar for the description of programming languages
LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Introduction to algorithms
An interpretation of negation in feature structure descriptions
Computational Linguistics
Features, frames and quantifier-free formulae
Logic and logic grammars for language processing
Principles of automated theorem proving
Principles of automated theorem proving
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
On subsumption and semiunification in feature algebras
Journal of Symbolic Computation
The logic of typed feature structures
The logic of typed feature structures
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Feature-constraint logics for unification grammars
Journal of Logic Programming
Inheritance and constraint-based grammar formalisms
Computational Linguistics - Special issue on inheritance: I
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Logic for Problem Solving
Elements of the Theory of Computation
Elements of the Theory of Computation
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Computational Complexity and Natural Language
Computational Complexity and Natural Language
Text Understanding in LILOG, Integrating Computational Linguistics and Artificial Intelligence, Final Report on the IBM Germany LILOG-Project
Computational Linguistics
The interface between phrasal and functional constraints
Computational Linguistics
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Horn extended feature structures: fast unification with negation and limited disjunction
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A logical version of functional grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Inclusion, disjointness and choice: the logic of linguistic classification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Unification with lazy non-redundant copying
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Expressing disjunctive and negative feature constraints with classical first-order logic
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Conditional descriptions in Functional Unification Grammar
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Unification of disjunctive feature descriptions
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
An algorithm for functional uncertainty
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Constituent coordination in Lexical-Functional Grammar
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Semantic abstraction and anaphora
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
First-order logic Davis-Putnam-Logemann-Loveland procedure
Exploring artificial intelligence in the new millennium
| Hi-index | 0.00 |
This paper extends the approach to feature structures developed in Johnson (1991a), which uses Schönfinkel-Bernays' formulae to express feature structure constraints. These are shown to be a disjunctive generalization of Datalog clauses, as used in database theory. This paper provides a fixed-point characterization of the minimal models of these formulae that serves as the theoretical foundation of a forward-chaining algorithm for determining their satisfiability. This algorithm, which generalizes the standard attribute-value unification algorithm, is also recognizable as a nondeterministic variant of the semi-naive bottom-up algorithm for evaluating Datalog programs, further strengthening the connection between the theory of feature structures and databases.