default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnbulagan
Person information
- affiliation: Australian National University, Acton, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j2]Alban Grastien, Anbulagan:
Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study. IEEE Trans. Autom. Control. 58(12): 3070-3083 (2013)- 2010
- [j1]Alban Grastien, Anbulagan:
Diagnostic de systèmes à événements discrets à base de cohérence par SAT. Rev. d'Intelligence Artif. 24(6): 757-786 (2010)
2000 – 2009
- 2009
- [c13]Anbulagan, John K. Slaney
:
Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness. ICTAI 2009: 99-106 - [c12]Anbulagan, Alban Grastien:
Importance of Variables Semantic in CNF Encoding of Cardinality Constraints. SARA 2009 - 2008
- [c11]Anbulagan, Adi Botea:
Crossword Puzzles as a Constraint Problem. CP 2008: 550-554 - [c10]Alban Grastien, Anbulagan:
Incremental Diagnosis of DES by Satisfiability. ECAI 2008: 787-788 - 2007
- [c9]Alban Grastien, Anbulagan, Jussi Rintanen, Elena Kelareva:
Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms. AAAI 2007: 305-310 - [c8]Louise Leenen, Anbulagan, Thomas Meyer, Aditya K. Ghose:
Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT. Australian Conference on Artificial Intelligence 2007: 202-212 - 2006
- [c7]Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abdul Sattar, Duc Nghia Pham:
Adaptive Clause Weight Redistribution. CP 2006: 229-243 - 2005
- [c6]Anbulagan, Duc Nghia Pham, John K. Slaney, Abdul Sattar:
Old Resolution Meets Modern SLS. AAAI 2005: 354-359 - [c5]Anbulagan, John K. Slaney:
Lookahead Saturation with Restriction for SAT. CP 2005: 727-731 - 2004
- [c4]Anbulagan:
Extending Unit Propagation Look-Ahead of DPLL Procedure. PRICAI 2004: 173-182 - 2003
- [c3]Anbulagan, John Thornton, Abdul Sattar:
Dynamic Variable Filtering for Hard Random 3-SAT Problems. Australian Conference on Artificial Intelligence 2003: 100-111
1990 – 1999
- 1997
- [c2]Chu Min Li, Anbulagan:
Look-Ahead Versus Look-Back for Satisfiability Problems. CP 1997: 341-355 - [c1]Chu Min Li, Anbulagan:
Heuristics Based on Unit Propagation for Satisfiability Problems. IJCAI (1) 1997: 366-371
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
