- Haskell - Haskell.org

Re: [Haskell] [Haskell-cafe] Chordify, a new web startup using Haskell
by Thiago Negri 18 Jan '13

18 Jan '13

Is it possible to play the generated chords as a melody by itself, without the original music over it? 2013/1/18 Alfredo Di Napoli <alfredo.dinapoli(a)gmail.com> > Congratulations! > Keep up the good work, especially in using Haskell at a commercial level :) > > Bye! > Alfredo > > > On 18 January 2013 07:34, Alp Mestanogullari <alpmestan(a)gmail.com> wrote: > >> That's awesome, works like a charm on the samples I've tried it on! >> Cheers to the Chordify team, I will use it and give any useful feedback if >> I have any. >> >> >> On Fri, Jan 18, 2013 at 12:07 AM, José Pedro Magalhães <jpm(a)cs.uu.nl>wrote: >> >>> Hi all, >>> >>> I'd like to introduce Chordify <http://chordify.net/> [1], an online >>> music player that extracts chords from musical sources like Soundcloud, >>> Youtube or your own files, and shows you which chord to play when. Here's >>> an example song: >>> http://chordify.net/chords/passenger-let-her-go-official-video-passengermus… >>> >>> The aim of Chordify is to make state-of-the-art music technology >>> accessible to a broader audience. Behind the scenes, Chordify uses the >>> HarmTrace Haskell package to compute chords from audio. I've been working >>> on this project with a couple of colleagues for a while now, and recently >>> we have made the website public, free to use for everyone. >>> >>> We do not use Haskell for any of the frontend/user interface, but the >>> backend is entirely written in Haskell (and it uses pretty advanced >>> features, such as GADTs and type families [3]). We're particularly >>> interested in user feedback at this stage, so if you're interested in music >>> and could use an automatic chord transcription service, please try Chordify! >>> >>> >>> Cheers, >>> Pedro >>> >>> [1] http://chordify.net/ >>> [2] http://hackage.haskell.org/package/HarmTrace >>> [3] José Pedro Magalhães and W. Bas de Haas. Functional Modelling of >>> Musical Harmony: an Experience Report. In Proceedings of the 16th ACM >>> SIGPLAN International Conference on Functional Programming (ICFP'11), pp. >>> 156–162, ACM, 2011. http://dreixel.net/research/pdf/fmmh.pdf >>> >>> >>> _______________________________________________ >>> Haskell-Cafe mailing list >>> Haskell-Cafe(a)haskell.org >>> http://www.haskell.org/mailman/listinfo/haskell-cafe >>> >>> >> >> >> -- >> Alp Mestanogullari >> >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe(a)haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >> >> > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > >

1 0

TAP 2013: Final Call for Papers
by Achim D. Brucker 18 Jan '13

18 Jan '13

(Apologies if you receive this announcement multiple times.) !LNCS publication is confirmed! **************************************************** *** *** *** TAP 2013 *** *** *** *** Abstract submission: January 25, 2013 *** *** Paper submission: February 1, 2013 *** **************************************************** *** TAP 2013 solicits both full papers and *** *** (industrial) experience/tool papers *** *** in combining proofs and (security) testing *** **************************************************** CALL FOR PAPERS 7th INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) http://www.spacios.eu/TAP2013 Budapest, Hungary, June 18-19, 2013 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security Important Dates: ================ Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 Program Chairs: =============== Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) Program Committee: ================== Paul Ammann Dirk Beyer Achim D. Brucker Robert Clarisò Marco Comini Catherine Dubois Juhan Ernits Gordon Fraser Angelo Gargantini Christoph Gladisch Martin Gogolla Arnaud Gotlieb Wolfgang Grieskamp Reiner Hähnle Bart Jacobs Thiérry Jeron Jacques Julliand Gregory Kapfhammer Nikolai Kosmatov Victor Kuliamin Michael Leuschel Karl Meinke Alexandre Petrenko Holger Schlingloff T.H. Tse Margus Veanes (co-chair) Luca Viganò (co-chair) Burkhart Wolff Fatiha Zaidi Submission: =========== Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ -- Dr. Achim D. Brucker, SAP AG, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch/

