A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions

Details A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions

2011-08-30

arxiv.org/abs/1108.5794v1

Computer Science

Artificial Intelligence

To appear in the Proceedings of the 25th Workshop on Logic Programming (WLP 2011)

Scientific paper

In order to give appropriate semantics to qualitative conditionals of the form "if A then normally B", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting all conditionals of a knowledge base R can be characterized as the solution of a constraint satisfaction problem. We present a high-level, declarative approach using constraint logic programming techniques for solving this constraint satisfaction problem. In particular, the approach developed here supports the generation of all minimal solutions; these minimal solutions are of special interest as they provide a basis for model-based inference from R.

Affiliated with

Also associated with

No associations

Rating

A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions 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 A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728687