登入選單
返回Google圖書搜尋
A Feature Constraint System for Logic Programming with Entailment
註釋Abstract: "We introduce a constraint system called FT. This system offers a theoretical and practical alternative to the usual Herbrand system of constraints over constructor trees. Like Herbrand, FT provides a universal data structure based on trees. However, the trees of FT(called feature trees) are more general than the constructor trees of Herbrand, and the constraints of FT are of finer grain and of different expressiveness. The essential novelty of FT is provided by functional attributes called features which allow representing data as extensible records, a more flexible way than that offered by Herbrand's fixed arity constructors. The feature tree structure determines an algebraic semantics for FT. We establish a logical semantics thanks to three axiom schemes presenting the first-order theory FT