Find out how ICT can support biomedical and clinical researchFind out more. From Clever cars to clever farms... Embedded Systems
G12-Publications

G12 related publications by project members

  • 3 Books
  • 3 Book Chapters
  • 14 Journal Articles
  • 60 Conference Publications



Books


Handbook of Constraint Programming. Francesca Rossi, Peter van Beek, and Toby Walsh (Editors).  Foundations of Artificial Intelligence series. Elsevier 2006.  ISBN 0-444-52726-5, 978 pages


SAT-2005: satisfiability research in the year 2005.  Enrico Giunchiglia and Toby Walsh (Editors) General Computer Science series, Springer 2006.

Annalisa Bossi and Michael J. Maher, Principles and Practice of Declarative Programming, ACM Press, 2006.



Book Chapters


K. Marriott, P.J. Stuckey, and M. Wallace. Constraint Logic Programming.
Handbook of Constraint Programming, pages 409-452. Elsevier, 2006.

P. Kilby and P. Shaw. Vehicle routing. In Handbook of Constraint Programming, Foundations of Artificial Intelligence, pages 801-836, 2006.

  Anbulagan, Duc Nghia Pham, John Slaney and Abdul Sattar
Boosting SLS Using Resolution.
in Frederic Benhamou, Narendra Jussien and Barry O'Sullivan (Editors), Trends in Constraint Programming,
chapter 17, pages 283-289, ISTE, May 2007, ISBN 9781905209972.

 


Journals

The Complexity of Global Constraints
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. Constraints, 12 (2), 2007.

Filtering algorithms for the NVALUE constraint
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, and
Toby Walsh. Constraints, 11 (4), 271-293, 2006

Propagation algorithms for lexicographic ordering constraint.  Alan Frisch,
Brahim Hnich, Zeynep Kiziltan, Ian Miguel and Toby Walsh. Artificial
Intelligence, 170 (10), 803-908, 2006.

Hard and soft constraints for reasoning about qualitative conditional
preferences.  Carmel Domshlak, Steve Prestwich, Francesca Rossi, Kristen
Brent Venable and Toby Walsh. Journal of Heuristics, 12 (2-5), 263-285,
2006.

Stochastic Constraint Programming: A Scenario-Based Approach.  S. Armagan
Tarim, Suresh Manandhar, and Toby Walsh. Constraints, 11 (1), 53-81, 2006.

A. Konagurthu, J. Whisstock, P.J. Stuckey, and A. Lesk. MUSTANG: A multiple
structural alignment algorithm. Proteins: Structure, Function and
Bioinformatics, 64(3):559-574, August 2006.

A. Konagurthu and P.J. Stuckey. Optimal sum-of-pairs multiple sequence
alignment using incremental Carrillo-and-Lipman bounds. Journal of
Computational Biology, 13(3):668-685, 2006.

T. Schrijvers, B. Demoen, G.J. Duck, P.J. Stuckey, and T. Frue-
hwirth. Automatic implication checking for CHR constraints. Elec- tronic
Notes in Theoretical Computer Science, 147:93-111, January 2006.
http://www.sciencedirect.com/science/journal/15710661.

C. Schulte and P.J. Stuckey. When do bounds and domain propagation lead to
the same search space. ACM Transactions on Programming Languages and
Systems, 27(3):388-425, 2005.

C. Holzbaur, M. Garcia de la Banda, P.J. Stuckey, and G. Duck. Optimizing
compilation of constraint handling rules in HAL.  Theory and Practice of
Logic Programming, 5(4-):503-532, 2005.

P. Hawkins, V. Lagoon, and P.J. Stuckey. Solving set constraint satisfaction
problems using ROBDDs. Journal of Artificial Intelligence Research,
24:106-156, 2005.

P. Baumgartner, A. Fuchs, and C. Tinelli. Implementing the model evolu-
tion calculus. International Journal of Artificial Intelligence Tools,
15:21-52, 2006.

M. Sulzmann, G.J. Duck, S. Peyton-Jones, and P.J. Stuckey. Understanding func-
tional dependencies via constraint handling rules. Journal of Functional Program-
ming, 17:83-129, 2007.

T. Schrijvers, B. Demoen, M. Garcia de la Banda, and P.J. Stuckey. Improving
PARMA trailing. Theory and Practice of Logic Programming, 6(6):609-44, 2006.


Conference Publications


