Sciweavers

7557 search results - page 465 / 1512
» Constraints as a design pattern
Sort
View
CINQ
2004
Springer
119views Database» more  CINQ 2004»
16 years 14 days ago
How to Quickly Find a Witness
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
Daniel Kifer, Johannes Gehrke, Cristian Bucila, Wa...
IPPS
2000
IEEE
15 years 11 months ago
Are COTS Suitable for Building Distributed Fault-Tolerant Hard Real-Time Systems?
For economic reasons, a new trend in the development of distributed hard real-time systems is to rely on the use of CommercialO -The-Shelf cots hardware and operating systems. As...
Pascal Chevochot, Antoine Colin, David Decotigny, ...
183
Voted
CADE
2006
Springer
15 years 10 months ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez
ICML
1994
IEEE
15 years 10 months ago
Revision of Production System Rule-Bases
We describe CLIPS-R, a theory revision system for the revision of CLIPS rule-bases. CLIPS-R differs from previous theory revision systems in that it operates on forward chaining p...
Patrick M. Murphy, Michael J. Pazzani
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher