作者: Johan Wittocx , Marc Denecker , Maurice Bruynooghe
DOI:
关键词:
摘要: Constraint propagation is one of the basic forms inference in many logic-based reasoning systems. In this paper, we investigate constraint for first-order logic (FO), a suitable language to express wide variety constraints. We present an algorithm with polynomial-time data complexity context FO theory and finite structure. show that manner can be represented by datalog program executed symbolically, i.e., independently Next, extend FO(ID), extension inductive definitions. Finally, discuss several applications.