Look-Ahead Versus Look-Back for Satisfiability Problems. - Chu Min Li 001; Anbulagan (CP, 1997)

Heuristics Based on Unit Propagation for Satisfiability Problems. - Chu Min Li 001; Anbulagan (IJCAI (1), 1997)

Dynamic Variable Filtering for Hard Random 3-SAT Problems. - Anbulagan; John Thornton 001; Abdul Sattar 001 (Australian Conference on Artificial Intelligence, 2003)

Extending Unit Propagation Look-Ahead of DPLL Procedure. - Anbulagan (PRICAI, 2004)

Old Resolution Meets Modern SLS. - Anbulagan; Duc Nghia Pham; John K. Slaney; Abdul Sattar 001 (AAAI, 2005)

Lookahead Saturation with Restriction for SAT. - Anbulagan; John K. Slaney (CP, 2005)

Adaptive Clause Weight Redistribution. - Abdelraouf Ishtaiwi; John Thornton 001; Anbulagan; Abdul Sattar 001; Duc Nghia Pham (CP, 2006)

Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms. - Alban Grastien; Anbulagan; Jussi Rintanen; Elena Kelareva (AAAI, 2007)

Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT. - Louise Leenen; Anbulagan; Thomas Meyer 002; Aditya K. Ghose (Australian Conference on Artificial Intelligence, 2007)

Crossword Puzzles as a Constraint Problem. - Anbulagan; Adi Botea (CP, 2008)

Incremental Diagnosis of DES by Satisfiability. - Alban Grastien; Anbulagan (ECAI, 2008)

Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness. - Anbulagan; John K. Slaney (ICTAI, 2009)

Importance of Variables Semantic in CNF Encoding of Cardinality Constraints. - Anbulagan; Alban Grastien (SARA, 2009)

Diagnostic de systèmes à événements discrets à base de cohérence par SAT. - Alban Grastien; Anbulagan (Rev. d'Intelligence Artif., 2010)

Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study. - Alban Grastien; Anbulagan (IEEE Trans. Autom. Control., 2013)