A First Practical Algorithm for High Levels of Relational Consistency

Authors

• Shant Karakashian, University of Nebraska-LincolnFollow
• Robert J. Woodward, University of Nebraska-LincolnFollow
• Christopher Reeson, University of Nebraska-LincolnFollow
• Berthe Y. Choueiry, University of Nebraska-LincolnFollow
• Christian Bessiere, University of Montpellier, FranceFollow

Date of this Version

2010

Document Type

Article

Comments

Karakashian, Woodward, Reeson, Choueiry & Bessiere in 24th AAAI Conference on Artificial Intelligence (AAAI '10). Pages 101-107. Copyright 2010, AAAI. Used by permission.

Abstract

•Introduction

•Relational Consistency R(*,m)C :

–Definition, Naïve algorithm, Properties

•Preliminaries: Dual CSP

•Our Approach

–Algorithm

–Index-Tree Data Structure

–Advantages

•A weakened version of R(*,m)C: wR(*,m)C

•Experimental Evaluations

•Conclusions & Future Work