Search

Your search keyword '"Saïs, Lakhdar"' showing total 230 results
Start Over Author "Saïs, Lakhdar"

Refine your results

more »

more »

more »

more »
230 results on '"Saïs, Lakhdar"'

2. Extracting Frequent Gradual Patterns Using Constraints Modeling

Author

Lonlac, Jerry, Jabbour, Saïdd, Nguifo, Engelbert Mephu, Saïs, Lakhdar, and Raddaoui, Badran

Subjects
Computer Science - Artificial Intelligence
Abstract

In this paper, we propose a constraint-based modeling approach for the problem of discovering frequent gradual patterns in a numerical dataset. This SAT-based declarative approach offers an additional possibility to benefit from the recent progress in satisfiability testing and to exploit the efficiency of modern SAT solvers for enumerating all frequent gradual patterns in a numerical dataset. Our approach can easily be extended with extra constraints, such as temporal constraints in order to extract more specific patterns in a broad range of gradual patterns mining applications. We show the practical feasibility of our SAT model by running experiments on two real world datasets.

Published
2019

3. Efficient Encodings of Conditional Cardinality Constraints

Author

Boudane, Abdelhamid, Jabbour, Said, Raddaoui, Badran, and Sais, Lakhdar

Subjects
Computer Science - Artificial Intelligence
Abstract

In the encoding of many real-world problems to propositional satisfiability, the cardinality constraint is a recurrent constraint that needs to be managed effectively. Several efficient encodings have been proposed while missing that such a constraint can be involved in a more general propositional formulation. To avoid combinatorial explosion, Tseitin principle usually used to translate such general propositional formula to Conjunctive Normal Form (CNF), introduces fresh propositional variables to represent sub-formulas and/or complex contraints. Thanks to Plaisted and Greenbaum improvement, the polarity of the sub-formula $\Phi$ is taken into account leading to conditional constraints of the form $y\rightarrow \Phi$, or $\Phi\rightarrow y$, where $y$ is a fresh propositional variable. In the case where $\Phi$ represents a cardinality constraint, such translation leads to conditional cardinality constraints subject of the present paper. We first show that when all the clauses encoding the cardinality constraint are augmented with an additional new variable, most of the well-known encodings cease to maintain the generalized arc consistency property. Then, we consider some of these encodings and show how they can be extended to recover such important property. An experimental validation is conducted on a SAT-based pattern mining application, where such conditional cardinality constraints is a cornerstone, showing the relevance of our proposed approach.

Published
2018

4. Towards a Compact SAT-Based Encoding of Itemset Mining Tasks

Author

Nekkache, Ikram, Jabbour, Said, Sais, Lakhdar, Kamel, Nadjet, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Stuckey, Peter J., editor

Published
2021
Full Text
View/download PDF

6. On SAT Models Enumeration in Itemset Mining

Author

Jabbour, Said, Sais, Lakhdar, and Salhi, Yakoub

Subjects
Computer Science - Artificial Intelligence
Abstract

Frequent itemset mining is an essential part of data analysis and data mining. Recent works propose interesting SAT-based encodings for the problem of discovering frequent itemsets. Our aim in this work is to define strategies for adapting SAT solvers to such encodings in order to improve models enumeration. In this context, we deeply study the effects of restart, branching heuristics and clauses learning. We then conduct an experimental evaluation on SAT-Based itemset mining instances to show how SAT solvers can be adapted to obtain an efficient SAT model enumerator.

Published
2015

7. On the measure of conflicts: A MUS-Decomposition Based Framework

Author

Jabbour, Said, Ma, Yue, Raddaoui, Badran, Sais, Lakhdar, and Salhi, Yakoub

Subjects
Computer Science - Artificial Intelligence
Abstract

Measuring inconsistency is viewed as an important issue related to handling inconsistencies. Good measures are supposed to satisfy a set of rational properties. However, defining sound properties is sometimes problematic. In this paper, we emphasize one such property, named Decomposability, rarely discussed in the literature due to its modeling difficulties. To this end, we propose an independent decomposition which is more intuitive than existing proposals. To analyze inconsistency in a more fine-grained way, we introduce a graph representation of a knowledge base and various MUSdecompositions. One particular MUS-decomposition, named distributable MUS-decomposition leads to an interesting partition of inconsistencies in a knowledge base such that multiple experts can check inconsistencies in parallel, which is impossible under existing measures. Such particular MUSdecomposition results in an inconsistency measure that satisfies a number of desired properties. Moreover, we give an upper bound complexity of the measure that can be computed using 0/1 linear programming or Min Cost Satisfiability problems, and conduct preliminary experiments to show its feasibility.

