Erik Aurell, Magnus Boman,
Mats Carlsson, Joakim Eriksson, Niclas Finne, Sverker Janson, Per Kreuger,
and Lars Rasmusson.
A constraint programming agent for automated trading.
In 8th International Conference of The Society for Computational Economics
Computing in Economics and Finance, Aix-en-Provence, France, June 27-29,
2002.
(PDF)
Joakim Eriksson and
Sverker Janson.
The trading agent competition - tac 2002.
ERCIM News, (51), October 2002.
(PDF)
Lars Rasmusson.
Network capacity sharing with QoS as a financial derivative pricing
problem: algorithms and network design.
PhD thesis, The Royal Institute of Technology, December 2002.
SICS Dissertation Series 32.
Sverker Janson.
Vad är agenter? varför behöver vi agenter? vilka är deras
roller?
Seminar transcript in Swedish. In: Rättsliga och andra samhällsaspekter
på agentteknik, PM 7:2000, Det IT-Rättsliga Observatoriet, 2000.
(PDF)
Joakim Eriksson, Niclas
Finne, and Sverker Janson.
SICS MarketSpace: an agent-based market infrastructure.
In Proceedings of the 1998 Workshop on Agent-Mediated Electronic
Trading. Springer-Verlag, 1999.
(PDF)
Tomas Olsson, Andreas
Rasmusson, and Sverker Janson.
Personalized decentralized communication.
In Bringing Knowledge to Business Processes Papers from 1999 AAAI Spring
Symposium, Technical Report SS-00-03. AAAI Press, 1999.
Poster presentation.
(PDF)
Lars Rasmusson and
Sverker Janson.
Agents, self-interest, and electronic markets.
Knowledge Engineering Review, 14(2):143-150, 1999.
(PDF)
Joakim Eriksson, Niclas
Finne, and Sverker Janson.
To each and everyone an agent: augmenting web-based commerce with agents.
In Proceedings of the International Workshop on Intelligent Agents on the
Internet and Web, Mexico City, 1998. World Congress on Expert Systems.
(PDF)
Tomas Olsson.
Decentralised social filtering based on trust.
In AAAI-98 Recommender Systems Workshop Papers, pages 84-88.
AAAI, 1998.
(PostScript)
Lars Pettersson.
An agent-based interface to multiple databases.
Master's thesis, Uppsala University, Computing Science Department, 1998.
(PostScript)
Andreas Rasmusson, Tomas
Olsson, and Preben Hansen.
A virtual community
library: SICS digital library infrastructure project.
In Research and Advanced Technology for Digital Libraries - Second
European Conference, ECDL'98, volume 1513 of Lecture Notes in
Computer Science, pages 677-678, Heraklion, Crete, 1998.
Springer-Verlag.
Joakim Eriksson and
Niclas Finne.
MarketSpace: an open agent-based market infrastructure.
Master's thesis, Uppsala University, Computing Science Department, 1997.
(PostScript)
Joakim Eriksson,
Fredrik Espinoza, Niclas Finne, Fredrik Holmgren, Sverker Janson, Niklas
Kaltea, and Olle Olsson.
An Internet software platform based on SICStus Prolog.
Presented at Logic Programming and the Web, WWW5, San Jose, 1997.
(PDF)
Charlton P, Mamdani E, Olsson O,
Pitt J, Somers F, and Waern A.
An open agent architechture supporting multimedia services on public
information.
In Proceedings 2nd Int'l Conference Practical Applications of Intelligent
Agents and Multi-Agent (PAAM '97), pages 445-465, April 1997.
Charlton P, Mamdani EH,
Olsson O, and Pitt JV.
An open agent architechture supporting multimedia services on public
information kiosks.
In Conference proceedings of Intelligent Agents, March 1997.
Charlton P, Mamdani EH,
Olsson O, Pitt JV, Somers F, and Waern A.
An open agent architechture for integrating multimedia services.
In Proceedings of Emerging Technologies, January 1997.
Charlton P, Espinoza F,
Mamdani EH, Olsson O, Pitt JV, Somers F, and Waern A.
Using an asset model for integration of agents and multimedia to provide an
open service architecture.
In Proceedings ECMAST'97 Conference, pages 635-660, 1997.
Charlton P, Chen Y, Mamdani EH,
Olsson O, Pitt JV, Somers F, and Waern A.
An open agent architechture for integrating multimedia services.
In Proceedings of AA, 1997.
Lars Rasmusson, Andreas
Rasmusson, and Sverker Janson.
Using agents to secure the Internet marketplace: Reactive security and social
control.
In Proceedings of Practical Applications of Agents and Multi-Agent
Systems 1997 (PAAM'97), London, UK, 1997.
(PDF)
Joakim Eriksson, Niclas
Finne, and Sverker Janson.
Information and interaction in MarketSpace and their implementation in
Prolog.
Presented at LPNET'96 (1st Workshop on Logic Programming Tools for Internet
Applications), ICLP'96, 1996.
(PDF)
Joakim Eriksson, Niclas
Finne, and Sverker Janson.
Information and interaction in MarketSpace: towards an open agent-based
market infrastructure.
In Second USENIX Workshop on Electronic Commerce. USENIX, 1996.
(PDF)
Joakim Eriksson, Niclas
Finne, and Sverker Janson.
Surfing the market and making sense of the web.
Presented at Programming the Web -- In Search of APIs, WWW5, Paris, 1996.
(PDF)
Johan Montelius,
Sverker Janson, and Jan Gabrielsson et al.
Intentions and intelligent screening in an agent-based personal communication
system.
Presented at IATA'96 (Intelligent Agents in Telecommunication Applications),
ECAI'96, Budapest., 1996.
(PDF)
Andreas Rasmusson.
Interactive security assistance for end-user supervision of untrusted programs.
Master's thesis, Royal Institute of Technology, Department of Computer and
Systems Sciences, 1996.
(PostScript)
Lars Rasmusson.
Socially controlled global agent systems.
Master's thesis, Royal Institute of Technology, Department of Computer and
Systems Sciences, 1996.
(PostScript)
Andreas Rasmusson
and Sverker Janson.
Personal security assistance for secure Internet commerce.
In New Security Paradigms '96. ACM Press, 1996.
(PDF)
Lars Rasmusson and
Sverker Janson.
Simulated social control for secure Internet commerce.
In New Security Paradigms '96. ACM Press, 1996.
(PDF)
Lars Rasmusson, Andreas
Rasmusson, and Sverker Janson.
Reactive security and social control.
In 19th National Information Systems Security Conference. NISSC,
1996.
(PDF)
Combinatorial Problem Solving and Prolog Technology
Bibliography generated from publications.bib
Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, and Justin
Pearson.
On matrices, automata,
and double counting.
In CPAIOR, volume 6140 of Lecture Notes in Computer
Science, pages 10-24. Springer, 2010.
M. Ågren,
N. Beldiceanu, M. Carlsson, M. Sbihi, C. Truchet, and S. Zampelli.
Six ways of integrating symmetries within non-overlapping constraints.
Technical Report T2009-01, Swedish Institute of Computer Science, 2009.
N. Beldiceanu,
P. Flener, and X. Lorca.
Combining tree partitioning, precedence, and incomparability constraints.
Constraints, 13(4):459-489, 2008.
Nicolas Beldiceanu.
Introduction to the special issue on global constraints.
Constraints, 12(1):1-2, 2007.
Nicolas Beldiceanu and Xavier Lorca.
Necessary condition for path partitioning constraints.
In Pascal Van Hentenryck and Laurence A. Wolsey, editors, CPAIOR,
volume 4510 of Lecture Notes in Computer Science, pages
141-154. Springer, 2007.
Nicolas Beldiceanu and Emmanuel Poder.
A continuous multi-resources umulative constraint with positive-negative
resource consumption-production.
In Pascal Van Hentenryck and Laurence A. Wolsey, editors, CPAIOR,
volume 4510 of Lecture Notes in Computer Science, pages
214-228. Springer, 2007.
N. Beldiceanu,
M. Carlsson, E. Poder, R. Sadek, and C. Truchet.
A generic geometrical constraint kernel in space and time for handling
polymorphic k-dimensional objects.
In C. Bessiere, editor, Proc. CP'2007, volume 4741 of
LNCS, pages 180-194. Springer, 2007.
Nicolas
Beldiceanu, Mats Carlsson, Sophie Demassey, and Therry Petit.
Global constraint catalog: Past, present and future.
Constraints, 12(1):21-62, 2007.
DOI 10.1007/s10601-006-9010-8.
N. Beldiceanu,
P. Flener, and X. Lorca.
Partitionnement de graphes par des arbres sous contraintes de degré.
In L. Henocque, editor, Proc. Journées Francophones de Programmation par
Contraintes (JFPC'06). Association Française de Programmation par
Contraintes, 2006.
Nicolas Beldiceanu,
Mats Carlsson, Sophie Demassey, and Thierry Petit.
Graph properties based filtering.
Technical Report T2006-10, Swedish Institute of Computer Science, 2006.
Nicolas Beldiceanu, Mats
Carlsson, Sophie Demassey, and Thierry Petit.
Graph properties based
filtering.
In F. Benhamou, editor, CP'2006, Principles and Practice of Constraint
Programming, volume 4204 of LNCS, pages 59-74. Springer,
2006.
Nicolas Beldiceanu,
Mats Carlsson, and Sven Thiel.
Sweep synchronisation as a global propagation mechanism.
Computers & Operations Research, 3(10):2835-2851, 2006.
Nicolas Beldiceanu, Irit Katriel, and Xavier Lorca.
Undirected forest constraints.
In J. Christopher Beck and Barbara M. Smith, editors, CPAIOR,
volume 3990 of Lecture Notes in Computer Science, pages 29-43.
Springer, 2006.
Mats Carlsson.
The SICStus Prolog finite domain constraint programming library.
In CP-TOOLS-06 workshop at CP 2006, 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.
Erik Aurell, Mats Carlsson,
Jan Ekman, and Per Kreuger.
Genfunk.
Technical Report T2005-17, Swedish Institute of Computer Science, 2005.
Nicolas Beldiceanu,
Mats Carlsson, and Jean-Xavier Rampon.
Global constraint catalog.
Technical Report T2005-08, Swedish Institute of Computer Science, 2005.
Nicolas Beldiceanu, Pierre Flener, and Xavier Lorca.
The tree constraint.
In Roman Barták and Michela Milano, editors, CPAIOR, volume
3524 of Lecture Notes in Computer Science, pages 64-78.
Springer, 2005.
Nicolas Beldiceanu, Thierry Petit, and Guillaume Rochart.
Bounds of graph characteristics.
In Peter van Beek, editor, CP, volume 3709 of Lecture Notes
in Computer Science, pages 742-746. Springer, 2005.
Ludovic Langevine.
Explication
systématique des contraintes indexicales.
In C. Solnon, editor, Proc. Premières Journées Francophones de
Programmation par Contraintes (JFPC'05). Association Française de
Programmation par Contraintes, 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 and Thierry Petit.
Cost evaluation of soft global constraints.
In Jean-Charles Régin and Michel Rueher, editors, CPAIOR,
volume 3011 of Lecture Notes in Computer Science, pages 80-95.
Springer, 2004.
Nicolas Beldiceanu and Emmanuel Poder.
The period constraint.
In Bart Demoen and Vladimir Lifschitz, editors, ICLP, volume 3132
of Lecture Notes in Computer Science, pages 329-342. Springer,
2004.
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. Springer, 2004.
Extended version available as SICS Tech Report T2004-08.
Nicolas Beldiceanu, Irit Katriel, and Sven Thiel.
Filtering algorithms for the same constraint.
In Jean-Charles Régin and Michel Rueher, editors, CPAIOR,
volume 3011 of Lecture Notes in Computer Science, pages 65-79.
Springer, 2004.
Nicolas Beldiceanu, Irit Katriel, and Sven Thiel.
Gcc-like restrictions on the ame constraint.
In Boi Faltings, Adrian Petcu, François Fages, and Francesca Rossi,
editors, CSCLP, volume 3419 of Lecture Notes in Computer
Science, pages 1-11. Springer, 2004.
Mats Carlsson
and Nicolas Beldiceanu.
Dispensation order
generation for pyrosequencing.
In Yi-Ping Phoebe Chen, editor, Proc. APBC2004, volume 29 of
Conferences in Research and Practice in Information technology,
Dunedin, New Zealand, 2004. Australian Computer Society.
Emmanuel Poder,
Nicolas Beldiceanu, and Eric Sanlaville.
Computing a lower approximation of the compulsory part of a task with varying
duration and varying resource consumption.
EJOR, 153:239-254, 2004.
Emmanuel
Poder, Nicolas Beldiceanu, and Eric Sanlaville.
Computing a lower approximation of the compulsory part of a task with varying
duration and varying resource consumption.
European Journal of Operational Research, 153(1):239-254,
2004.
N. Beldiceanu.
Generic filtering algorithms for generic global constraints.
Invited Talk, ERCIM Working Group on Constraints Workshop, 2003.
Erik Aurell, Magnus Boman,
Mats Carlsson, Joakim Eriksson, Niclas Finne, Sverker Janson, Per Kreuger,
and Lars Rasmusson.
A constraint
programming agent for automated trading.
In 8th Int. Conf. of The Society for Computational Economics Computing in
Economics and Finance, Aix-en-Provence, France, June 2002.
N. Beldiceanu.
Global
constraints.
Tutorial at CP'2002, Principles and Practice of Constraint Programming, 2002.
Powerpoint slides.
Nicolas
Beldiceanu and Mats Carlsson.
A new multi-resource cumulatives constraint with negative heights.
In P. Van Hentenryck, editor, CP'2002, Principles and Practice of
Constraint Programming, volume 2470 of LNCS, pages
63-79. Springer, 2002.
Preprint available as SICS Tech Report T2001-11.
Nicolas
Beldiceanu.
Pruning for the minimum constraint family and for the number of distinct values
constraint family.
In Toby Walsh, editor, CP, volume 2239 of Lecture Notes in
Computer Science, pages 211-224. Springer, 2001.
Nicolas
Beldiceanu, Qi Guo, and Sven Thiel.
Non-overlapping constraints between convex polytopes.
In T. Walsh, editor, CP'2001, Principles and Practice of Constraint
Programming, volume 2239 of LNCS, pages 392-407.
Springer, 2001.
Preprint available as SICS Tech Report T2001-12.
Nicolas Beldiceanu, Qi Guo, and Sven Thiel.
Non-overlapping constraints between convex polytopes.
In Toby Walsh, editor, CP, volume 2239 of Lecture Notes in
Computer Science, pages 392-407. Springer, 2001.
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):1-131, 2001.
Nicolas
Beldiceanu.
Global constraints as graph properties on a structured network of elementary
constraints of the same type.
In Rina Dechter, editor, CP, volume 1894 of Lecture Notes in
Computer Science, pages 52-66. Springer, 2000.
Nicolas Beldiceanu.
Sweep as a generic pruning technique.
Technical Report T2000-08, Swedish Institute of Computer Science, 2000.
Also in Proc. TRICS workshop at CP'2000, Principles and Practice of
Constraint Programming.
Helmut Simonis, Abderrahmane Aggoun, Nicolas Beldiceanu, and
Eric Bourreau.
Complex constraint abstraction: Global constraint visualisation.
In Pierre Deransart, Manuel V. Hermenegildo, and Jan Maluszynski, editors,
Analysis and Visualization Tools for Constraint Programming,
volume 1870 of Lecture Notes in Computer Science, pages
299-317. Springer, 2000.
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.
J. Yen, M. Carlsson, M. Chang,
J.M. García, and H. Nguyen.
Constraint solving for inkjet print mask design.
In NIP15: Int. Conf. on Digital Printing Technologies, Orlando,
FL, 1999. The Society for Imaging Science and Technology.
J. Yen, M. Carlsson, M. Chang,
J.M. Garcia, and H. Nguyen.
Constraint solving for inkjet print mask design.
Technical report, HPL-98-133, Hewlett-Packard Company, July 1998.
Mats Carlsson, Greger
Ottosson, and Björn Carlson.
An open-ended finite
domain constraint solver.
In H. Glaser, P. Hartel, and H. Kuchen, editors, Programming Languages:
Implementations, Logics, and Programming, volume 1292 of
LNCS, pages 191-206. Springer, 1997.
Per Kreuger, Mats
Carlsson, Jan Olsson, Thomas Sjöland, and Emil Åström.
The TUFF train
scheduler.
In G. Puebla, editor, ILPS'97 Workshop on Tools and Environments for
(Constraint) Logic Programmins, 1997.
Björn Carlson,
Sverker Janson, and Mats Carlsson.
The implementation of
AKL(FD).
In J. Lloyd, editor, ILPS'95, Int. Logic Programming Symposium,
MIT Press Series in Logic Programming. The MIT Press, 1995.
Mats Carlsson
et al.
SICStus Prolog User's
Manual.
Swedish Institute of Computer Science, release 3 edition, 1995.
ISBN 91-630-3648-7.
Björn Carlson, Mats
Carlsson, and Daniel Diaz.
Entailment of finite
domain constraints.
In P. Van Hentenryck, editor, ICLP'94, Int. Conf. on Logic
Programming, MIT Press Series in Logic Programming, S. Margherita
Ligure, Italy, 1994. The MIT Press.
Abderrahmane Aggoun and Nicolas Beldiceanu.
Extending chip in order to solve complex scheduling and placement problems.
In Jean-Paul Delahaye, Philippe Devienne, Philippe Mathieu, and Pascal Yim,
editors, JFPL, pages 51--, 1992.
Abderrahmane Aggoun and Nicolas Beldiceanu.
Overview of the chip compiler system.
In ICLP, pages 775-789, 1991.
Abderrahmane Aggoun and Nicolas Beldiceanu.
Overview of the chip compiler system.
In WCLP, pages 421-435, 1991.
Mats Carlsson.
Boolean constraints in SICStus Prolog.
SICS Research Report T91:09, Swedish Institute of Computer Science,
1991.
Mats Carlsson.
The SICStus emulator.
SICS Technical Report T91:15, Swedish Institute of Computer Science,
1991.
Péter Szeredi,
Mats Carlsson, and Rong Yang.
Interfacing engines
and schedulers in or-parallel Prolog systems.
In E.H.L. Aarts, J. van Leeuwen, and M. Rem, editors, PARLE'91, Conf. on
Parallel Architectures and Languages Europe, volume 506 of
LNCS. Springer, 1991.
Abderrahmane Aggoun and Nicolas Beldiceanu.
Time stamps techniques for the trailed data in constraint logic programming
systems.
In Serge Bourgault and Mehmet Dincbas, editors, SPLT, pages
487-510, 1990.
Mats Carlsson.
Design and Implementation of an OR-Parallel Prolog Engine.
SICS Dissertation Series 02, The Royal Institute of Technology,
Stockholm, Stockholm, Sweden, May 1990.
Mats Carlsson.
A Prolog compiler and its extension for or-parallelism.
SICS Research Report R90006, Swedish Institute of Computer Science,
1990.
Mats Carlsson
and Dan Sahlin.
Variable shunting for the WAM.
In J.W. Mills, editor, NACLP'90 Post-conf. Workshop on Logic Programming
Architectures and Implementations, 1990.
Also available as SICS Research Report R91:07.
Mats
Carlsson and Péter Szeredi.
The Aurora abstract machine and its emulator.
SICS Research Report R90005, Swedish Institute of Computer Science,
1990.
E. Lusk, R. Butler,
T. Disz, R. Olson, R. Overbeek, R. Stevens, D.H.D. Warren, A. Calderwood,
P. Szeredi, P. Brand, M. Carlsson, A. Ciepielewski, and B. Hausman.
The aurora or-parallel prolog system.
New Generation Computing, 7(2,3):243-271, 1990.
Péter Szeredi
and Mats Carlsson.
The engine-scheduler interface in the Aurora or-parallel Prolog system.
Technical Report TR-90-09, University of Bristol, Computer Science
Department, April 1990.
M. Carlsson.
On the efficiency of optimising shallow backtracking in compiled Prolog.
In G. Levi and M. Martelli, editors, ICLP'89, Int. Conf. on Logic
Programming, MIT Press Series in Logic Programming, pages 3-16,
Lisbon, 1989. The MIT Press.
Karen Appleby, Mats
Carlsson, Seif Haridi, and Dan Sahlin.
Garbage collection for Prolog based on WAM.
Communications of the ACM, 31(6):719-740, June 1988.
Mats Carlsson, Ken
Danhof, and Ross Overbeek.
A simplified approach to the implementation of AND-Parallelism in an
OR-Parallel environment.
In R.A. Kowalski and K.A. Bowen, editors, ICLP'88, Int. Conf. and
Symposium on Logic Programming, MIT Press Series in Logic Programming,
pages 1565-1577, Seattle, 1988. ALP, IEEE, The MIT Press.
Younes Souissi and Nicolas Beldiceanu.
Deterministic systems of sequential processes: Theory and tools.
In Friedrich H. Vogt, editor, Concurrency, volume 335 of
Lecture Notes in Computer Science, pages 380-400. Springer,
1988.
M. Carlsson.
Freeze, indexing, and other implementation issues in the WAM.
In Jean-Louis Lassez, editor, ICLP'87, Int. Conf. on Logic
Programming, MIT Press Series in Logic Programming, pages 40-58,
Melbourne, 1987. The MIT Press.
Abder Aggoun, Nicolas Beldiceanu,
Mats Carlsson, and François Fages.
Integrating rule-based modelling and constraint programming for solving
industrial packing problems.
M. Carlsson, N. Beldiceanu, and
J. Martin.
Technical report.
Mats
Carlsson and Nicolas Beldiceanu.
Dispensation order
generation for pyrosequencing.
In Yi-Ping Phoebe Chen, editor, Proc. APBC2004, volume 29 of
Conferences in Research and Practice in Information technology,
Dunedin, New Zealand, 2004. Australian Computer Society.
Arnborg, S. and G. Sjödin. 2000.
"Bayes Rules in Finite Models." In Proc. of the European Conference on Artificial Intelligence, Berlin, 2000, 571-575.
ISBN 1 58603 013 2
ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/fobc1.ps
Arnborg, S. and G. Sjödin. 2000.
"On the Foundations of Bayesianism." Presented at the Twentieth International Workshop on Bayesian Inference and Maximum
Entropy Methods in Science and Engineering, 2000
ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/fobm1.ps
Kanerva, P., J. Kristoferson, A. Holst. 2000.
"Random indexing of text samples for Latent Semantic Analysis."
In Proc. 22nd Annual Conference of the Cognitive Science Society, U. Pennsylvania, Aug. 2000, edited by L.R. Gleitman and
A.K. Josh, p. 1036. Mahwah, New Jersey: Erlbaum, 2000.
Kanerva, P. 2000.
"Large patterns make great symbols: An example of learning from example."
In Hybrid Neural Systems edited by S. Wermter and R. Sun, 194-203.
Heidelberg: Springer, 2000.
2001
Arnborg, S. and G. Sjödin.
On the Foundations of Bayesianism.
In the Twentieth International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering,
American Institute of Physics, 2001, Ali Mohammad-Djarafi, ed., pages 61-71, ISBN 0-7354-0004-0.
Abstract: We discuss precise assumptions entailing Bayesianism in the line of investigations started by Cox, and relate
them to a recent critique by Halpern. We show that every finite model which cannot be rescaled to probability violates
a natural and simple refinability principle. A new condition, separability, was found sufficient and necessary for
rescalability of infinite models.We finally characterise the acceptable ways to handle uncertainty in infinite models
based on Cox's assumptions. Certain closure properties must be assumed before all the axioms of ordered fields are satisfied.
Once this is done, a proper plausibility model can be embedded in an ordered field containing the reals, namely either standard
probability (field of reals) for a real valued plausibility model, or extended probability (field of reals and infinitesimals)
for an ordered plausibility model.
Kanerva, P., Sjödin, G., Kristoferson, J., Karlsson, R., Levin, B., Holst, A., Karlgren, J., and Sahlgren, M.
Computing with large random patterns.
In Uesaka, Y., Kanerva, P,, and Asoh. H. (eds.),
Foundations of Real-World Intelligence (pp. 251-311). Stanford, Calif.: CSLI Publications, 2001.
Abstract: We describe a style of computing that differs from traditional numeric and symbolic computing and is suited for
modeling neural networks. We focus on one aspect of ``neurocomputing,'' namely, computing with large random patterns,
or high-dimensional random vectors, and ask what kind of computing they perform and whether they can help us understand
how the brain processes information and how the mind works. Rapidly developing hardware technology will soon be able to produce
the massive circuits that this style of computing requires. This chapter develops a theory on which the computing could be based.
Chapter V includes these articles:
Kanerva, P.
Analogy as a basis of computation.
(pp. 254-272)
Sjödin, G.
The Sparchunk Code: A method to build higher-level structures in a sparsely encoded SDM
(pp. 272-282)
Uesaka, Y., Kanerva, P,, and Asoh. H., eds.
Foundations of Real-World Intelligence.
Stanford, Calif.: CSLI Publications, 2001. (Distributed by the Chicago University Press.)
Book abstract: In 1992 Japan's Ministry of International Trade and Industry (MITI) began a research program in Real World Computing,
as a successor to the Fifth Generation Computing program of the previous decade, complementing the fifth-generation approach.
Its objective is to lay a foundation and to pursue the technical realisation of humanlike flexible and intelligent information processing.
This book collects results of ten years of original research by five research laboratories in Japan and Europe, whose research focus has
been the theoretical and algorithmic foundations of intelligence as manifested in the real world an in our dealing with it.
Real-world intelligent systems handle complex, uncertain, dynamic, multimodal information in real time. Both explicit and implicit
information are important. Hence we need to develop a novel integrated framework of representing knowledge and making inferences based in it.
It is impossible to pre-program all the knowledge needed for coping with the variety and complexity of real environments, and therefore learning
and adaptation are keys to intelligence. Learning is a kind of meta-programming strategy. Instead of writing programs for specific tasks, we must
write programs that modify themselves based on a system's interaction with its environment.
The book includes chapters on inference and learning with graphical models, approximate reasoning, evolutionary computation and beyond,
methodology of distributed and active learning, and computing with large random patterns. The treatment is mathematically rigorous, and
the discussion of issues is of general interest to an educated reader at large. The book provides excellent reading for graduate courses
in Computer Science, Cognitive Science, Artificial Intelligence, and Applied Statistics.
Yoshinori Uesaka is a professor of information sciences at the Science University of Tokyo. Pentti Kanerva is a senior researcher at the
Swedish Institute of Computer Science. Hideki Asoh is a senior researcher at the Electrotechnical Laboratory in Tsukuba City, Japan.
2002
Jussi Karlgren, Björn Gambäck, and Pentti Kanerva, (editors)
Conference arranged by SICS.
Acquiring (and Using) Linguistic (and World) Knowledge for Information Access or Theory for systems; application for theories.
Notes from AAAI Spring Symposium on Acquiring (and Using) Linguistic (and World) Knowledge for Information Access, Stanford University,
California. AAAI.
Abstract: To move forward the research frontier in the general field of information access, one of the bottlenecks we need to address
is understanding textual content somewhat better. While full text understanding remains a distant and possibly unattainable goal, advances
in content analysis beyond the simple word-occurrence statistics or name-recognition algorithms used today would seem to be desirable.
Current information-retrieval systems deliver results using a simple text and content model. Much better models are necessary for information
access tasks that involve information refinement, meaning tasks that involve processing information in text. Models that must either be adaptive
or easily adapted by some form of low-cost intervention; and that must support incremental knowledge build-up. The first requirement involves
acquisition of information from unstructured data; the second involves finding an inspectable and transparent model and developing an understanding
of knowledge-intensive interaction.
Douglas Wikström
A Note on the Malleability of the El Gamal Cryptosystem
To appear in Proceedings of Indocrypt 2002, LNCS Springer Verlag
Abstract: The homomorphic property of the El Gamal cryptosystem is useful in the construction of efficient protocols. It is believed that only
a small class of transformations of cryptotexts are feasible to compute. In the program of showing that these are the only computable transformations
we rule out a large set of natural transformations.
Douglas Wikström
The Security of a Mix-Center Based on a Semantically Secure
Cryptosystem
To appear in Proceedings of Indocrypt 2002, LNCS Springer Verlag
Abstract: We introduce a definition of a re-encryption mix-center, and a definition of security for such a mix-center. Then we prove that any
semantically secure public key system, which allows re-encryption, can be used to construct a secure mix-center.
Page Formatted for Printing
