A feature constraint system for logic programming with entailment
From MaRDI portal
Publication:1314426
DOI10.1016/0304-3975(94)90209-7zbMath0801.68023OpenAlexW1900652794MaRDI QIDQ1314426
Andreas Podelski, Hassan Aït-Kaci, Gert Smolka
Publication date: 29 November 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90209-7
treesalgebraic semanticslogic programmingentailmentconstraint systemnegative constraintsunsatisfiabilityuniversal data structure
Related Items (17)
A rational reconstruction of the domain of feature structures ⋮ Combination of constraint solvers for free and quasi-free structures ⋮ A new generic scheme for functional logic programming with constraints ⋮ A foundation for higher-order concurrent constraint programming ⋮ Situated simplification ⋮ Constructing infinitary quotient-inductive types ⋮ A complete and recursive feature theory ⋮ An improved lower bound for the elementary theories of trees ⋮ Anti-patterns for rule-based languages ⋮ Set constraints with intersection ⋮ Theories with the independence property ⋮ A declarative framework for object-oriented programming with genetic inheritance ⋮ Combination of constraint systems II: Rational amalgamation ⋮ How to win a game with features ⋮ How to win a game with features ⋮ Ordering constraints over feature trees expressed in second-order monadic logic. ⋮ Distributive ρ-calculus
Cites Work
- An algebraic semantics approach to the effective resolution of type equations
- Inheritance hierarchies: Semantics and unifications
- Login: a logic programming language with built-in inheritance
- Feature-constraint logics for unification grammars
- The Logic of Typed Feature Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A feature constraint system for logic programming with entailment