Sciweavers

749 search results - page 120 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
PODS
1999
ACM
95views Database» more  PODS 1999»
14 years 2 months ago
Minimal Data Upgrading to Prevent Inference and Association
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
Steven Dawson, Sabrina De Capitani di Vimercati, P...
CP
2006
Springer
14 years 1 months ago
Interactive Distributed Configuration
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
Peter Tiedemann, Tarik Hadzic, Thomas Stuart Henne...
ILP
2004
Springer
14 years 3 months ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi
ECAI
1992
Springer
14 years 1 months ago
Arc-Consistency for Non-Binary Dynamic CSPs
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
Christian Bessière
IJCAI
2003
13 years 11 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings