Representation and Computation Using First-order Logical Constraints

摘要

The concept of logic programs that consist of only (simple) definite clauses has been extended to include negative atoms and arbitrary first-order formulas in the body of definite clauses, hence increasing their expressive power. However, computation of first-order expressions has some limitations in terms of flexibility, efficiency and correctness. This paper adopts the Equivalent Transformation (ET) paradigm to overcome the difficulties faced by logic programs. First-order logical constraints, which comprise basic constraints and logical symbols, are introduced. The existing class of declarative descriptions is then extended, and a new framework for representation and computation of first-order expressions is constructed. Four sample problems are employed to demonstrate the usefulness of problem solving by equivalent transformation of first-order logical constraints.