Research experience
-
Jan 1994–
presentResearch: Monash University
Monash University · Caulfield School of Information TechnologyAustralia · Melbourne -
Jan 1991–
Dec 1994Research: Universidad Politécnica de Madrid
Universidad Politécnica de Madrid · Facultad de InformáticaSpain · Madrid
Publications (78) View all
-
Article: Redundant Sudoku Rules
Bart Demoen, Maria Garcia de la Banda[show abstract] [hide abstract]
ABSTRACT: The rules of Sudoku are often specified using twenty seven \texttt{all\_different} constraints, referred to as the {\em big} \mrules. Using graphical proofs and exploratory logic programming, the following main and new result is obtained: many subsets of six of these big \mrules are redundant (i.e., they are entailed by the remaining twenty one \mrules), and six is maximal (i.e., removing more than six \mrules is not possible while maintaining equivalence). The corresponding result for binary inequality constraints, referred to as the {\em small} \mrules, is stated as a conjecture.07/2012; -
SourceAvailable from: PubMed Central
Article: Super: a web server to rapidly screen superposable oligopeptide fragments from the protein data bank.
[show abstract] [hide abstract]
ABSTRACT: Searching for well-fitting 3D oligopeptide fragments within a large collection of protein structures is an important task central to many analyses involving protein structures. This article reports a new web server, Super, dedicated to the task of rapidly screening the protein data bank (PDB) to identify all fragments that superpose with a query under a prespecified threshold of root-mean-square deviation (RMSD). Super relies on efficiently computing a mathematical bound on the commonly used structural similarity measure, RMSD of superposition. This allows the server to filter out a large proportion of fragments that are unrelated to the query; >99% of the total number of fragments in some cases. For a typical query, Super scans the current PDB containing over 80,500 structures (with ∼40 million potential oligopeptide fragments to match) in under a minute. Super web server is freely accessible from: http://lcb.infotech.monash.edu.au/super.Nucleic Acids Research 05/2012; 40(Web Server issue):W334-9. · 8.03 Impact Factor -
Article: Exploiting subproblem dominance in constraint programming.
Geoffrey Chu, Maria Garcia de la Banda, Peter J. StuckeyConstraints. 01/2012; 17:1-38. -
SourceAvailable from: dtai.cs.kuleuven.be
Article: Introduction to the 24th international conference on logic programming special issue.
Maria Garcia de la Banda, Enrico PontelliTPLP. 01/2011; 11:131-133. -
Conference Proceeding: Symmetries and Lazy Clause Generation.
IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011; 01/2011