Sciweavers

595 search results - page 33 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
104
Voted
CORR
1998
Springer
107views Education» more  CORR 1998»
15 years 2 months ago
Computing Declarative Prosodic Morphology
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
Markus Walther
150
Voted
NCA
2007
IEEE
15 years 9 months ago
FRAC: Implementing Role-Based Access Control for Network File Systems
We present FRAC, a Framework for Role-based Access Control in network file systems. FRAC is a reference monitor that controls the message flow between file system clients and s...
Aniruddha Bohra, Stephen Smaldone, Liviu Iftode
222
Voted
ICLP
2009
Springer
16 years 3 months ago
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
Neng-Fa Zhou
KR
2000
Springer
15 years 6 months ago
Reduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
Fabio Massacci
118
Voted
AI
2011
Springer
14 years 9 months ago
The extended global cardinality constraint: An empirical survey
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contai...
Peter Nightingale