1 0

Chordify, a new web startup using Haskell
by José Pedro Magalhães 17 Jan '13

17 Jan '13

Hi all, I'd like to introduce Chordify <http://chordify.net/> [1], an online music player that extracts chords from musical sources like Soundcloud, Youtube or your own files, and shows you which chord to play when. Here's an example song: http://chordify.net/chords/passenger-let-her-go-official-video-passengermus… The aim of Chordify is to make state-of-the-art music technology accessible to a broader audience. Behind the scenes, Chordify uses the HarmTrace Haskell package to compute chords from audio. I've been working on this project with a couple of colleagues for a while now, and recently we have made the website public, free to use for everyone. We do not use Haskell for any of the frontend/user interface, but the backend is entirely written in Haskell (and it uses pretty advanced features, such as GADTs and type families [3]). We're particularly interested in user feedback at this stage, so if you're interested in music and could use an automatic chord transcription service, please try Chordify! Cheers, Pedro [1] http://chordify.net/ [2] http://hackage.haskell.org/package/HarmTrace [3] José Pedro Magalhães and W. Bas de Haas. Functional Modelling of Musical Harmony: an Experience Report. In Proceedings of the 16th ACM SIGPLAN International Conference on Functional Programming (ICFP'11), pp. 156–162, ACM, 2011. http://dreixel.net/research/pdf/fmmh.pdf

1 0

ANNOUNCE: MFlow 0.2
by Alberto G. Corona 17 Jan '13

17 Jan '13

Hello. haskellers and, specially, web developpers. This is the second version of MFlow, a deep-first effort in the development of a platform for web applications at the higher level, by including as much haskell magic as possible. It is at the same time experimental and intended to be used in industry. I believe that haskell will not have its chance in the Web if it does not bring unique advantages and challenging paradigms beyond speed and type safety. Deep-first means that the effort is more in the addition higher level features rather than in being complete and bug free, with the conviction that feedback from real usage at the highest level is the best guide for development. Rather than to mimic other platforms in other languages, MFlow is as Haskell'ish as possible, and introduces new approaches like statefulness, event sourcing, back-execution, composable, active, self contained widgets and persistent STM. All of them collaborate to create a high level environment for web programming. This release adds bidings for WAI, blaze-html, stateful AJAX, active widgets, requirements, content management, multilanguage and URLs to pages inside stateful procedures. The package: [http://hackage.haskell.org/package/MFlow The entry in my blog, with the announcement and the philosophy behind http://haskell-web.blogspot.com.es/2013/01/announce-mflow-02.html The same, in other words: http://haskell-web.blogspot.com.es/2012/12/on-spirit-of-mflow-anatomy-of-wi… An online example, with some links that explain the new features. http://81.169.134.95:8081 Stateful, but virtually stateless, thanks to event sourcing http://haskell-web.blogspot.com/2013/01/stateful-but-stateless-at-last-than… Example of use of active widgets http://haskell-web.blogspot.com.es/2013/01/now-example-of-use-of-active-wid… Bug tracker https://github.com/agocorona/MFlow/issues Source repository git clone http://github.com/agocorona/MFlow Feedback is welcomed warmly Alberto.

1 0

CFP: EOOLT 2013
by Henrik Nilsson 17 Jan '13

17 Jan '13

Dear Haskellers, The included call for papers to the 5th international workshop on Equation-based Object-Oriented Languages and Tools (EOOLT) 2013 may be of interest to those interested in declarative domain-specific languages in the context of Haskell. Apologies for multiple copies! All the best, /Henrik -- Henrik Nilsson School of Computer Science The University of Nottingham nhn(a)cs.nott.ac.uk This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

