Constraint Propagation for First-Order Logic and Inductive Definitions

Details Constraint Propagation for First-Order Logic and Inductive Definitions Constraint Propagation for First-Order Logic and Inductive Definitions

2010-08-12

arxiv.org/abs/1008.2121v2

Computer Science

Logic in Computer Science

43 pages, 1 figure submitted to ACM Transactions on Computational Logic

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Constraint Propagation for First-Order Logic and Inductive Definitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constraint Propagation for First-Order Logic and Inductive Definitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint Propagation for First-Order Logic and Inductive Definitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587367