MiniZinc: Towards a Standard CP Modelling Language. Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck and Guido Tack. Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP2007), Providence, Rhode Island, USA, September 2007. PDF.

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.  Sandro Pirkwieser, Günther R. Raidl and Jakob Puchinger. In C. Cotta and J. van Hemert editors, Evolutionary Computation in Combinatorial Optimization (EvoCOP 2007), LNCS 4446, pp. 176—187. Springer, 2007. PDF

The Effect of Restarts on the Efficiency of Clause Learning. Jinbo Huang. Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pages 2318-2323.

Uncertainty in preference elicitation and aggregation. Toby Walsh. Proceedings of AAAI-2007, 2007.

Distance Constraints in Constraint Satisfaction
Emmanuel Hebrard, Barry O'Sullivan and Toby Walsh.
Proceedings of IJCAI-2007, 2007.

Winner Determination in Sequential Majority Voting
Jerome Lang, Maria Pini, Francesca Rossi, Kristen Venable and Toby Walsh. Proceedings of IJCAI-2007, 2007.

Constraint and Variable Ordering Heuristics for Compiling Configuration Problems
Nina Narodytska and Toby Walsh. Proceedings of IJCAI-2007, 2007.

Incompleteness and Incomparability in Preference Aggregation
Maria Pini, Francesca Rossi, Kristen Venable and Toby Walsh. Proceedings of IJCAI-2007, 2007.

Symmetry Breaking
Toby Walsh.Proceedings of AI'06, 2006.

Reformulating global constraints:  the Slide and Regular constraints"
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh
The Seventh Symposium on Abstraction, Reformulation and Abstraction (SARA2007).

Breaking Symmetry of Interchangeable Variables and Values
Toby Walsh
Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 2007.

Distance Constraints in Constraint Satisfaction Emmanuel Hebrard, Barry
O'Sullivan and Toby Walsh. Proceedings of IJCAI-2007, 2007.

Constraint and Variable Ordering Heuristics for Compiling Configuration
Problems Nina Narodytska and Toby Walsh. Proceedings of IJCAI-2007, 2007.

Incompleteness and Incomparability in Preference Aggregation (pdf, legal ps,
letter ps) Maria Pini, Francesca Rossi, Kristen Venable and Toby
Walsh. Proceedings of IJCAI-2007, 2007.


The ROOTS Constraint Christian Bessiere, Emmanuel Hebrard, Brahim Hnich,
Zeynep Kiziltan and Toby Walsh. Proceedings of CP-2006, LNCS 4204, 75-90,
2006.

Global Grammar Constraints Claude-Guy Quimper and Toby Walsh. Proceedings of
CP-2006, LNCS 4204, 751-755, 2006. (Best poster award).

General Symmetry Breaking Constraints Toby Walsh. Proceedings of CP-2006,
LNCS 4204, 650-664, 2006.

Inverse Consistencies for Non-binary Constraints Kostas Stergiou and Toby
Walsh. Proceedings of ECAI-2006, 153-157, 2006.

Symmetry Breaking using Value Precedence Toby Walsh. Proceedings of
ECAI-2006, 168-172, 2006.

Estimating Search Tree Size Philip Kilby, John Slaney, Sylvie Thiebaux and
Toby Walsh. Proceedings of AAAI-2006, 1014-1019, 2006.

The Range Constraint: Algorithms and Implementation Christian Bessiere,
Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh. Proceedings
of CPAIOR-2006, LNCS 3990, 59-73, 2006.

The All Different and Global Cardinality Constraints on Set, Multiset and
Tuple Variables Claude-Guy Quimper and Toby Walsh. Recent Advances in
Constraints: Joint ERCIM/CoLogNET International Workshop on Constraint
Solving and Constraint Logic Programming, 1-13, LNCS 3978, 2006.

Among, Common and Disjoint Constraints Christian Bessiere, Emmanuel Hebrard,
Brahim Hnich, Zeynep Kiziltan and Toby Walsh. Recent Advances in
Constraints: Joint ERCIM/CoLogNET International Workshop on Constraint
Solving and Constraint Logic Programming, 29-43, LNCS 3978, 2006.

Beyond Finite Domains: the All Different and Global Cardinality Constraints
Claude-Guy Quimper and Toby Walsh. Proceedings of CP-2005, 812-816, LNCS
3709, 2005.

M. Maher, Heyting Domains for Constraint Abduction, Proc. Australian Joint
Conference on Artificial Intelligence, LNAI 4304, Springer, 9-18, 2006.

M. Maher, Abduction of Linear Arithmetic Constraints, Proc. International
Conference on Logic Programming, LNCS 3668, Springer, 174-188, 2005.