Published
2014

8. Revisiting the Learned Clauses Database Reduction Strategies

Author

Jabbour, Said, Lonlac, Jerry, Sais, Lakhdar, and Salhi, Yakoub

Subjects
Computer Science - Artificial Intelligence
Abstract

In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies. Our motivation takes its source from a simple observation on the remarkable performances of both random and size-bounded reduction strategies. We first derive a simple reduction strategy, called Size-Bounded Randomized strategy (in short SBR), that combines maintaing short clauses (of size bounded by k), while deleting randomly clauses of size greater than k. The resulting strategy outperform the state-of-the-art, namely the LBD based one, on SAT instances taken from the last SAT competition. Reinforced by the interest of keeping short clauses, we propose several new dynamic variants, and we discuss their performances.

Published
2014

9. A Mining-Based Compression Approach for Constraint Satisfaction Problems

Author

Jabbour, Said, Sais, Lakhdar, and Salhi, Yakoub

Subjects
Computer Science - Artificial Intelligence
Abstract

In this paper, we propose an extension of our Mining for SAT framework to Constraint satisfaction Problem (CSP). We consider n-ary extensional constraints (table constraints). Our approach aims to reduce the size of the CSP by exploiting the structure of the constraints graph and of its associated microstructure. More precisely, we apply itemset mining techniques to search for closed frequent itemsets on these two representation. Using Tseitin extension, we rewrite the whole CSP to another compressed CSP equivalent with respect to satisfiability. Our approach contrast with previous proposed approach by Katsirelos and Walsh, as we do not change the structure of the constraints., Comment: arXiv admin note: substantial text overlap with arXiv:1304.4415

Published
2013

10. Extending Modern SAT Solvers for Enumerating All Models

Author

Jabbour, Said, Sais, Lakhdar, and Salhi, Yakoub

Subjects
Computer Science - Artificial Intelligence
Abstract

In this paper, we address the problem of enumerating all models of a Boolean formula in conjunctive normal form (CNF). We propose an extension of CDCL-based SAT solvers to deal with this fundamental problem. Then, we provide an experimental evaluation of our proposed SAT model enumeration algorithms on both satisfiable SAT instances taken from the last SAT challenge and on instances from the SAT-based encoding of sequence mining problems., Comment: This paper is withdrawn by the authors due to a missing reference. The authors work further on this issue and conduct exhaustive experimental comparison with other related works

Published
2013

11. Mining to Compact CNF Propositional Formulae

Author

Jabbour, Said, Sais, Lakhdar, and Salhi, Yakoub

Subjects
Computer Science - Artificial Intelligence
Abstract

In this paper, we propose a first application of data mining techniques to propositional satisfiability. Our proposed Mining4SAT approach aims to discover and to exploit hidden structural knowledge for reducing the size of propositional formulae in conjunctive normal form (CNF). Mining4SAT combines both frequent itemset mining techniques and Tseitin's encoding for a compact representation of CNF formulae. The experiments of our Mining4SAT approach show interesting reductions of the sizes of many application instances taken from the last SAT competitions.

Published
2013

12. On Maximal Frequent Itemsets Enumeration

Author

Jabbour, Said, Mana, Fatima Zahra, Sais, Lakhdar, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Abraham, Ajith, editor, Haqiq, Abdelkrim, editor, Muda, Azah Kamilah, editor, and Gandhi, Niketa, editor

Published
2018
Full Text
View/download PDF

13. On Maximal Frequent Itemsets Mining with Constraints

Author

Jabbour, Said, Mana, Fatima Ezzahra, Dlala, Imen Ouled, Raddaoui, Badran, Sais, Lakhdar, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, and Hooker, John, editor

Published
2018
Full Text
View/download PDF

14. A Parallel SAT-Based Framework for Closed Frequent Itemsets Mining

Author

Dlala, Imen Ouled, Jabbour, Said, Raddaoui, Badran, Sais, Lakhdar, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, and Hooker, John, editor

Published
2018
Full Text
View/download PDF

15. Pushing the Envelope in Overlapping Communities Detection

Author

