Sciweavers

714 search results - page 114 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CP
2000
Springer
14 years 2 months ago
Extending Forward Checking
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
Fahiem Bacchus
KBS
2007
103views more  KBS 2007»
13 years 9 months ago
A reusable commitment management service using Semantic Web technology
Commitment management is a key issue in service-provisioning in the context of virtual organisations (VOs). A service-provider — which may be a single agent acting within an orga...
Alun D. Preece, Stuart Chalmers, Craig McKenzie
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