A feature constraint system for logic programming with entailment

DOI10.1016/0304-3975(94)90209-7zbMath0801.68023MaRDI QIDQ1314426

Andreas Podelski, Gert Smolka, Hassan Aït-Kaci

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

zbMATH Keywords

trees; algebraic semantics; logic programming; entailment; constraint system; negative constraints; unsatisfiability; universal data structure

Mathematics Subject Classification ID

68Q65: Abstract data types; algebraic specification

68N17: Logic programming

Related Items

A declarative framework for object-oriented programming with genetic inheritance, Combination of constraint systems II: Rational amalgamation, A complete and recursive feature theory, A new generic scheme for functional logic programming with constraints, Combination of constraint solvers for free and quasi-free structures, How to win a game with features, Situated simplification, Ordering constraints over feature trees expressed in second-order monadic logic., A rational reconstruction of the domain of feature structures, Set constraints with intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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