Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

ICTAI
1996
IEEE

favoriteEmaildiscussreport

139views Artificial Intelligence» more ICTAI 1996»

Binary CSP Solving as an Inference Process

13 years 8 months ago

Binary CSP Solving as an Inference Process

Download reference.kfupm.edu.sa

We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving Binary CSP once they are expressed as rewriting rules coordinated by strategies.

Carlos Castro

Real-time Traffic

Artificial Intelligence | Constraint Solving | Deduction Rules | ICTAI 1996 | Rule-based Approach |

claim paper

Related Content

» Understanding and Extending Graphplan

» Constraintbased reasoning and privacyefficiency tradeoffs in multiagent problem solving

» Exploiting automatically inferred constraintmodels for building identification in satellit...

» Conservative Dual Consistency

» MultiClass Confidence Weighted Algorithms

» An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1996
Where	ICTAI
Authors	Carlos Castro

Comments (0)