Michael J. Maher: Herbrand Constraint Abduction, in
Proceeding of 20th IEEE Symposium on Logic in Computer Science,
pages 397-406, IEEE Computer Society, 2006.

M.J. Garcia de la Banda, K. Marriott, Reza Rafeh, Mark Wallace: The
Modelling Language Zinc. Proceedings of CP 2006. 700-705.
Springer-Verlag.

C. W. Choi, Warwick Harvey, J. H. M. Lee, Peter J. Stuckey: Finite Domain
Bounds Consistency Revisited. Australian Conference on Artificial
Intelligence 2006: 49-58

P.J. Stuckey, M. Garcia de la Banda, M. Maher, K. Marriott, J. Slaney,
Z. Somogyi, M. Wallace, and T. Walsh. The G12 project: Mapping solver
independent models to efficient solutions. In P. Van Beek, editor,
Proceedings of the 11th International Conference on Principles and Practice
of Constraint Programming, number 3709 in LNCS, pages
13-16. Springer-Verlag, 2005.

P.J. Stuckey, M. Garcia de la Banda, M. Maher, K. Marriott, J. Slaney,
Z. Somogyi, M. Wallace, and T. Walsh. The G12 project: Mapping solver
independent models to efficient solutions. In M. Gabrielli and G. Gupta,
editors, Proceedings of the 21st International Conference on Logic
Programming, number 3668 in LNCS, pages 9-13.  Springer-Verlag, 2005.

G. Duck, P.J. Stuckey, and S. Brand. ACD term rewriting. In S. Etalle and
M. Truszczynski, editors, Proceedings of the International Conference on
Logic Programming, number 4079 in LNCS, pages 117-131. Springer-Verlag,
August 2006.

S. Brand and R.H.C. Yap.  Towards "Propagation = Logic + Control".  In
S. Etalle and M. Truszczynski, editors, Proceedings of the International
Conference on Logic Programming, number 4079 in LNCS, pages
102-116. Springer-Verlag, August 2006.

K.R. Apt and S. Brand.
Infinite Qualitative Simulations by Means of Constraint Programming.
Proceedings of CP 2006, pages 29-43. Springer0-Verlag, September 2006.

R. Muhammed and P.J. Stuckey. A stochastic non-CNF SAT solver. In Q. Yang
and G. Webb, editors, 9th Biennial Pacific Rim International Conference on
Artificial Intelligence (PRICAI 2006), number 4099 in LNCS, pages
120-129. Springer-Verlag, 2006.

M. Codish, V. Lagoon, and P.J. Stuckey. Solving partial order constraints
for LPO termination. In F. Pfenning, editor, Proceedings of International
Conference on Rewriting Techniques and Applications, number 4098 in LNCS,
pages 4-8.  Springer-Verlag, August 2006.

M. Codish, V. Lagoon, and P.J. Stuckey. Size-change termination analysis in
k-bits.  In P. Sestoft, editor, Proceedings of European Symposium on
Programming, number 3924 in LNCS, pages 230-245. Springer-Verlag, 2006.

P. Hawkins and P.J. Stuckey. A hybrid BDD and SAT finite domain constraint
solver. In P. Van Hentenryck, editor, Proceedings of the Practical
Applications of Declarative Programming, LNCS, pages
103-117. Springer-Verlag, 2006.

R. Becket, M. Garcia de la Banda, K. Marriott, Z. Somogyi, P.J. Stuckey, and
M. Wallace. Adding constraint solving to Mercury. In P. Van Hentenryck,
editor, Proceedings of the Practical Applications of Declarative
Programming, LNCS, pages 118-133. Springer-Verlag, 2006.

R. Marshall, S. Bird, and P.J. Stuckey. Structuring documents
efficiently. In T. Baldwin, J. Curran, and M. van Zaanen, editors,
Proceedings of the Australasian Language Technology Workshop 2005, pages
120-128, Sydney, Australia, December
2005. http://www.alta.asn.au/events/altw2005.

M. Codish, V. Lagoon, and P.J. Stuckey.  Testing for termination with
monotonicity constraints. In M. Gabrielli and G. Gupta, editors, Proceedings
of the International Conference on Logic Programming, number 3668 in LNCS,
pages 326-340.  Springer- Verlag, 2005.

T. Schrijvers, P.J. Stuckey, and G.J. Duck. Abstract interpretation for
constraint handling rules. In Amy Felty, editor, PPDP'05: Proceedings of the
7th International ACM SIGPLAN Conference on Principles and Practice of
Declarative Programming, pages 218-229, Lisbon, Portugal, July 2005. ACM.