Call for Papers (ICTAC 2013)
by Huibiao Zhu 16 Jan '13

16 Jan '13

*************************************************************** ICTAC 2013 10th International Colloquium on Theoretical Aspects of Computing *** Call For Papers *** September 4-6, 2013 Shanghai, China http://ictac2013.ecnu.edu.cn/ *************************************************************** ICTAC 2013 is the 10th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2013 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. THEMES AND TOPICS OF PAPERS ICTAC 2013 calls for regular research papers on theories of computation and programming, foundations of software engineering, and on formal techniques in software design and verification; short papers on recent work or proposals of challenges in new programming paradigms such as Cyber-Physical Systems, Cloud Computing and Social Networks; and papers about tools that support formal techniques for software modeling, system design and verification. The topical areas of the conference include, but not limited to Automata theory and formal languages; Principles and semantics of programming languages; Theories of concurrency, mobility and reconfiguration; Logics and their applications; Software architectures and their models, refinement and verification; Relationship between software requirements, models and code; Program static and dynamic analysis and verification; Software specification, refinement, verification and testing; Model checking and theorem proving; Models of object and component systems; Coordination and feature interaction; Integration of theories, formal methods and tools for engineering computing systems; Service-oriented architectures: models and development methods; Models of concurrency, security, and mobility; Theory of distributed, grid and cloud computing; Real-time, embedded, hybrid and cyber-physical systems; Type and category theory in computer science; Models for learning and education; Case studies, theories, tools and experiments of verified systems; Domain-specific modeling and technology: examples, frameworks and experience. Challenges and foundations in the environmental modeling and monitoring, healthcare, and disaster management. PUBLICATION AND SUBMISSION As for the past editions, it is the plan that the proceedings of ICTAC 2013 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2013 is under negotiation. Submissions to the colloquium must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions can be Regular Papers, Short Papers or Tool Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 18 pages and Short Papers and tool papers should be between 5 and 10 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers must be submitted at http://www.easychair.org/conferences/?conf=ictac2013. Short papers and tool papers must contain clear reference to the background theories and techniques; and a tool paper must further provide a link to a webpage that contains a tutorial and demo of the tool. All queries should be sent to the e-mail address ictac2013(a)sei.ecnu.edu.cn. IMPORTANT DATES Paper submission deadline: 8 March 2013 Paper Accept/Reject Notification: 26 Apr 2013 Final paper submission: 17 May 2013 Conference dates: 4 --- 6 September 2013 ASSOCIATED EVENTS Festschrift Symposium in Honor of Prof. Jifeng He: 01-03 September 2013 Summer School on Software Engineering: 26-30 August 2013 INVITED SPEAKERS Luca Cardelli, Microsoft Research Cambridge, UK Jifeng He, East China Normal University, China Marta Kwiatkowska, University of Oxford, UK CONFERENCE CHAIRS Zhou Chaochen, Software Institute, Chinese Academy of Sciences, China Peter Haddawy, UNU-IIST, Macau SAR, China Bill Roscoe, University of Oxford, UK PROGRAMME CHAIRS Zhiming Liu, UNU-IIST, Macau SAR, China Jim Woodcock, University of York, UK Huibiao Zhu, East China Normal University, China PROGRAMME COMMITTEE Farhad Arbab (CWI and Leiden University, The Netherlands) Michael Butler (University of Southampton, UK) Ana Cavalcanti (University of York, UK) Zhenbang Chen (National University of Defense Technology, China) Van Hung Dang (University of Engineering and Technology, Vietnam) Thao Dang (VERIMAG, France) David Deharbe (Universidade Federal do Rio Grande do Norte, Brasil) Jinsong Dong (National University of Singapore, Singapore) Meenakshi Dsouza (IIIT, India) Zhenhua Duan (Xidian University, China) John Fitzgerald (Newcastle University, UK) Martin Fraenzle (Carl von Ossietzky University Oldenburg, Germany) Marcelo Frias (Instituto Tecnologico Buenos Aires, Argentina) Lindsay Groves (Victoria University of Wellington, New Zealand) Kim Guldstrand Larsen (Aalborg University, Denmark) Ian J. Hayes (University of Queensland, Australia) Zhenjiang Hu (NII, Japan) Lei Ju (Shandong University, China) Daniel Kroening (Oxford University, UK) Martin Leucker (University of Lübeck, Germany) Zhiming Liu (UNU-IIST, Macau SAR, China) Annabelle Mciver (Macquarie University, Australia) Dominique Mery (Université de Lorraine, France) Tobias Nipkow (Technische Universit?t München, Germany) Paritosh Pandya (TIFR, India) Jun Pang (University of Luxembourg, Luxembourg) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Abhik Roychoudhury (National University of Singapore, Singapore) Augusto Sampaio (Federal university of Pernambuco, Brasil) Ondrej Sery (University of Lugano, Switzerland) Natarajan Shankar (SRI, US) Marjan Sirjani (Reykjavik University, Iceland) Andrzej Tarlecki (Warsaw University, Poland) Mark Utting (The University of Waikato, New Zealand) Tarmo Uustalu (Tallinn University of Technology, Estonia) Farn Wang (National Taiwan University, Taiwan) Burkhart Wolff (University Paris-Sud, France) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Naijun Zhan (Chinese Academy of Sciences, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Jianhua Zhao (Nanjing University, China) Huibiao Zhu (East China Normal University, China)

