FO(FD): Extending classical logic with rule-based fixpoint definitions

Details FO(FD): Extending classical logic with rule-based fixpoint definitions FO(FD): Extending classical logic with rule-based fixpoint definitions

2010-07-22

arxiv.org/abs/1007.3819v1

Theory and Practice of Logic Programming, Volume 10, Special Issue 4-6, July 2010, pp 581-596

Computer Science

Logic in Computer Science

Presented at ICLP 2010. 16 pages, 1 figure

Scientific paper

10.1017/S1471068410000293

We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. We illustrate the relation between FO(FD) and FO(ID), which is developed as an integration of two knowledge representation paradigms. The satisfiability problem for FO(FD) is investigated by first reducing FO(FD) to difference logic and then using solvers for difference logic. These reductions are evaluated in the computation of models for FO(FD) theories representing fairness conditions and we provide potential applications of FO(FD).

Affiliated with

Also associated with

No associations

Rating

FO(FD): Extending classical logic with rule-based fixpoint 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 FO(FD): Extending classical logic with rule-based fixpoint definitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and FO(FD): Extending classical logic with rule-based fixpoint definitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611222