1. Thom Frühwirth, Pascal Brisset, and Jörq-Rainer Molwitz. Planning Cordless Business Communication Systems. IEEE Intelligent Systems, 11(1):50-55, 1996. [doi:10.1109/64.482958] Abstract:

   People in their cars, people in the street, people at work, people at home–communicating through their mobile phones. Wireless communication might be the trend of the nineties, and it definitely means big business for the telecommunication industry. In Germany, for example, every third phone sold today is mobile. In the US, there will soon be 20 million subscribers to cellular phone services. In the second half of the nineties, 20% to 30% of phones sold worldwide are expected to be wireless . The introduction of a European standard for digital cordless telecommunication has made cordless local area networks possible. Mobile communication can come to company sites. No cabling is required, and the employees can be reached anytime at any place. However, planning wireless digital networks is quite different from planning traditional wire-based systems. The plan must account for the specifics of radio-wave propagation at the installation site. Computer-aided planning promises to ease some of the difficulties. In this article, we describe Popular (Planning of Picocellular Radio), a prototype tool resulting from a collaboration of industry and research institutions in Germany: the Siemens Research and Development Department, the Siemens Personal Networks Department, the European Computer-Industry Research Center (ECRC), and the Institute of Communication Networks at the Aachen University of Technology. Popular uses a path-loss model to describe radio-wave transmission and constraint-based programming to optimize the placement of base stations (transmitters) for local wireless communication at company sites.

   
   

   @article{fru_et_al_planning_cordless_is96,
   author = {Thom Fr{\"u}hwirth and Pascal Brisset and J{\"o}rq-Rainer Molwitz},
   title = {Planning Cordless Business Communication Systems},
   journal ={IEEE Intelligent Systems},
   volume = 11,
   number = 1,
   year = 1996,
   pages = {50--55},
   doi = {10.1109/64.482958},
   publisher = {IEEE Computer Society},
   abstract = { People in their cars, people in the street, people at work, people at home--communicating through their mobile phones. Wireless communication might be the trend of the nineties, and it definitely means big business for the telecommunication industry. In Germany, for example, every third phone sold today is mobile. In the US, there will soon be 20 million subscribers to cellular phone services. In the second half of the nineties, 20% to 30% of phones sold worldwide are expected to be wireless . 
   
   The introduction of a European standard for digital cordless telecommunication has made cordless local area networks possible. Mobile communication can come to company sites. No cabling is required, and the employees can be reached anytime at any place. However, planning wireless digital networks is quite different from planning traditional wire-based systems. The plan must account for the specifics of radio-wave propagation at the installation site. Computer-aided planning promises to ease some of the difficulties. 
   
   In this article, we describe Popular (Planning of Picocellular Radio), a prototype tool resulting from a collaboration of industry and research institutions in Germany: the Siemens Research and Development Department, the Siemens Personal Networks Department, the European Computer-Industry Research Center (ECRC), and the Institute of Communication Networks at the Aachen University of Technology. Popular uses a path-loss model to describe radio-wave transmission and constraint-based programming to optimize the placement of base stations (transmitters) for local wireless communication at company sites. } 
   }
   

1. Slim Abdennadher, Thom Frühwirth, and Holger Meuss. On confluence of Constraint Handling Rules. In CP '96: Proc. Second Intl. Conf. Principles and Practice of Constraint Programming, volume 1118 of Lecture Notes in Computer Science, pages 1-15, August 1996. Springer-Verlag. [doi:10.1007/3-540-61551-2_62] Keyword(s): confluence. Abstract:

   We introduce the notion of confluence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simplifies and solves constraints by applying rules. Confluence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, sufficient and necessary syntactic condition for confluence. Confluence turns out to be an essential syntactical property of CHR programs for two reasons. First, confluence implies correctness (as will be shown in this paper). In a correct CHR program, application of CHR rules preserves logical equivalence of the simplified constraints. Secondly, even when the program is already correct, confluence is highly desirable. Otherwise, given some constraints, one computation may detect their inconsistency while another one may just simplify them into a still complex constraint. As a side-effect, the paper also gives soundness and completeness results for CHR programs. Due to their special nature, and in particular correctness, these theorems are stronger than what holds for the related families of (concurrent) constraint programming languages.

   
   

   @inproceedings{abd_fru_meuss_on_confluence_cp96,
   author = {Slim Abdennadher and Thom Fr{\"u}hwirth and Holger Meuss},
   title = { On confluence of {C}onstraint {H}andling {R}ules},
   keywords = {confluence},
   year = 1996,
   month = aug,
   booktitle = {CP '96: Proc.\ Second Intl.\ Conf.\ Principles and Practice of Constraint Programming},
   location = {Cambridge, Massachusetts, USA},
   city = {Cambridge, Massachusetts, USA},
   series = LNCS,
   volume = 1118,
   publisher = SV,
   pages = {1--15},
   doi = {10.1007/3-540-61551-2_62},
   abstract = { We introduce the notion of confluence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simplifies and solves constraints by applying rules. Confluence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, sufficient and necessary syntactic condition for confluence. Confluence turns out to be an essential syntactical property of CHR programs for two reasons. First, confluence implies correctness (as will be shown in this paper). In a correct CHR program, application of CHR rules preserves logical equivalence of the simplified constraints. Secondly, even when the program is already correct, confluence is highly desirable. Otherwise, given some constraints, one computation may detect their inconsistency while another one may just simplify them into a still complex constraint. As a side-effect, the paper also gives soundness and completeness results for CHR programs. Due to their special nature, and in particular correctness, these theorems are stronger than what holds for the related families of (concurrent) constraint programming languages. },
   
   }
   




2. Marìa Teresa Escrig Monferrer and Francisco Toledo Lobo. Enhancing qualitative relative orientation with qualitative distance for robot path planning. In ICTAI '96: Proc. 8th IEEE Intl. Conf. Tools with Artif. Intell., pages 174-182, November 1996. IEEE Computer Society. [doi:10.1109/TAI.1996.560449]
   

   @inproceedings{escrig_toledo_ictai96,
   author = {Escrig Monferrer, Mar{\'i}a Teresa and Toledo Lobo, Francisco},
   title = {Enhancing qualitative relative orientation with qualitative distance for robot path planning},
   booktitle = {ICTAI '96: Proc.\ 8th IEEE Intl.\ Conf.\ Tools with Artif.\ Intell.},
   pages = {174--182},
   year = 1996,
   month = nov,
   doi = {10.1109/TAI.1996.560449},
   publisher = {IEEE Computer Society},
   
   }
   




3. Eric Monfroy, Michael Rusinowitch, and René Schott. Implementing non-linear constraints with cooperative solvers. In SAC '96: Proc. 1996 ACM symposium on Applied Computing, pages 63-72, 1996. ACM Press. ISBN: 0-89791-820-7. [doi:10.1145/331119.331147]
   

   @inproceedings{monfroy_et_al_nonlinear_cooperative_sac96,
   author = {Eric Monfroy and Michael Rusinowitch and Ren{\'e} Schott},
   title = {Implementing non-linear constraints with cooperative solvers},
   booktitle = {SAC '96: Proc. 1996 ACM symposium on Applied Computing},
   year = {1996},
   isbn = {0-89791-820-7},
   pages = {63--72},
   location = {Philadelphia, Pennsylvania, United States},
   city = {Philadelphia, Pennsylvania, United States},
   doi = {10.1145/331119.331147},
   publisher = {ACM Press},
   
   }
   

1. M. Bjareland. Proving consistency in K-IA chronicles—An implemention of PMON. Master's thesis, Dept. of Information and Comp. Science, Linkoepings Universitet, 1996.
   

   @mastersthesis{bjareland_pmon_msthesis96,
   title = {Proving consistency in {K-IA} chronicles---An implemention of {PMON}},
   author = {M. Bjareland},
   school = {Dept. of Information and Comp.\ Science, Linkoepings Universitet},
   year = 1996,
   
   }
   




2. Holger Meuss. Konfluenz von Constraint-Handling-Rules-Programmen. Diplomarbeit, Institut für Informatik, Ludwig-Maximilians-Universität München, Germany, 1996. Keyword(s): confluence.
   

   @mastersthesis{meuss_confluence_msthesis96,
   author = {Holger Meuss},
   title = {Konfluenz von {C}onstraint-{H}andling-{R}ules-Programmen},
   school = {Institut f\"ur Informatik, Ludwig-Maximilians-Universit\"at M\"unchen, Germany},
   year = {1996},
   type = {Diplomarbeit},
   keywords = {confluence},
   
   }
   

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

The contents of this webpage is provided by the authors stated below. KU Leuven is not bound by the information provided. It is possible that the information is not or no longer completely accurate. Where necessary, the authors can adjust and update faulty information. The authors have taken all reasonable care to ensure that all information available on this website is accurate at the time of publication and on the basis of the current state of knowledge. KU Leuven nor the authors are responsible for the content of any links to external organisations that are referred to on this website.

• Peter Van Weert [home, mail]
• Jon Sneyers [home, mail]
• Tom Schrijvers [home, mail]
• Leslie De Koninck

This document was translated from BibT_EX by bibtex2html