1 0

PhD studentships in Nottingham
by Graham Hutton 16 Jan '13

16 Jan '13

Dear all, The School of Computer Science in Nottingham is advertising a number of PhD studentships. Applicants in the area of the Functional Programming Lab (fp.cs.nott.ac.uk) would be very welcome. If you are interested in applying, please contact a potential academic supervisor in the FP lab prior to submitting your application. Note that I'm not available to supervise new students myself this coming academic year. Graham Hutton University of Nottingham +---------------------------------------------------------------+ Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK Applications are invited for a number of fully-funded PhD studentships in the School of Computer Science at the University of Nottingham, starting on 1st October 2013. The topics for the studentships are open, but will relate to the research interests of existing members of staff within the School. Applicants should have discussed their interest and obtained the support of a named potential supervisor before applying. The studentships are for three years and include a maintenance grant of 13,726 UK pounds per year and tuition fees for UK students. The positions are open to students of any nationality, but non-UK students will require additional funding to cover tuition fees, which is awarded by the University on a competitive basis. Applicants will normally require a first-class Undergraduate or Masters degree in Computer Science or a related discipline. Informal enquiries may be addressed to Christine Fletcher <Christine.Fletcher(a)nottingham.ac.uk>. To apply, please submit the following items by email to the above address: (1) a brief covering letter that describes your reasons for wishing to pursue a PhD, any ideas you have regarding possible areas or topics, and the name of a potential supervisor; (2) a copy of your CV, including your actual or expected degree class(es), and results of all University examinations; (3) an example of your technical writing, such as a project report or dissertation; (4) contact details for two academic referees. *Closing date for applications:* 8th February 2013 +---------------------------------------------------------------+ -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

Introduction to Haskell Lectures
by Nick Shukla 11 Jan '13

11 Jan '13

Hi, The University of Virginia department of Computer Science was kind enough let me lecture an introductory course on Haskell, a functional programming language. I'll be posting all slides on the class website: http://shuklan.com/haskell Come join me in this 12 week course. We will start from basic lists and tuples, and venture far into monads and category theory. Regards, Nishant Shukla UVA CS/Math http://shuklan.com

3 2

Announce: KURE 2.6.14
by Neil Sculthorpe 11 Jan '13

11 Jan '13

