Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Anbulagan, A. - National ICT Australia & Computer Sciences Laboratory, Australian National University
Crossword Puzzles as a Constraint Problem Anbulagan and Adi Botea
Old Resolution Meets Modern SLS , Duc Nghia Pham2
Importance of Variables Semantic in CNF Encoding of Cardinality Constraints NICTA & The Australian National University
Internship Project Proposal Developing a Robust SMT Solver by Understanding
Diagnosis of Discrete-Event Systems Benchmarks Alban Grastien Anbulagan
Multiple Preprocessing for Systematic SAT Solvers , John Slaney1,2
Dynamic Variable Filtering for Hard Random 3-SAT Problems
Incremental Diagnosis of DES with a Non-Exhaustive Diagnosis Engine
Actes JFPC 2008 Importance de la semantique dans
Actes JFPC 2007 Resolution d'un probl`eme de diagnostic de
Adaptive Clause Weight Redistribution Abdelraouf Ishtaiwi1,2
Look-Ahead Versus Look-Back for Satis ability Chu Min Li and Anbulagan
Heuristics Based on Unit Propagation for Satis ability Problems Chu Min Li & Anbulagan
Why a Random 3-SAT Problem is Harder Than Another? Chu Min Li & Anbulagan
Lookahead Saturation with Restriction for SAT and John Slaney1,2
Analysing the Behaviour of Crossword Puzzles Adi Botea and Anbulagan
Incremental Diagnosis of DES by Satisfiability1 Alban Grastien and Anbulagan
Extending Unit Propagation Look-Ahead of DPLL Procedure
September 2004Copyright 2003 National ICT Australia Limited1 Propositional Satisfiability
Trends in Constraint Programming Frdric BENHAMOU
Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms Alban Grastien
Modeling and Solving Diagnosis of Discrete-Event Systems via Satisfiability Alban Grastien
Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to