Jabbour, Said, Mhadhbi, Nizar, Raddaoui, Badran, Sais, Lakhdar, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Duivesteijn, Wouter, editor, Siebes, Arno, editor, and Ukkonen, Antti, editor

Published
2018
Full Text
View/download PDF

16. On the Complexity of Computing Minimal Unsatisfiable LTL formulas

Author

Hantry, Francois, Saïs, Lakhdar, and Hacid, Mohand-Saïd

Subjects
Computer Science - Logic in Computer Science
Abstract

We show that (1) the Minimal False QCNF search-problem (MF-search) and the Minimal Unsatisfiable LTL formula search problem (MU-search) are FPSPACE complete because of the very expressive power of QBF/LTL, (2) we extend the PSPACE-hardness of the MF decision problem to the MU decision problem. As a consequence, we deduce a positive answer to the open question of PSPACE hardness of the inherent Vacuity Checking problem. We even show that the Inherent Non Vacuous formula search problem is also FPSPACE-complete., Comment: Minimal unsatisfiable cores For LTL causes inherent vacuity checking redundancy coverage

Published
2012

17. Integrating Conflict Driven Clause Learning to Local Search

Author

Audenard, Gilles, Lagniez, Jean-Marie, Mazure, Bertrand, and Saïs, Lakhdar

Subjects
Computer Science - Artificial Intelligence
Abstract

This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL) scheme. Each time the local search part reaches a local minimum, the CDCL is launched. For SAT problems it behaves like a tabu list, whereas for UNSAT ones, the CDCL part tries to focus on minimum unsatisfiable sub-formula (MUS). Experimental results show good performances on many classes of SAT instances from the last SAT competitions.

Published
2009
Full Text
View/download PDF

18. Learning for Dynamic subsumption

Author

Hamadi, Youssef, Jabbour, Said, and Sais, Lakhdar

Subjects
Computer Science - Artificial Intelligence
Abstract

In this paper a new dynamic subsumption technique for Boolean CNF formulae is proposed. It exploits simple and sufficient conditions to detect during conflict analysis, clauses from the original formula that can be reduced by subsumption. During the learnt clause derivation, and at each step of the resolution process, we simply check for backward subsumption between the current resolvent and clauses from the original formula and encoded in the implication graph. Our approach give rise to a strong and dynamic simplification technique that exploits learning to eliminate literals from the original clauses. Experimental results show that the integration of our dynamic subsumption approach within the state-of-the-art SAT solvers Minisat and Rsat achieves interesting improvements particularly on crafted instances.

Published
2009

19. A SAT-Based Framework for Overlapping Community Detection in Networks

Author

Jabbour, Said, Mhadhbi, Nizar, Raddaoui, Badran, Sais, Lakhdar, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Kim, Jinho, editor, Shim, Kyuseok, editor, Cao, Longbing, editor, Lee, Jae-Gil, editor, Lin, Xuemin, editor, and Moon, Yang-Sae, editor

Published
2017
Full Text
View/download PDF

20. Clustering Complex Data Represented as Propositional Formulas

Author

Boudane, Abdelhamid, Jabbour, Said, Sais, Lakhdar, Salhi, Yakoub, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Kim, Jinho, editor, Shim, Kyuseok, editor, Cao, Longbing, editor, Lee, Jae-Gil, editor, Lin, Xuemin, editor, and Moon, Yang-Sae, editor

Published
2017
Full Text
View/download PDF

21. Enumerating Non-redundant Association Rules Using Satisfiability

Author

Boudane, Abdelhamid, Jabbour, Said, Sais, Lakhdar, Salhi, Yakoub, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Kim, Jinho, editor, Shim, Kyuseok, editor, Cao, Longbing, editor, Lee, Jae-Gil, editor, Lin, Xuemin, editor, and Moon, Yang-Sae, editor

Published
2017
Full Text
View/download PDF

27. A Generic and Declarative Method for Symmetry Breaking in Itemset Mining

Author

Benhamou, Belaïd, Jabbour, Saïd, Sais, Lakhdar, Salhi, Yacoub, Diniz Junqueira Barbosa, Simone, Series editor, Chen, Phoebe, Series editor, Du, Xiaoyong, Series editor, Filipe, Joaquim, Series editor, Kara, Orhun, Series editor, Kotenko, Igor, Series editor, Liu, Ting, Series editor, Sivalingam, Krishna M., Series editor, Washio, Takashi, Series editor, Fred, Ana, editor, Dietz, Jan L. G., editor, Aveiro, David, editor, and Liu, Kecheng, editor

