WELCOME TO SICStus Prolog Leading Prolog Technology 

SICStus Home > Bibliography  Download for Evaluation 
BibliographyIf you are unfamiliar with Prolog, you may be interested in this bibliography of textbooks on Prolog programming and books on Prolog applications.The following is a collection of research papers relating to SICStus Prolog. N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On matrices, automata, and double counting in constraint programming. Constraints, 18(1):108140, January 2013. (PDF) (Preprint) N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On the reification of global constraints. Constraints, 18(1):16, January 2013. (PDF) (Preprint) R. Castañeda Lozano, M. Carlsson, F. Drejhammar, and Ch. Schulte. Constraintbased register allocation and instruction scheduling. In: M. Milano (editor): Proceedings of CP'12, pages 750766. Lecture Notes in Computer Science, volume 7514. © SpringerVerlag, 2012. (PDF) A. Letort, N. Beldiceanu, and M. Carlsson. A scalable sweep algorithm for the cumulative constraint. In: M. Milano (editor): Proceedings of CP'12, pages 439454. Lecture Notes in Computer Science, volume 7514. © SpringerVerlag, 2012. (PDF) N. Beldiceanu, M. Carlsson, Th. Petit, and J.Ch. Régin. An O(n log n) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization. In: Proceedings of ECAI'12, pages 145150. IOS Press, 2012. (PDF) N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson. On the reification of global constraints. Technical Report T201202, Swedish Institute of Computer Science, 2012. (PDF) M. Carlsson and P. Mildner. SICStus Prolog  The first 25 years. Theory and Practice of Logic Programming, 12(12):3566, 2012. (PDF) N. Beldiceanu, M. Carlsson, S. Demassey, and E. Poder. New filtering for the cumulative constraint in the context of nonoverlapping rectangles. Annals of Operations Research, 184(1):2750, 2011. (PDF) H. Simonis, P. Davern, J. Feldman, D. Mehta, L. Quesada, and M. Carlsson. A generic visualization platform for CP. In: D. Cohen (editor), Proceedings of CP'10, pages 460474. Lecture Notes in Computer Science, volume 6308. © SpringerVerlag, 2010. (PDF) A. Aggoun, N. Beldiceanu, M. Carlsson, and F. Fages. Integrating rulebased modelling and constraint programming for solving industrial packing problems. ERCIM News 81, April 2010. (PDF) M. Ågren, N. Beldiceanu, M. Carlsson, M. Sbihi, Ch. Truchet, and S. Zampelli. Six ways of integrating symmetries within nonoverlapping constraints. In: W. J. van Hoeve and J. N. Hooker (editors), Proceedings of CPAIOR'09, pages 1125. Lecture Notes in Computer Science, volume 5547. © SpringerVerlag, 2009. (PDF) P. Flener, M. Carlsson, and C. Schulte. Constraint programming in Sweden. IEEE Intelligent Systems 24(2):8789, March/April 2009. (PDF) Mats Carlsson, Nicolas Beldiceanu, Julien Martin: A Geometric Constraint over kDimensional Objects and Shapes Subject to Business Rules. CP 2008: 220234. (PDF) Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey, Thierry Petit: Global Constraint Catalogue: Past, Present and Future. Constraints 12(1): 2162, 2007. (PDF) Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder, R. Sadek, Charlotte Truchet: A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic kDimensional Objects. CP 2007: 180194. (PDF) Nicolas Beldiceanu, Mats Carlsson, and Sven Thiel. Sweep synchronisation as a global propagation mechanism. Computers & Operations Research, 3(10):28352851, 2006. Christian Schulte and Mats Carlsson. Finite domain constraint programming systems. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 14. Elsevier, 2006. Nicolas Beldiceanu, Mats Carlsson, Romuald Debruyne, and Thierry Petit. Reformulation of global constraints based on constraint checkers. Constraints, 10(4), 2005. Nicolas Beldiceanu, Mats Carlsson, and JeanXavier Rampon. Global constraint catalog. Technical Report T200508, Swedish Institute of Computer Science, 2005. Nicolas Beldiceanu, Mats Carlsson, JeanXavier Rampon, and Charlotte Truchet. Graph invariants as necessary conditions for global constraints. In P. van Beek, editor, CP'2005, Principles and Practice of Constraint Programming, volume 3709 of LNCS, pages 92106. SpringerVerlag, 2005. Mats Carlsson. Dispensation order generation for pyrosequencing. ERCIM News, (60), 2005. Ludovic Langevine. Systematic explanation of indexical constraints. In M. Carlsson, F. Fages, B. Hnich, and F. Rossi, editors, Proc. CSCLP 2005: Joint Annual Workshop on Constraint Solving and Constraint Logic Programming. ERCIM/CologNet, 2005. Nicolas Beldiceanu, Mats Carlsson, and Thierry Petit. Deriving filtering algorithms from constraint checkers. In M. Wallace, editor, CP'2004, Principles and Practice of Constraint Programming, volume 3258 of LNCS. SpringerVerlag, 2004. Extended version available as SICS Tech Report T200408. Mats Carlsson and Nicolas Beldiceanu. Dispensation order generation for pyrosequencing. In YiPing Phoebe Chen, editor, Proc. APBC2004, volume 29 of Conferences in Research and Practice in Information technology, Dunedin, New Zealand, 2004. Australian Computer Society. Mats Carlsson and Nicolas Beldiceanu. From constraints to finite automata to filtering algorithms. In D. Schmidt, editor, Proc. ESOP2004, volume 2986 of LNCS, pages 94108, Barcelona, 2004. SpringerVerlag. Mats Carlsson and Nicolas Beldiceanu. Multiplex dispensation order generation for pyrosequencing. In CP'2004 Workshop on CSP Techniques with Immediate Application, 2004. Nicolas Beldiceanu, Mats Carlsson, and Sven Thiel. Sweep synchronization as a global propagation mechanism. In Proc. CPAIOR 2003, Montreal, 2003. Preprint available as SICS Tech Report T200302. Magnus Ågren. Tracing and explaining the execution of CLP(FD) programs in SICStus Prolog. Master's thesis, Uppsala University, 2002. Also available as SICS Tech Report T200210. M. Ågren, T. Szeredi, N. Beldiceanu, and M Carlsson. Tracing and explaining execution of CLP(FD) programs. In WLPE workshop at ICLP, Int. Conf. on Logic Programming, 2002. N. Beldiceanu. Global constraints. Tutorial at CP'2002, Int. Conf. on Principles and Practice of Constraint Programming, 2002. PDF. Nicolas Beldiceanu and Mats Carlsson. A new multiresource cumulatives constraint with negative heights. In P. Van Hentenryck, editor, CP'2002, Int. Conf. on Principles and Practice of Constraint Programming, volume 2470 of LNCS, pages 6379. SpringerVerlag, 2002. Preprint available as SICS Tech Report T200111. Nicolas Beldiceanu, Mats Carlsson, and Sven Thiel. Costfiltering algorithms for the two sides of the sum of weights of distinct values constraint. Technical Report T200214, Swedish Institute of Computer Science, 2002. Mats Carlsson and Nicolas Beldiceanu. Arcconsistency for a chain of lexicographic ordering constraints. Technical Report T200218, Swedish Institute of Computer Science, 2002. Mats Carlsson and Nicolas Beldiceanu. Revisiting the lexicographic ordering constraint. Technical Report T200217, Swedish Institute of Computer Science, 2002. Mats Carlsson and Christian Schulte. Finite domain constraint programming systems. Tutorial at CP'2002, Int. Conf. on Principles and Practice of Constraint Programming, 2002. Powerpoint slides. E. Aurell, M. Boman, M. Carlsson, J. Eriksson, N. Finne, S. Janson, P. Kreuger, and L. Rasmusson. A constraint programming agent for automated trading. In 8th Int. Conf. of The Society for Computational Economics Computing in Economics and Finance, AixenProvence, France, June 2002. (PDF). M. Carlsson. Finite Domain Constraints in SICStus Prolog. In CICLOPS Workshop at CP'2001, Int. Conf. on Principles and Practice of Constraint Programming, 2001. Invited talk. (PDF) G. Gupta, E. Pontelli, K. Ali, M. Carlsson, and M. Hermenegildo. Parallel Execution of Prolog Programs. ACM Transaction on Programming Languages and Systems, 23(4):1131, 2001. H. Nässén, M. Carlsson, and K. Sagonas. Instruction merging and specializing in the SICStus Prolog virtual machine. In PPDP'01, Int. Conf. on Principles and Practice of Declarative Programming. ACM, 2001. Nicolas Beldiceanu , Mats Carlsson . Sweep as a Generic Pruning Technique Applied to the NonOverlapping Rectangles Constraint . In T. Walsh, editor, CP'2001, Int. Conf. on Principles and Practice of Constraint Programming, LNCS vol. 2239 pp. 377391. SpringerVerlag, 2001. Also available as SICS Technical Report T200113 (PostScript) Nicolas Beldiceanu, Qi Guo, Sven Thiel . NonOverlapping Constraints between Convex Polytopes . In T. Walsh, editor, CP'2001, Int. Conf. on Principles and Practice of Constraint Programming, LNCS vol. 2239 pp. 392407. SpringerVerlag, 2001. Also available as SICS Technical Report T200112 (PostScript) Henrik Nässén . Optimizing the SICStus Prolog Virtual Machine Instruction Set . Master's thesis, SICS Technical Report T200101 (PostScript) Per Kreuger, Mats Carlsson, Thomas Sjöland, and Emil Åström. Sequence dependent task extensions for trip scheduling. SICS Technical Report T200114 (PostScript) Nicolas Beldiceanu . Pruning for the cardinalitypath Constraint Family . In P. Codognet, editor, ICLP'2001, Int. Conf. on Logic Programming, LNCS vol. 2237 pp. 5973. SpringerVerlag, 2001. Also available as SICS Technical Report T200011A (PostScript) Nicolas Beldiceanu . Pruning for the minimum Constraint Family and for the Number of Distinct Values Constraint Family . In T. Walsh, editor, CP'2001, Int. Conf. on Principles and Practice of Constraint Programming, LNCS vol. 2239 pp. 211224. SpringerVerlag, 2001. Also available as SICS Technical Report T200010 (PostScript) Nicolas Beldiceanu . Global Constraints as Graph Properties on Structured Networks of Elementary Constraints of the Same Type . SICS Technical Report T200001 (PostScript) Nicolas Beldiceanu . Sweep as a Generic Pruning Technique . In Proc. TRICS workshop at CP'2000, Int. Conf. on Principles and Practice of Constraint Programming. Also available as SICS Technical Report T200008 (PostScript) Antonio J. Fernández and Pat Hill. A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains. In Constraints: An International Journal. ISBN 13837133, Vol. 5, Issue 3, July 2000, pp. 279305. (PDF) J. Yen, M. Carlsson, M. Chang, J.M. García, and H. Nguyen. Constraint solving for inkjet print mask design. Journal of Imaging Science and Technology, 44(5), September/October 2000. Mats Carlsson, Per Kreuger, and Emil Åström. Constraintbased resource allocation and scheduling in steel manufacturing. In G. Gupta, ed., Proc. Practical Aspects of Declarative Languages, LNCS vol. 1551 pp. 335349, 1999. Jesper Eskilson and Mats Carlsson. SICStus MT  a multithreaded execution environment for SICStus Prolog. In Palamidessi et al., eds., Proc. Programming Languages: Implementations, Logics, and Programs, LNCS vol. 1490 pp. 3653, 1998 (Postscript, BibTeX entry) Mats Carlsson, Greger Ottosson and Björn Carlson. An OpenEnded Finite Domain Constraint Solver. Proc. Programming Languages: Implementations, Logics, and Programs, 1997. (Postscript) Peter Van Roy. 19831993: The Wonder Years of Sequential Prolog Implementation. May/July 1994, Journal of Logic Programming. A survey of implementation technology and systems since the WAM. HTML. R.C. Haygood. Native code compilation in SICStus Prolog. In Proceedings of the Eleventh International Conference of Logic Programming, MIT Press Series in Logic Programming, 1994. Hans Nilsson. xgdmo  A Browser for GDMO Specifications Written in Prolog In Proc. The Practical Applications of Prolog, London 1994. Hans Nilsson. The External Database in SICStus Prolog . In Logic Programming and Automated Reasoning, S:t Petersburg, Russia 1992; LNAI 624, SpringerVerlag. The full version as SICS Research Report R91:13, Swedish Institute of Computer Science, 1991 (PostScript). Hans Nilsson. SCE  A Tool for Defining Routing Information for the Freephone Service in AXE. In Proc. The Practical Applications of Prolog, London 1992. Thomas Sjöland. Using SICStus Objects in the Design of Graphical User Interfaces. In L. Fahlén and K.M. JääAro, editors, Proceedings of the 5th MultiG Workshop, Royal Institute of Technology, Stockholm, 1992. Also available as SICS Research Report R92:10. Mats Carlsson. Boolean constraints in SICStus Prolog. SICS Research Report T91:09, Swedish Institute of Computer Science, 1991. (PostScript) Mats Carlsson. The SICStus emulator. SICS Technical Report T91:15, Swedish Institute of Computer Science, 1991. (PostScript) Nils Hagner and Ingvar Olsson. Aspects and experiences of MIS and SICStus Prolog. SICS Technical Report T91:10, Swedish Istitute of Computer Science, 1991. Nils Hagner and Anders Tunevi. Implementing casebased reasoning in SICStus Prolog. SICS Research Report T91:16, Swedish Institute of Computer Science, 1991. Stefan Andersson. Implementing a module system for SICStus Prolog. SICS Technical Report T91:08, Swedish Institute of Computer Science, 1991. Kent Boortz. SICStus maskinkodskompilering. SICS Technical Report T91:13, Swedish Institute of Computer Science, August 1991. In Swedish. (PostScript) Dan Sahlin. An Automatic Partial Evaluator for Full Prolog. SICS Dissertation Series 04, The Royal Institute of Technology (KTH), Stockholm, Sweden, May 1991. (PostScript) Dan Sahlin. Determinacy analysis for full Prolog. In ACM/IFIP Symposium on Partial Evaluation and Semantics Based Program Manipulation. ACM Press, 1991. Mats Carlsson. Design and Implementation of an ORParallel Prolog Engine. SICS Dissertation Series 02, The Royal Institute of Technology, Stockholm, Stockholm, Sweden, May 1990. Mats Carlsson and Dan Sahlin. Variable shunting for the WAM. In J.W. Mills, editor, NACLP'90 Postconference Workshop on Logic Programming Architectures and Implementations, 1990. Also available as SICS Research Report R91:07. Dan Sahlin. Finding the least fixed point using waitdeclarations in Prolog. In P. Deransart and J. Maluszynski, editors, PLILP'90, International Symposium on Programming Language Implementation and Logic Programming, number 456 in Lecture Notes in Computer Science, pages 151158, Linköping, August 1990. SpringerVerlag. Dan Sahlin. The Mixtus approach to automatic partial evaluation of full Prolog. In Saumya Debray and Manuel Hermenegildo, editors, NACLP'90, North American Conference on Logic Programming, MIT Press Series in Logic Programming, pages 377398, Austin, 1990. ALP, The MIT Press. M. Carlsson. On the efficiency of optimising shallow backtracking in compiled Prolog. In Giorgio Levi and Maurizio Martelli, editors, ICLP'89, International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 316, Lisbon, 1989. Karen Appleby, Mats Carlsson, Seif Haridi, and Dan Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):719740, June 1988. M. Carlsson. Freeze, indexing, and other implementation issues in the WAM. In JeanLouis Lassez, editor, ICLP'87, International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 4058, Melbourne, 1987. David H.D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.
