Mozart Programming System


mozart.github.io


Dynamic graphical user interfaces C Poncin – 2008 – uclouvain.be … the procedural approach. We have built a full-featured GUI tool, Qtk (http://www.mozart- oz.org/documentation/mozart-stdlib/wp/qtk/html/) (figure ref{figFlexClock}), that is part of the Mozart Programming System. | 17/07/2008 |. … Cached – All 4 versions

[PDF] Two constraint-based tools for protein folding [PDF] from unipr.it L Bortolussi, A Dal Palu… – 2008 – cs.unipr.it … of Computer Science, and Univ. Catholique de Louvain. The Mozart Programming System. www.mozart-oz.org. 7. G. Raghunathan and RL Jernigan. Ideal architecture of residue packing and its observation in protein structures. Protein Science, 6:2072-2083, 1997. 3 Related articles – View as HTML – All 7 versions

Survey of software environments for parallel distributed processing: Parallel programming education on real life target systems using production oriented software … CT Delistavrou… – Informatics (PCI), 2010 14th …, 2010 – ieeexplore.ieee.org … KOJAK 1 1 1 Lydian 1 1 mARmOT 1 1 mATLAB parallel computing Toolbox 1 1 1 1 mozart programming system 1 1 mpI 1 1 1 mpI Development plugin for NetBeans 1 1 mpI pERUsE 1 1 … KoJaK 1 1 1 lydian 1 1 1 1 1 marmot 1 1 mozart programming system 1 1 1 … Cited by 2 – Related articles – All 2 versions

[PDF] ???????????? ?????? ???????????????? ??????? ????’?????? ????????????? ????? ?? ?????????? ???????? ? ??????????? [PDF] from ukma.kiev.ua ?? ????????????… – 2009 – library.ukma.kiev.ua … The Mozart Programming System v. 1.4.0. – System available from official website: http://www. mozart-oz.org/; Programming Systems Lab, Saarbrücken, Swedish Institute of Computer Science, Stockholm, and Uni- versité catholique de Louvain, Louvain, 2008. … View as HTML – All 8 versions

[PDF] Explicit concurrent programming in high-level languages [PDF] from hut.fi K Kähkönen – 2009 – cs.hut.fi … Threads are cheap to create in Mozart (60 times faster than in Java 1.2) • All threads are run by Oz emulator (the main system thread of the process) • Mozart Programming System is an implementation of Oz 31 … 37 References [1] http://www.mozart-oz.org/ [2] http://jocaml.inria.fr/ … Related articles – View as HTML – All 4 versions

A Simple Parallel Reasoning System for the ALC mathcal {ALC} Description Logic A Meissner – … Collective Intelligence. Semantic Web, Social Networks …, 2009 – Springer … The MIT Press, Cambridge (2004) 6. Schulte, C.: Programming Constraint Services, PhD thesis. University of Saarlandes (2000) 7. The Mozart Programming System (2008), http://www.mozart- oz.org 8. World Wide Web Consortium, Semantic Web, http://www.w3.org/2001/sw/ Cited by 2 – Related articles – All 3 versions

ASTRA Resources on Constraint Programming P Flener – 2011 – it.uu.se … Constraint Programming framework (Haskell); Mozart Programming System , an advanced development platform for intelligent, distributed applications; NCL , the Natural Constraint Language; NumberJack , a constraint modelling … Cached

[HTML] Software Engineering and Programming Systems [HTML] from ucl.be N Ponet – 2010 – ucl.be … theoretical results and system building. Our research vehicle is often the Mozart Programming System, a full-featured development platform based on the Oz multiparadigm programming language. The Louvain Verification Lab … Cached – All 2 versions

DCaseLP: a prototyping environment for multi-language agent systems [PDF] from unige.it V Mascardi, M Martelli… – … and Development Tools for Multi-Agent …, 2008 – Springer … The Mozart Programming System. The Mozart Programming System [25] is an ad- vanced development platform for intelligent, distributed applications. It implements Oz 3, the latest in the Oz family of multi-paradigm languages based on the concurrent constraint model. … Cited by 6 – Related articles – All 10 versions

Highly-available collaborative Internet applications C Poncin – 2009 – uclouvain.be … These abstractions are made available as language libraries. Some of their functionality will eventually make its way into the basic language semantics. We are using the Mozart Programming System as our research vehicle. … Cached – All 4 versions

Solving Sudoku with Constraint Programming [PDF] from iss.ac.cn B Crawford, C Castro… – Cutting-Edge Research Topics on …, 2009 – Springer … Different published instances have been used from The Times2 and Minimum Sudoku page3. 1 www.mozart-oz.org 2 http://entertainment.timesonline.co.uk 3 http://people.csse.uwa.edu.au/ gordon/sudokumin.php Page 4. 348 B. Crawford, C. Castro, and E. Monfroy … Related articles – All 4 versions

Model-driven engineering of multi-target plastic user interfaces [PDF] from ucl.ac.be B Collignon, J Vanderdonckt… – … Systems, 2008. ICAS …, 2008 – ieeexplore.ieee.org … 507-520. [16] Mozart Consortium, The Mozart Programming System (Oz 3), accessible at http://www.mozart-oz.org/docu- mentation. [17] Puerta, AR, “A Model-Based Interface Development Environment”, IEEE Software 14,4 (July/August 1997), pp. 41-47. … Cited by 15 – Related articles – All 10 versions

A Dynamic Constraint Programming Approach E Monfroy, C Castro… – Cutting-Edge Research Topics on …, 2009 – Springer … The snapshots are taken every 80ms. Tests were run on an Athlon XP 2000 with 256 MB of RAM. We consider classical problems: 150-queens (Q150), 1 http://www.mozart- oz.org Page 4. 656 E. Monfroy, C. Castro, and B. Crawford … Related articles – All 2 versions

Intermediate language design of high-level language virtual machines: towards comprehensive concurrency support [PDF] from vub.ac.be S Marr, M Haupt… – Proceedings of the Third Workshop on …, 2009 – dl.acm.org … Similarly, hardware ISAs provide support for shared-memory concurrency: they offer a number of low-level operations to allow the efficient 1 http://doc.cat-v.org/inferno/4th_edition/ dis_VM_ specification 2 http://www.mozart-oz.org, Mozart 1.4 … Cited by 7 – Related articles – All 7 versions

Designing an Elastic and Scalable Social Network Application [PDF] from thinkmind.org X De Coster, M Ghilain, B Mejías… – … COMPUTING 2011, The …, 2011 – thinkmind.org … New York, NY, USA: ACM, 2008, pp. 41-48. [12] Mozart Consortium, “Mozart Programming System,” www.mozart-oz.org, 2011. 97 CLOUD COMPUTING 2011 : The Second International Conference on Cloud Computing, GRIDs, and Virtualization Copyright (c) IARIA, 2011. … Related articles – All 3 versions

[PDF] Algorithm performance for chessboard separation problems [PDF] from moreheadstate.edu RD Chatham, M Doyle, JJ Miller… – J. Combin. Math. …, 2009 – people.moreheadstate.edu … [9] W. Kosters, http://www.liacs.nl/home/kosters/nqueens.html (April 2002). [10] Mozart Programming System http://www.mozart-oz.org/ [11] OSCAR http://oscar.openclustergroup.org/. Page 16. [12] I. Rivin, I. Vardi, and P. Zimmermann, The n-queens problem, Amer. Math. … Cited by 2 – Related articles – View as HTML – All 8 versions

xMozart: A Novel Platform for Intelligent Task Migration M Wang, Y Shen, F Tang… – Complex, Intelligent and …, 2010 – ieeexplore.ieee.org … [4] Microsoft System Center Configuration Manager: http:// www. microsoft.com/systemcenter/ configurationmanager/en/us/default.aspx. [5] The Mozart Programming System: http: // www. mozart-oz. org/ [6] Gert Smolkal. … mozart-oz.org/home/doc/demo/trucks.html 805 Related articles – All 3 versions

[PDF] The abstract-concrete syntax distinction and unification in multilingual grammar [PDF] from psu.edu R Cooper – Resourceful Language Technology, 2008 – Citeseer Page 49. The Abstract-Concrete Syntax Distinction and Unification in Multilingual Grammar* Robin Cooper University of Gothenburg Department of Linguistics 1 Introduction We will characterize a notion of multilingual grammar … Cited by 2 – Related articles – View as HTML – All 14 versions

Programming language impact on the development of distributed systems D Ghosh, J Sheehy, KK Thorup… – Journal of Internet Services …, 2011 – Springer … http://www.erlang.org/ 21. A taste of 2.8: continuations. http://www.scala-lang.org/node/ 2096 22. The Mozart programming system. http://www.mozart-oz.org 23. Agents and asynchronous actions. http://clojure.org/agents 24. Software transactional memory. …

Compositional modelling of signalling pathways in timed concurrent constraint programming [PDF] from archives-ouvertes.fr D Chiarugi, M Falaschi, C Olarte… – Proceedings of the First …, 2010 – dl.acm.org … This tool is based on a interpreter of the ntcc calculus written in the Oz Languages (http://www. mozart-oz.org/). BioWayS takes as input a text file containing the initial pa- rameters of the simulation as well as the description of the equations. … Cited by 1 – Related articles – All 4 versions

An intelligent editor for multi-presentation user interfaces [PDF] from ucl.ac.be B Collignon, J Vanderdonckt… – Proceedings of the 2008 ACM …, 2008 – dl.acm.org … Eng. 30,8 (August 2004), 507-520. [13] Mozart Consortium, The Mozart Programming System (Oz 3). Ac- cessible at http://www.mozart-oz.org/documentation. [14] Puerta, AR A Model-Based Interface Development Environment. IEEE Software 14,4 (July/August 1997) 41-47. … Cited by 12 – Related articles – All 7 versions

[PDF] Improving the jmle Tool’s Constraint Solving Using Finite Domain Constraints [PDF] from dickinson.edu K Veil – 2011 – users.dickinson.edu … 1878, Springer-Verlag, September 2000, pp. 414 – 432. 6. Seif Haridi and Nils Franzen, Tutorial of Oz, http://www.mozart-oz.org/documentation/ tutorial/index.html, July 2008. 7. Andrew Hunt and David Thomas, The pragmatic programmer: From journeyman to master, ch. De- … View as HTML

[PDF] Constraint Programming Techniques for Generating Efficient Hardware Architectures For Field Programmable Gate Arrays [PDF] from usu.edu AK Shah – 2010 – ece.usu.edu … In this chapter, we introduce the concept of finite domain constraints, Oz programming language [23], and Mozart programming system [24]. We also discuss briefly the formulation … (3.1) The Mozart Programming System and constraint solver facilitates the development of … Related articles – View as HTML – Library Search – All 5 versions

[PDF] Implementing efficient propagation control [PDF] from kuleuven.be C Schulte… – Proc. TRICS, 2010 – people.cs.kuleuven.be … 12. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: engineering an efficient SAT solver. In DAC’01, pages 530-535, New York, NY, USA, 2001. ACM Press. 13. The Mozart programming system, 2009. http://www. mozart-oz. org. 14. … Cited by 2 – Related articles – View as HTML – All 3 versions

Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic [PDF] from icm.edu.pl A Meissner – International Journal of Applied Mathematics and …, 2011 – Versita … Each space in the tree is additionally labelled by a set of numbers which identify tableau nodes corresponding to the space. The Mozart programming system provides vari- ous library classes of engines implementing different search strategies. … Cited by 3 – Related articles – All 4 versions

A Parallel Deduction for Description Logics with ALC Language A Meissner… – Knowledge-Driven Computing, 2008 – Springer … In this paper we propose to achieve this effect by the use of constraint pro- gramming methodology, particularly by parallel constraint solving technique, which is supported by the Mozart programming system. Hence, we presume Page 10. … Cited by 1 – Related articles – All 2 versions

Using Constraints over Finite Sets of Integers for Range Concatenation Grammar Parsing [PDF] from cru.fr Y Parmentier… – Advances in Natural Language Processing, 2008 – Springer … 3 For a detailed introduction to CSP, please refer to [5]. 4 See http://www.mozart-oz.org and http://www.gecode.org 5 Note that (a) the RCGs we handle in our system are built automatically from lex- icalized tree-based grammars, thus the arguments of a predicate often contain … Cited by 4 – Related articles – All 8 versions

Expressive Models for Monadic Constraint Programming [PDF] from kuleuven.be P Wuille… – … of the 9th International Workshop on …, 2010 – lirias.kuleuven.be Page 1. Expressive Models for Monadic Constraint Programming Pieter Wuille and Tom Schrijvers? Department of Computer Science, KULeuven, Belgium FirstName.LastName @cs.kuleuven.be Abstract. This paper presents … Cited by 1 – Related articles – All 10 versions

Generation of attack scenarios by modeling algorithms for evaluating IDS M Saber, T Bouchentouf… – … Computing and Systems ( …, 2011 – ieeexplore.ieee.org … The implementation of solving algorithms for this problem uses several languages such as Mozart (The Mozart Programming System), Jacop (Java Constraint Programming Library), ILOG (IBM ILOG CPLEX CP Optimizer) and the java library of Choco solver (java library for … Cited by 1 – Related articles

A semantic QoS-aware discovery framework for web services [PDF] from upt.ro Q Ma, H Wang, Y Li, G Xie… – Web Services, 2008. ICWS’ …, 2008 – ieeexplore.ieee.org Page 1. A Semantic QoS-Aware Discovery Framework for Web Services Qian MA, Hao WANG, Ying LI, Guotong XIE, Feng LIU IBM China Research Laboratory, Beijing, 100094, China. E-mail: { maqian, wanghcrl, lying, xieguot, liufcrl }@cn.ibm.com Abstract … Cited by 16 – Related articles – All 4 versions

A Genetic Local Search Algorithm for the Multiple Optimisation of the Balanced Academic Curriculum Problem C Castro, B Crawford… – Cutting-Edge Research Topics on …, 2009 – Springer … To carry out the tests we have used an Athlon XP 3200+ with 512 MB RAM. The following table presents the results obtained using version 1.3.0 of Oz (www.mozart-oz.org): Time (seconds) ?c (credits ?c1 (credits ?c2 (credits ?c3 (credits 1 4 4 4 4 … Related articles – All 2 versions

Concurrent software engineering: Preparing for paradigm shift [PDF] from unr.edu.ar P Grogono… – Proceedings of the 2008 C 3 S 2 E …, 2008 – dl.acm.org … The Mozart Programming System [42] is based on the lan- guage Oz, which supports”declarative programming, object- oriented programming, constraint programming, and con- currency as part of a coherent whole … Activities and 4Quoted from www.mozart-oz.org on 2008/03/15. … Cited by 5 – Related articles – All 6 versions

SATOULOUSE: the computational power of propositional logic shown to beginners O Gasquet, F Schwarzentruber… – Tools for Teaching Logic, 2011 – Springer … problems. These tools have clear merits for 4 http://fmv.jku.at/limboole 5 http://www.cs.nyu.edu/acsys/cvc3/ 6 http://www.mozart-oz.org 7 http://alloy.mit.edu/ Page 8. 84 O. Gasquet, F. Schwarzentruber, M. Strecker professional … Related articles – All 3 versions

On complementary principles of object-oriented constraint programming VA Semenov, KV Dragalov, DV Ilyin… – … and Computer Software, 2010 – Springer Page 1. ISSN 0361 7688, Programming and Computer Software, 2010, Vol. 36, No. 5, pp. 264-275. (c) Pleiades Publishing, Ltd., 2010. Original Russian Text (c) VA Semenov, KV Dragalov, DV Ilyin, SV Morozov, OV Sidyaka, 2010, published in Programmirovanie, 2010, Vol. … Related articles – All 6 versions

[PDF] Measuring With Jugs: A Solution in Finite Domain [PDF] from ucmss.com CR Ritchey Jr, R Abbott… – 2008 – ww1.ucmss.com … Smolka, “Finite Domain Constraint Programming in Oz: a Tutorial”. (Viewable online at http://www.mozart-oz.org/documentation/fdt/node15.html#section.problem.moneyy) [3] M Tran, T Pfaf “The N-Jugs and Water Problem”, 2005 Related articles – View as HTML – All 4 versions

Code-carrying theory A Vargun… – Proceedings of the 2008 ACM symposium on …, 2008 – dl.acm.org Page 1. Code-Carrying Theory Aytekin Vargun Rensselaer Polytechnic Institute 110 8th St., Troy, NY, 12180, USA varguna@gmail.com David R. Musser Rensselaer Polytechnic Institute 110 8th St., Troy, NY, 12180, USA musser@cs.rpi.edu … Cited by 10 – Related articles

Foundations of and Recent Advances in Arti?cial Life Modeling with Repast 3 and Repast Simphony MJ North… – Artificial Life Models in Software, 2009 – books.google.com Page 54. Chapter 2 Foundations of and Recent Advances in Arti?cial Life Modeling with Repast 3 and Repast Simphony Michael J. North and Charles M. Macal 2.1 Introduction Arti?cial life focuses on synthesizing “life-like behaviors … Cited by 4 – Related articles – All 3 versions

[PDF] Generation of attack scenarios by modeling CSP for Evaluating and Testing Intrusion Detection System [PDF] from ijcsns.org M Saber, T Bouchentouf, MG Belkasmi… – … International Journal of …, 2010 – paper.ijcsns.org … 119-124, 2006. [19][MOZART 2010] : http://www.mozart-oz.org. [20] http://jacop.cs.lth. se/ [21]http://www- 01.ibm.com/software/integration/optimization/cplex-cp- optimizer/ [22] http://www.emn.fr/z-info/choco-solver/ [23] http://www.zkoss.org/ … Cited by 1 – Related articles – View as HTML – All 2 versions

Geospatial route extraction from texts [PDF] from gmu.edu E Drymonas… – Proceedings of the 1st ACM SIGSPATIAL …, 2010 – dl.acm.org … 1 Example site with penn tagset: http://www.mozart- oz.org/mogul/doc/lager/brill- tagger/penn.html 32 Page 5. +, *) and iteration range operators (ex in the above rule {1,5} means 1 to 5 times of consecutive uppercase tokens). … Cited by 2 – Related articles – All 6 versions

[PDF] Modular grammar design with typed parametric principles [PDF] from stanford.edu R Debusmann, D Duchier… – Proceedings of FG- …, 2009 – cslipublications.stanford.edu Page 125. 11 Modular Grammar Design with Typed Parametric Principles Ralph Debusmann, Denys Duchier and Andreas Rossberg Abstract This paper introduces a type system for Extensible Dependency Grammar (xdg)(Debusmann … Cited by 5 – Related articles – View as HTML – All 2 versions

The composability problem of events and threads in distributed systems H Li, Y Peng… – Education Technology and Computer ( …, 2010 – ieeexplore.ieee.org … [4] The erlang programming language, http://erlang.org. [5] The oz programming language, http://www.mozart-oz.org. [6] ABELSON, H., SUSSMAN, GJ, AND SUSSMAN, J. Structure and interpretation of computer programs. MIT Press, Cambridge, MA, USA, 1985. … Cited by 1 – Related articles

[PDF] LS (Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs [PDF] from ucl.ac.be QD Pham, PYDP ICTEAM, PCPE ICTEAM… – 2011 – info.ucl.ac.be Page 1. ICTEAM, pôle d’Ingénierie Informatique Ecole polytechnique de Louvain Université catholique de Louvain Louvain-la-Neuve, Belgium LS(Graph): A constraint-based local search framework for constrained optimum trees and paths problems on graphs … Related articles – View as HTML – All 3 versions

[PDF] Programming paradigms for dummies: what every programmer should know [PDF] from luth.se P Van Roy – New Computational Paradigms for Computer Music, 2009 – sm.luth.se … This resulted in the Mozart Programming System which implements Distributed Oz and was first released in 1999 [22, 34]. Recent work has both simplified Mozart and increased its power for building fault-tolerance abstractions [10]. … Cited by 6 – Related articles – View as HTML – All 12 versions

[PDF] A model-based approach for distributed user interfaces [PDF] from ucl.ac.be J Melchior, J Vanderdonckt… – Full paper accepted for …, 2011 – info.ucl.ac.be … ACM Trans. Comp.-Hum. Interact. 5, 1 (1998), 34- 62. 12. Distributed Programming in Mozart-A Tutorial Introduction, chapter 3: Basic Operations and Examples, accessible at http://www.mozart-oz.org/documentation/dstutorial/node3. html#chapter.examples 13. … Cited by 4 – Related articles – View as HTML – All 2 versions

Galatea: A discourse modeller supporting concept-level error handling in spoken dialogue systems [PDF] from psu.edu G Skantze – Recent Trends in Discourse and Dialogue, 2008 – Springer … 3.3 Pickering: The Semantic Interpreter The interpreter developed within HIGGINS is called PICKERING and is im- plemented in Oz (http://www.mozart-oz.org/). The grammar used to parse re- cognition results is based on context-free grammars, with some modifications. … Cited by 25 – Related articles – All 14 versions

[PDF] Cross-framework Grammar Engineering using Constraint-driven Metagrammars [PDF] from ruc.dk D Duchier, Y Parmentier, S Petitjean – Constraints and Language …, 2011 – control.ruc.dk Page 32. Cross-framework Grammar Engineering using Constraint-driven Metagrammars Denys Duchier, Yannick Parmentier, and Simon Petitjean LIFO, Université d’Orléans, F-45067 Orléans Cedex 2, France, firstname. lastname@ univ-orleans. … Related articles – View as HTML – All 2 versions

Programming with partially specified aggregates in Java [PDF] from unipr.it F Bergenti, L Chiarabini… – Computer Languages, Systems & …, 2011 – Elsevier … [24] The Mozart Consortium (2006). The Mozart programming system. http://www.mozart-oz.org. [25] Rossi, G., Panegai, E., and Poleo, E. (2007) JSetL: A Java Library for Supporting Declarative Programming in Java. Software-Practice & Experience, 37:115-149. [26] Zhou, NF. … Related articles – All 4 versions

[HTML] Programming Paradigms for Dummies: What Every Programmer Should Know [HTML] from mendeley.com PV Roy – dmiunictit, 2009 – mendeley.com … This resulted in the Mozart Programming System which implements Distributed Oz and was rst released in 1999 [22, 34]. Recent work has both simpli ed Mozart and increased its power for building fault-tolerance abstractions [10]. … Related articles – Cached

Formal Reasoning about Software Object Translations V Berzins… – Foundations of Computer Software. Future Trends …, 2010 – Springer … 52 V. Berzins, Luqi, and PM Musial and concurrent programming. Oz has both a simple formal semantics and an efficient implementation – The Mozart Programming System [25]. Oz is a concurrency-oriented language that makes concurrency both easy to use and efficient. … Related articles

A CP formulation for scheduling multiproduct multistage batch plants LJ Zeballos, JM Novas… – Computers & Chemical …, 2011 – Elsevier Cited by 2 – Related articles

[PDF] A Solution-clusters Based Approach to Solve Hard Constraint Satisfaction Problems [PDF] from vanderbilt.edu H Neema – 2008 – w3.isis.vanderbilt.edu Page 1. A SOLUTION-CLUSTERS BASED APPROACH TO SOLVE HARD CONSTRAINT SATISFACTION PROBLEMS By Himanshu Neema Thesis Submitted to the Faculty of the Graduate School of Vanderbilt University in partial fulfillment of the requirements for the degree of … Related articles – View as HTML – Library Search – All 4 versions

Improving the peer-to-peer ring for building fault-tolerant grids [PDF] from ucl.ac.be B Mejías, D Grolaux… – Grid and Services Evolution, 2009 – Springer … [9] Mozart Community. The Mozart-Oz programming system. http://www.mozart-oz.org. [10] Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. … Cited by 1 – Related articles – All 10 versions

Virtual machine support for many-core architectures: Decoupling abstract from concrete concurrency models [PDF] from arxiv.org S Marr, M Haupt, S Timbermont, B Adams… – Arxiv preprint arXiv: …, 2010 – arxiv.org … 4T/L: threads and locks 5http://luajit.org/ 6A Squeak VM developed at IBM Research [40] for the TILE64 7http://www.cacaovm.org/ 8http://www.mozart-oz.org 9http://research.sun.com/projects/ maxine/ 10http://doc.cat-v.org/inferno/4th_edition/dis_VM_specification 11CSP … Cited by 9 – Related articles – All 6 versions

Scope underspecification with tree descriptions: Theory and practice [PDF] from uni-saarland.de A Koller, S Thater… – Resource-Adaptive Cognitive Processes, 2009 – Springer Page 1. Scope Underspecification with Tree Descriptions: Theory and Practice Alexander Koller, Stefan Thater, and Manfred Pinkal 1 Introduction Scope underspecification is the standard technique used in computational linguistics … Related articles – All 7 versions

Using Constraint Programming to solve Sudoku Puzzles B Crawford, M Aranda, C Castro… – … and Hybrid Information …, 2008 – ieeexplore.ieee.org … 1www.mozart-oz.org 927 Page 3. of tie always the smaller value is selected. Immediately Greater Value to the Average Value of the Domain (GAV): this heuristics selects the smaller value of the domain that it is greater as well to the average value of the domain. … Cited by 3 – Related articles – All 3 versions

Finite domain constraints based delay aware placement tool for fpoas R Saraswat… – Reconfigurable Computing and …, 2008 – ieeexplore.ieee.org … 2, May 2005. [7] K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. MIT Press, Cambridge, MA, 1998. [8] http://www.mozart-oz.org/, May 2003. [9] A. Sharma, C. Ebeling, and S. Hauck. Architecture-adaptive routability-driven placement for FPGAs. … Cited by 1 – Related articles – All 3 versions

View-based Propagator Derivation [PDF] from arxiv.org C Schulte… – Arxiv preprint arXiv:0908.2050, 2009 – arxiv.org Page 1. arXiv:0908.2050v1 [cs.AI] 14 Aug 2009 View-based Propagator Derivation Christian Schulte ICT, KTH – Royal Institute of Technology, Sweden, cschulte@kth.se Guido Tack Programming Systems Lab, Saarland University, Germany, tack@ps.uni-sb.de … Cited by 1 – Related articles – All 13 versions

Universal concurrent constraint programing: symbolic semantics and applications to security [PDF] from inria.fr C Olarte… – Proceedings of the 2008 ACM symposium on …, 2008 – dl.acm.org … This illustrates the relevance of the symbolic se- mantics and the correspondence in Theorem 3. 7. CONCLUDING REMARKS From a practical point of view, we have implemented in Oz (http://www.mozart-oz.org/) a prototype of an inter- preter executing programs written in utcc. … Cited by 22 – Related articles – All 10 versions

[PDF] Finite Domain Constraint Programming Systems [PDF] from sdu.dk F Rossi, P Van Beek, T Walsh, C Schulte… – 2008 – imada.sdu.dk Page 1. Handbook of Constraint Programming 495 Francesca Rossi, Peter van Beek, Toby Walsh cO 2006 Elsevier All rights reserved Chapter 14 Finite Domain Constraint Programming Systems Christian Schulte and Mats Carlsson … Related articles – View as HTML – All 8 versions

A Reactive Constraint Programming Formulation E Monfroy, C Castro… – Artificial Intelligence, 2009. …, 2009 – ieeexplore.ieee.org … The last column (Ps) represents the average performance 1http://www.mozart-oz.org Table I min ENUMERATION STRATEGIES VS. DYNAMIC STRATEGIES OVER min R150 R250 M10 M11 L20 L25 Ps minMin 0 0 100 100 0 0 33 minMax 0 0 100 100 0 0 33 … Related articles – All 3 versions

Lazy clause generation reengineered [PDF] from mu.oz.au T Feydy… – Principles and Practice of Constraint Programming- …, 2009 – Springer Page 1. Lazy Clause Generation Reengineered Thibaut Feydy and Peter J. Stuckey National ICT Australia, Victoria Laboratory Department of Computer Science and Software Engineering The University of Melbourne, Australia {tfeydy,pjs}@csse.unimelb.edu.au Abstract. … Cited by 14 – Related articles – All 7 versions

A toolkit for peer-to-peer distributed user interfaces: concepts, implementation, and applications [PDF] from ucl.ac.be J Melchior, D Grolaux, J Vanderdonckt… – Proceedings of the 1st …, 2009 – dl.acm.org Page 1. A Toolkit for Peer-to-Peer Distributed User Interfaces: Concepts, Implementation, and Applications Jérémie Melchior1, Donatien Grolaux1,2, Jean Vanderdonckt1, Peter Van Roy2 Université catholique de Louvain, – B … Cited by 18 – Related articles – All 4 versions

Beernet: RMI-free peer-to-peer networks [PDF] from ucl.ac.be B Mejías, A Cádiz… – … of the 1st International Workshop on …, 2009 – dl.acm.org Page 1. Beernet: RMI-free peer-to-peer networks Boris Mejías, Alfredo Cádiz, Peter Van Roy Département d’ingénierie informatique Université catholique de Louvain, Belgium {firstname.lastname}@uclouvain.be ABSTRACT … Cited by 1 – Related articles – All 3 versions

Modularity and compositionality in Jason [PDF] from imamu.edu.sa N Madden… – Programming Multi-Agent Systems, 2010 – Springer Page 1. Modularity and Compositionality in Jason Neil Madden and Brian Logan School of Computer Science University of Nottingham, UK {nem,bsl}@cs.nott.ac. uk Abstract. In this paper, we present our experiences using the … Cited by 12 – Related articles – All 10 versions

PALTA: Peer-to-peer AdaptabLe Topology for Ambient intelligence [PDF] from ucl.ac.be A Cádiz, B Mejías, J Vallejos… – … , 2008. SCCC’08. …, 2008 – ieeexplore.ieee.org Page 1. PALTA: Peer-to-peer AdaptabLe Topology for Ambient intelligence Alfredo Cádiz1, Boris Mejias1, Jorge Vallejos2, Kim Mens1, Peter Van Roy1, Wolfgang de Meuter2 1 Département d’ingénierie informatique, Université … Cited by 2 – Related articles – All 10 versions

On the use of DesertFD to generate custom architectures for H. 264 motion estimation R Saraswat… – … , 2008. ECBS 2008. 15th Annual IEEE …, 2008 – ieeexplore.ieee.org Page 1. On the Use of DesertFD to Generate Custom Architectures for H.264 Motion Estimation Rohit Saraswat and Brandon Eames Utah State University Department of Electrical and Computer Engineering Logan, UT, 84321 … Cited by 3 – Related articles – All 4 versions

[PDF] The relaxed-ring: a fault-tolerant topology for structured overlay networks [PDF] from ist-selfman.org B Mejías… – Parallel Processing Letters, 2008 – ist-selfman.org Page 1. March 27, 2009 15:4 WSPC/INSTRUCTION FILE relaxed-ring Parallel Processing Letters c(c) World Scientific Publishing Company THE RELAXED-RING: A FAULT- TOLERANT TOPOLOGY FOR STRUCTURED OVERLAY NETWORKS … Cited by 6 – Related articles – View as HTML – All 10 versions

Dependency grammar: Classification and exploration [PDF] from psu.edu R Debusmann… – Resource-Adaptive Cognitive Processes, 2009 – Springer Page 1. Dependency Grammar: Classification and Exploration Ralph Debusmann and Marco Kuhlmann 1 Introduction Syntactic representations based on word-to-word dependencies have a long tradition in descriptive linguistics … Cited by 6 – Related articles – All 25 versions

[PDF] Fine-Grain Parallelism [PDF] from wpi.edu E Archambault – 2010 – wpi.edu … Oz [14] is a textual language developed for programming language education. It’s design focuses on a simple syntax that can be expanded through the use of syntactic sugar. Its primary implementation is the Mozart Programming System, released with an open-source license. … Related articles – View as HTML – All 3 versions

A constraint programming approach to tool allocation and production scheduling in flexible manufacturing systems LJ Zeballos – Robotics and Computer-Integrated Manufacturing, 2010 – Elsevier Cited by 4 – Related articles – All 3 versions

O’browser: objective caml on browsers [PDF] from jussieu.fr B Canou, V Balat… – … of the 2008 ACM SIGPLAN workshop …, 2008 – dl.acm.org Page 1. O’Browser: Objective Caml on browsers Benjamin Canou1,2, * 1 Laboratoire d’Informatique de Paris 6 LIP6 – CNRS UMR 7606 Université Pierre et Marie Curie – Paris 6 Case 169, 75252 Paris Cedex 05, France Benjamin.Canou@lip6.fr … Cited by 10 – Related articles – All 7 versions

An overview of the ciao multiparadigm language and program development environment and its design philosophy [PDF] from fh-regensburg.de M Hermenegildo, F Bueno, M Carro… – … , Graphs and Models, 2008 – Springer Page 1. An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy MV Hermenegildo, F. Bueno, M. Carro, P. López, JF Morales, and G. Puebla IMDEA Institute for … Cited by 15 – Related articles – BL Direct – All 6 versions

A framework for abstract interpretation of timed concurrent constraint programs [PDF] from inria.fr M Falaschi, C Olarte… – Proceedings of the 11th ACM …, 2009 – dl.acm.org Page 1. A Framework for Abstract Interpretation of Timed Concurrent Constraint Programs Moreno Falaschi Dipartimento di Scienze Matematiche e Informatiche. Universit`a di Siena, Italy. moreno.falaschi@unisi.it Carlos Olarte … Cited by 2 – Related articles – All 9 versions

A constraint programming model for the scheduling of flexible manufacturing systems with machine and tool limitations LJ Zeballos, OD Quiroga… – Engineering Applications of …, 2010 – Elsevier Cited by 8 – Related articles – All 2 versions

[PDF] Beernet: Building self-managing decentralized systems with replicated transactional storage [PDF] from ucl.ac.be B Mejias… – IJARAS: International Journal of …, 2010 – beernet.info.ucl.ac.be Page 1. Beernet: Building Self-Managing Decentralized Systems with Replicated Transactional Storage Boris Mejias and Peter Van Roy Département d’ingénierie informatique Université catholique de Louvain, Belgium {firstname.lastname}@uclouvain.be … Cited by 7 – Related articles – View as HTML – All 8 versions

[PDF] Sobre o uso da Gramática de Dependência Extensível na Geração de Língua Natural: questões de generalidade, instanciabilidade e complexidade [PDF] from usp.br JM Pelizzoni… – 2008 – pandora.cisc.usp.br Page 1. Sobre o uso da Gramática de Dependência Extensível na Geração de Língua Natural: questões de generalidade, instanciabilidade e complexidade Jorge Marques Pelizzoni Orientadora: Profa. Dra. Maria das Graças Volpe Nunes … Related articles – All 6 versions

[PDF] The Holumbus Framework [PDF] from fh-wedel.de S Schmidt… – 2009 – holumbus.fh-wedel.de Page 1. Department of Computer Science Master’s Thesis The Holumbus Framework Distributed computing with MapReduce in Haskell Submitted on: February 26th, 2009 Submitted by: Stefan Schmidt Dipl. Ing. (FH) Preesterkoppel … Related articles – View as HTML – All 5 versions

A finite domain constraint approach for placement and routing of coarse-grained reconfigurable architectures [PDF] from usu.edu R Saraswat – 2010 – digitalcommons.usu.edu Page 1. Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies, School of 5-1-2010 A Finite Domain Constraint Approach for Placement and Routing of Coarse-Grained Reconfigurable Architectures … Cited by 1 – Related articles – All 2 versions

Analysis of the reachability problem in fragments of the Pi-calculus [PDF] from archives-ouvertes.fr L Pino – 2010 – hal.archives-ouvertes.fr Page 1. Undergraduate Thesis Report Analysis of the reachability problem in fragments of the p-calculus Luis Fernando Pino Duque del Valle Universidad Universidad del Valle Facultad de Ingenier´ia Escuela de Ingenier´ia de Sistemas y Computación Santiago de Cali 2010 … Related articles – All 4 versions

[PDF] Debugging constraint propagation [PDF] from uni-saarland.de N Paltzer – Master’s thesis, Saarland Univerity, Germany (March …, 2008 – ps.uni-saarland.de Page 1. Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science Master’s Program in Computer Science Master’s Thesis Debugging Constraint Propagation submitted by Niko Paltzer on March 17, 2008 Supervisor Prof. … Cited by 1 – Related articles – View as HTML – All 8 versions

Building an efficient, scalable, and trainable probability-and-rule-based part-of-speech tagger of high accuracy [PDF] from uga.edu J Han – 2009 – ugakr.libs.uga.edu Page 1. BUILDING AN EFFICIENT, SCALABLE, AND TRAINABLE PROBABILITY- AND-RULE- BASED PART-OF-SPEECH TAGGER OF HIGH ACCURACY by JIAYUN HAN (Under the Direction of Michael Covington) ABSTRACT … Related articles – Library Search – All 6 versions

[HTML] Modelling Syntactic Gradience with Loose Constraint-based Parsing 8 Modélisation de la gradience syntaxique par analyse relâchéea base de contraintes [HTML] from archives-ouvertes.fr JP Prost – 2009 – halshs.archives-ouvertes.fr Page 1. MACQUARIE UNIVERSITY, SYDNEY, AUSTRALIA Centre for Language Technology Department of Computing Division of Information and Communication Sciences and UNIVERSITÉ DE PROVENCE, FRANCE UFRMIM … Related articles – Library Search – All 10 versions

[BOOK] Open Source software B Štedron – 2009 – books.google.com Page 1. ^?2 ? ?????? ??? I ???1 ??? Page 2. Page 3. MoJo knihy “Se sowarem je to jako se sexem, nejradši to mám, když je to legálne a zadarmo.” Neznámý open-source vývojár Page 4. Page 5. Open Source software ve verejné správe a soukromém sektoru JUDr. … Library Search

Diseño, implementación y corrección de GraPiCO: un cálculo visual, orientado al objeto y por restricciones compilado a PiCO [PDF] from usb.edu.co CA Tavera Romero – 2011 – bibliotecadigital.usb.edu.co … En el 1996 el grupo AVISPA8 se interesó por la investigación en la solución de problemas que involucran el empleo de restricciones e inició el desarrollo de un cálculo para modelar 7www.mozart-oz.org 8Ambientes VISuales de Programación aplicativa, http://avispa.puj.edu … All 2 versions

[PDF] Ontology-Based Modeling and Recommendation Techniques for Adaptive Hypermedia Systems [PDF] from infoiasi.ro T Jucan… – 2008 – infoiasi.ro Page 1. University “Alexandru Ioan Cuza” of Iasi Faculty of Computer Science T E C H N I C A L R E P O R T Ontology-Based Modeling and Recommendation Techniques for Adaptive Hypermedia Systems Mihaela Brut TR 09-04, December 2009 ISSN 1224-9327 … Related articles – View as HTML – All 4 versions

[PDF] A contextual semantics for concurrent Haskell with futures [PDF] from uni-frankfurt.de D Sabel, M Schmidt-Schauß – … of the 13th …, 2011 – publikationen.ub.uni-frankfurt.de Page 1. A Contextual Semantics for Concurrent Haskell with Futures David Sabel and Manfred Schmidt-Schauß Dept. Informatik und Mathematik, Inst. Informatik, JW Goethe-University, PoBox 11 19 32, D-60054 Frankfurt, Germany, {sabel,schauss}@ki.informatik.uni-frankfurt.de … Cited by 1 – Related articles – View as HTML – All 6 versions

Un nuevo paradigma para los servicios en un ambiente virtual [PDF] from umich.mx C Rojas… – 2011 – bibliotecavirtual.dgb.umich.mx Page 1. Universidad Michoacana de San Nicolás de Hidalgo Facultad de Contaduría y Ciencias Administrativas -servicios Un nuevo paradigma para los servicios en un ambiente virtual TESIS PARA OBTENER EL GRADO DE MAESTRÍA EN CIENCIAS ADMINISTRATIVAS …

DesertFD: a finite-domain constraint based tool for design space exploration BK Eames, SK Neema… – Design Automation for Embedded …, 2010 – Springer Page 1. Des Autom Embed Syst (2010) 14: 43-74 DOI 10.1007/s10617-009-9049- z DesertFD: a finite-domain constraint based tool for design space exploration Brandon K. Eames · Sandeep K. Neema · Rohit Saraswat Received … Cited by 5 – Related articles – All 2 versions

Efficient constraint propagation engines [PDF] from arxiv.org C Schulte… – ACM Transactions on Programming Languages …, 2008 – dl.acm.org Page 1. 2 Efficient Constraint Propagation Engines CHRISTIAN SCHULTE KTH – Royal Institute of Technology, Sweden and PETER J. STUCKEY NICTA Victoria Laboratory, University of Melbourne, Australia This article presents … Cited by 44 – Related articles – All 22 versions

Enhancing set constraint solvers with lexicographic bounds [PDF] from guc.edu.eg A Sadler… – Journal of Heuristics, 2008 – Springer Page 1. J Heuristics (2008) 14: 23-67 DOI 10.1007/s10732-007-9028-0 Enhancing set constraint solvers with lexicographic bounds Andrew Sadler · Carmen Gervet Received: 13 December 2005 / Revised: 11 September 2006 … Cited by 18 – Related articles – BL Direct – All 4 versions

(Visited 75 times, 1 visits today)