K. Francis and P.J. Stuckey. Constraint propagation for loose constraint graphs. In
Proceedings 22nd Annual ACM Symposium on Applied Computing, page to appear.
ACM Press, 2007.

T. Feydy and P.J. Stuckey. Propagating dense systems of integer linear equations. In
Proceedings 22nd Annual ACM Symposium on Applied Computing, page to appear.
ACM Press, 2007.

Somogyi Z., Sagonas K., Tabling in Mercury: design and implementation,
Proceedings of the Eighth International Symposium on Practical Aspects of
Declarative Languages, Charleston, USA, January 2006, pp. 150-167.

Anbulagan, D. N. Pham, J. Slaney, and A. Sattar. Old resolution meets
modern sls. In AAAI-05, pages 354-359, 2005.

Anbulagan and J. Slaney. Lookahead saturation with restriction for SAT.
In P. van Beek, editor, CP-05, pages 727-731. Springer-Verlag, 2005. LNCS
3709.

Anbulagan and J. Slaney. Multiple preprocessing for systematic sat solvers.
In Proceedings of IWIL-6, 2006. Workshop in conjunction with LPAR-2006.

P. Baumgartner, A. Fuchs, and C. Tinelli. Computing finite models by
reduction to function-free clause logic. In Proceedings of DISPROVING-06
workshop, pages 83-95, 2006.

P. Baumgartner, A. Fuchs, and C. Tinelli. Lemma learning in the model
evolution calculus. In Proceedings of LPAR-06, pages 572-586, 2006.

P. Baumgartner and R. Schmidt. Blocking and other enhancements for
bottom-up model generation methods. In International Joint Conference
on Automated Reasoning (IJCAR), pages 125-139, 2006.

J. Huang. Combining knowledge compilation and search for conformant
probabilistic planning. In Proceedings of ICAPS-06, pages 253-262, 2006.

J. Huang, M. Chavira, and A. Darwiche. Solving map exactly by searching
on compiled arithmetic circuits. In Proceedings of AAAI-06, pages 143-148,
2006.

A. Ishtaiwi, J. Thornton, Anbulagan, A. Sattar, and D. N. Pham. Adaptive
clause weight redistribution. In CP-06, pages 229-243, 2006.

Anbulagan, D. N. Pham, J. Slaney, and A. Sattar. Boosting sls performance
by incorporating resolution-based preprocessor. In Proceedings of the Third
International Workshop on Local Search Techniques in Constraint Satisfac-
tion (LSCS), 2006.
 
Alban Grastien, Anbulagan, Jussi Rintanen and Elena Kelareva,
Diagnosis of Discrete-Event Systems Using Satisfiability Algorithms.
AAAI-2007, Vancouver, BC, Canada

Alban Grastien, Anbulagan, Jussi Rintanen and Elena Kelareva,
Modeling and Solving Diagnosis of Discrete-Event Systems via Satisfiability.
In Proc. of the 18th International Workshop on Principles of Diagnosis (DX-2007), Nashville, TN, USA

Alban Grastien and Anbulagan
Resolution d'un probleme de diagnostic de systemes a evenements discrets par SAT (in French).
Troisiemes Journees Francophones de Programmation par Contraintes (JFPC-2007)
The 3rd Annual French Conference on Constraint Programming, INRIA, Rocquencourt, Yvelines France.

Sandro Pirkwieser, Gunther R. Raidl, and Jakob Puchinger. Combining
Lagrangian Decomposition with an Evolutionary Algorithm for the
Knapsack Constrained Maximum Spanning Tree Problem. In C. Cotta and J.
van Hemert editors, Evolutionary Computation in Combinatorial
Optimization - EvoCOP 2007, volume 4446 of LNCS, pages 176-187.
Springer, 2007.

Peter Baumgartner, Alexander Fuchs, and Cesare Tinelli.
Lemma Learning in the Model Evolution Calculus. In Miki Hermann and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence and Reasoning (LPAR), volume 4246 of LNAI, pages 572--586. Springer, 2006.

Peter Baumgartner and Renate Schmidt. Blocking and Other Enhancements for Bottom-Up Model Generation Methods.
In U. Furbach and N. Shankar, editors, Automated Reasoning -- Third International Joint Conference on Automated Reasoning (IJCAR)}, volume 4130 of LNAI. Springer, 2006.

Reza Rafeh, Maria J. Garcia de la Banda, Kim Marriott, Mark Wallace: From Zinc to Design Model. PADL 2007: 215-229