Published
2015
Full Text
View/download PDF

28. Decomposition Based SAT Encodings for Itemset Mining Problems

Author

Jabbour, Said, Sais, Lakhdar, Salhi, Yakoub, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Cao, Tru, editor, Lim, Ee-Peng, editor, Zhou, Zhi-Hua, editor, Ho, Tu-Bao, editor, Cheung, David, editor, and Motoda, Hiroshi, editor

Published
2015
Full Text
View/download PDF

29. Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form

Author

Jabbour, Said, Marques-Silva, Joao, Sais, Lakhdar, Salhi, Yakoub, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, Series editor, Tanaka, Yuzuru, Series editor, Wahlster, Wolfgang, Series editor, Siekmann, Jörg, Series editor, Fermé, Eduardo, editor, and Leite, João, editor

Published
2014
Full Text
View/download PDF

32. The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem

Author

Jabbour, Said, Sais, Lakhdar, Salhi, Yakoub, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Blockeel, Hendrik, editor, Kersting, Kristian, editor, Nijssen, Siegfried, editor, and Železný, Filip, editor

Published
2013
Full Text
View/download PDF

33. On Freezing and Reactivating Learnt Clauses

Author

Audemard, Gilles, Lagniez, Jean-Marie, Mazure, Bertrand, Saïs, Lakhdar, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Sakallah, Karem A., editor, and Simon, Laurent, editor

Published
2011
Full Text
View/download PDF

34. Boosting Local Search Thanks to cdcl

Author

Audemard, Gilles, Lagniez, Jean-Marie, Mazure, Bertrand, Saïs, Lakhdar, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Fermüller, Christian G., editor, and Voronkov, Andrei, editor

Published
2010
Full Text
View/download PDF

35. Diversification and Intensification in Parallel SAT Solving

Author

Guo, Long, Hamadi, Youssef, Jabbour, Said, Sais, Lakhdar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Cohen, David, editor

Published
2010
Full Text
View/download PDF

36. Segmentation of 3D Brain Structures Using the Bayesian Generalized Fast Marching Method

Author

Baghdadi, Mohamed, Benamrane, Nacéra, Sais, Lakhdar, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Yao, Yiyu, editor, Sun, Ron, editor, Poggio, Tomaso, editor, Liu, Jiming, editor, Zhong, Ning, editor, and Huang, Jimmy, editor

Published
2010
Full Text
View/download PDF

37. Efficient Combination of Decision Procedures for MUS Computation

Author

Piette, Cédric, Hamadi, Youssef, Saïs, Lakhdar, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Ghilardi, Silvio, editor, and Sebastiani, Roberto, editor

Published
2009
Full Text
View/download PDF

39. Circuit Based Encoding of CNF Formula

Author

Audemard, Gilles, Saïs, Lakhdar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Marques-Silva, João, editor, and Sakallah, Karem A., editor

Published
2007
Full Text
View/download PDF

40. Eliminating Redundant Clauses in SAT Instances

Author

Fourdrinoy, Olivier, Grégoire, Éric, Mazure, Bertrand, Saïs, Lakhdar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Van Hentenryck, Pascal, editor, and Wolsey, Laurence, editor

Published
2007
Full Text
View/download PDF

42. Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance

Author

Lecoutre, Christophe, Sais, Lakhdar, Tabary, Sébastien, Vidal, Vincent, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Bessière, Christian, editor

Published
2007
Full Text
View/download PDF

44. A Symbolic Search Based Approach for Quantified Boolean Formulas

Author

Audemard, Gilles, Saïs, Lakhdar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bacchus, Fahiem, editor, and Walsh, Toby, editor

Published
2005
Full Text
View/download PDF

45. Automatic Extraction of Functional Dependencies

Author

Grégoire, Éric, Ostrowski, Richard, Mazure, Bertrand, Saïs, Lakhdar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hoos, Holger H., editor, and Mitchell, David G., editor

Published
2005
Full Text
View/download PDF

46. Support Inference for Generic Filtering

Author

Boussemart, Frederic, Hemery, Fred, Lecoutre, Christophe, Sais, Lakhdar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Wallace, Mark, editor

Published
2004
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results