KURE 2.6.14 is now available on Hackage. This new version is simpler to instantiate, and has better performance. What's New? ----------- The main change from version 2.4.x are (1) A simplified class interface that makes KURE easier to instantiate. The previous Node and Walker classes have been merged into a single Walker class, which only requires one class method, allR, compared to two before (numChildren and childL). (2) The Walker class no longer takes the monad as a class parameter, but instead provides methods that work for any monad. This enforces (some of) the intended semantics, and makes the methods more re-usable. (3) The type function "Generic" has been removed. This leads to simpler type signatures, and allows nodes to appear in multiple sum types without the need for newtype wrappers. The (minor) disadvantage is that type inference is weakened, and thus more type ascriptions are now required from the user. (4) The efficiency of the default definitions of the shallow traversals (anyR, oneR etc...) has been improved, making it less likely the user will need to overwrite them with custom definitions. (5) The library as a whole has been internally optimised through aggressive use of inlining, which has led to significant speed-ups. (6) Monad transformers for anyR- and oneR-like behaviour are now provided, making it much simpler to define congruence combinators with those behaviours. About KURE ---------- The Kansas University Rewrite Engine (KURE) is a DSL for strategic rewriting. KURE shares concepts with Stratego, but unlike Stratego, KURE is strongly typed. KURE is similar to StrategyLib, but has a lightweight generic traversal mechanism rather than using SYB. KURE is the engine inside HERMIT, our Equational Rewrite Framework. Homepage: http://www.ittc.ku.edu/csdl/fpg/Tools/KURE Examples -------- Some small examples of using KURE are provided in the source bundle. For a larger, non-trivial, example, see the description of its use in the HERMIT project: http://ittc.ku.edu/csdl/fpg/node/126 Acknowledgement --------------- This work was supported by funding from the NSF, for which we are grateful. Neil Sculthorpe

1 0

[CfP] 4th *OPEN* Answer Set Programming Competition 2013 - CALL FOR PARTICIPANTS
by Francesco Calimeri 11 Jan '13

11 Jan '13

[apologies for any cross-posting] ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Participant Systems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ aspcomp2013(a)kr.tuwien.ac.at ........................................................................ The 4th Open Answer Set Programming (ASP) Competition is now in the Call for Participant Systems stage. +--------------------------------------------------------------------+ | The event is open to ASP systems and *any other* system based on a | | declarative specification paradigm. | +--------------------------------------------------------------------+ == Call for Participant Systems == Participants of the Answer Set Programming Competition will compete on a selected collection of benchmark problems, taken from a variety of benchmark problem domains as well as real world applications. These include, but are not limited to: * Classic and applicative graph problems * Scheduling, Timetabling, and other resource allocation problems * Sequential and Temporal Planning * Combinatorial Optimization Problems * Deductive database tasks on large data-sets * Puzzles and Combinatorics * Ontology reasoning * Automated Theorem Proving and Model Checking * Reasoning tasks over large propositional instances * Constraint Programming problems * Other AI problems The competition consists of two independent main tracks: * the Model & Solve Track invites any researcher and developer of declarative knowledge representation systems to participate in an open challenge for solving sophisticated AI problems with their tools of choice. Participants submit a solver based on an arbitrary input format and declarative specifications of the Competition's benchmark domains; * the System Track compares dedicated answer set solvers on ASP benchmarks. Participants compete with a solver for a standard ASP language. We encourage to submit parallel and portfolio systems exploiting multiple cores or multiple algorithms for solving the given instances. === About the Answer Set Programming Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. The ASP Competition is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The 4th ASP Competition will be run in the first half of 2013 jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria). The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * February 2nd, 2013: Participant registration deadline * March 1st, 2013: Participant system submission deadline * March 2nd, 2013: System freeze, the competition runs * September 15-19, 2013: Announcement of results and award presentation at LPNMR 2013 in Corunna, Spain For further information and submission instructions please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013(a)kr.tuwien.ac.at

1 0