Anbulagan

Affiliations:
  • Australian National University, Acton, USA


According to our database1, Anbulagan authored at least 15 papers between 1997 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study.
IEEE Trans. Autom. Control., 2013

2010
Diagnostic de systèmes à événements discrets à base de cohérence par SAT.
Rev. d'Intelligence Artif., 2010

2009
Importance of Variables Semantic in CNF Encoding of Cardinality Constraints.
Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness.
Proceedings of the ICTAI 2009, 2009

2008
Incremental Diagnosis of DES by Satisfiability.
Proceedings of the ECAI 2008, 2008

Crossword Puzzles as a Constraint Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT.
Proceedings of the AI 2007: Advances in Artificial Intelligence, 2007

Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Adaptive Clause Weight Redistribution.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Lookahead Saturation with Restriction for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Old Resolution Meets Modern SLS.
Proceedings of the Proceedings, 2005

2004
Extending Unit Propagation Look-Ahead of DPLL Procedure.
Proceedings of the PRICAI 2004: Trends in Artificial Intelligence, 2004

2003
Dynamic Variable Filtering for Hard Random 3-SAT Problems.
Proceedings of the AI 2003: Advances in Artificial Intelligence, 2003

1997
Heuristics Based on Unit Propagation for Satisfiability Problems.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Look-Ahead Versus Look-Back for Satisfiability Problems.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997


  Loading...