Ciao-users June 2011

ciao-users@cliplab.org

4 participants
6 discussions

CFP: COLA@EPIA 2011
by Paulo Moura 27 Apr '12

27 Apr '12

[apologies for multiple posts; please distribute] ------------------------------------------------- First Call for Papers EPIA 2011 - 15th Portuguese Conference on Artificial Intelligence Thematic Track: COLA - COmputational Logic with Applications October 10-13 Universidade de Lisboa, Portugal http://epia2011.appia.pt/ == Overview == The development of sophisticated intelligent systems requires more and more sound and appropriate foundations and tools, resulting in new problems and challenges for the computational logic practitioners. Computational logic has been widely used in complex applications in important areas such as the Deductive Databases, Natural Language Processing and Program Analysis, and more recently on the Semantic Web and related Web Tools. These novel applications have exposed the limits of existing approaches, showing the need for research on better languages and more sophisticated implementations of reasoning systems. The COLA thematic track of EPIA 2011 covers the broad area of Computational Logic and its applications, with special interest on topics related with new formalisms, environments, languages, tools, and applications. A non-exhaustive list of topics follows: - Logic based knowledge representation and applications - Declarative semantics of rule languages and applications - Program Analysis, Program Transformation, Validation and Verification, Debugging, Profiling - Implementation of reasoning systems, in particular logic programming, contextual logic programming, and tabling systems - Abductive and Inductive Logic Programming - Ontologies, Description Logics and integration with reasoning systems - Reasoning with incomplete and uncertain information, including non-monotonic reasoning as well as probabilistic and fuzzy logic programming formalisms - Reasoning on the Semantic Web - Applications: Deductive Databases, Data Integration, Natural Language, Semantic Web, and Web Tools == Important Dates == Deadline for paper submission: May 10, 2011 Notification of paper acceptance: June 10, 2011 Camera-ready papers: July 1, 2011 Conference dates: October 10-13, 2011 == Submission Guidelines == All papers should be submitted through the conference management website at: http://www.easychair.org/conferences/?conf=epia2011 Papers should not exceed fifteen (15) pages in length and must be formatted according to the information for LNCS authors. Papers must be submitted in PDF (Adobe's Portable Document Format) format and will not be accepted in any other format. Papers that exceed 15 pages or do not follow the LNCS guidelines risk being rejected automatically without a review. At least one author of each accepted paper must register for the conference. More information about the Springer's Lecture Notes in Computer Science (LNCS) are available on the Springer LNCS Web site http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 The best papers (the exact number is decided by the EPIA Chairs) will appear in the proceedings published by Springer in the LNAI series. The remaining accepted papers will be published in a venue TBA. == Organizing Committee == Paulo Moura, Universidade da Beira Interior, Portugal Vitor Nogueira, Universidade de Évora, Portugal == Program Committee == Angelika Kimmig, K. University of Leuven, Belgium Axel Pollers, National University of Ireland, Ireland Bart Demoen, K. University of Leuven, Belgium Daniel Diaz, University of Paris 1, France David Warren, University of Stony Brook, USA Enrico Pontelli, New Mexico State University, USA Gopal Gupta, University of Texas at Dallas, USA Joachim Schimpf, Monash University, Australia João Leite, CENTRIA and Universidade Nova de Lisboa, Portugal José Alferes, CENTRIA and Universidade Nova de Lisboa, Portugal Paulo Gomes, Universidade de Coimbra, Portugal Peter Robinson, University of Queensland, Australia Roberto Bagnara, University of Parma, Italy Salvador Abreu, Universidade de Évora, Portugal Vítor Costa, Universidade do Porto, Portugal == Contact Information == cola2011(a)di.uevora.pt ----------------------------------------------------------------- Paulo Jorge Lopes de Moura, PhD Assistant Professor Dep. of Computer Science, University of Beira Interior 6201-001 Covilhã, Portugal Office 3.18 Ext. 3276 Phone: +351 275319891 Fax: +351 275319899 Email: <mailto:pmoura(a)di.ubi.pt> Home page: <http://www.di.ubi.pt/~pmoura> Research: <http://logtalk.org/> Blog: <http://blog.logtalk.org/> -----------------------------------------------------------------

4 4

UNSUBSCRIBE
by Andrew Fiddimore 29 Jun '11

29 Jun '11

1 0

R: Re: Question about tail call optimization
by silviaumiliacchi＠libero.it 29 Jun '11

29 Jun '11

Dear Jose, thank you for your answer. I'll have a look at the paper you suggested me. Kind regards, Silvia Umiliacchi >----Messaggio originale---- >Da: jfran(a)clip.dia.fi.upm.es >Data: 28/06/2011 18.24 >A: "silviaumiliacchi(a)libero.it"<silviaumiliacchi(a)libero.it> >Cc: <ciao-users(a)clip.dia.fi.upm.es> >Ogg: Re: [Ciao-users] Question about tail call optimization >Dear Silvia, > >Last call optimization (LCO) removes frame environments when possible, >thus transforming some recursions into loops. That optimization is >done at compile time when possible. There are many papers in the >literature where you can find a more detailed description >(H. Ait-Kaci. Warren's Abstract Machine, A Tutorial >Reconstruction). Basically, given a clause: > > p :- g1, g2, ..., gn1, gn. > >the compiler translates it into code (e.g., bytecode) that, between >'gn1' and 'gn', makes sure that all the arguments required for 'gn' >live in temporal registers, removes the environment frame, and jumps >to 'gn'. > >In order to reason about catch/3 and throw/1 you need some detailed >description of their semantic. Suppose a clause like: > > foo :- ..., catch(bar, ..., ...). > >If your question is whether LCO is able to remove the environment >created for 'foo' before calling 'bar', the answer is no. At least, >you need to 'uninstall' the exception handler when returning from >'bar'. To do that, you need to keep some information in the >enviroment. I do not think that it could be optimized (at least I am >not aware of any Prolog system which does). > >Cheers > >-- >Jose >

1 0

R: Re: Question about tail call optimization
by silviaumiliacchi＠libero.it 29 Jun '11

29 Jun '11

Dear Bart, first of all, thank you for your answer. You caught my doubt very well. It would be very helpful if you could send me the report you told about. thanks, kind regards Silvia Umiliacchi >----Messaggio originale---- >Da: Bart.Demoen(a)cs.kuleuven.be >Data: 28/06/2011 20.16 >A: "silviaumiliacchi(a)libero.it"<silviaumiliacchi(a)libero.it> >Cc: <ciao-users(a)clip.dia.fi.upm.es> >Ogg: Re: [Ciao-users] Question about tail call optimization > > >Hi Silvia, > >A Prolog system that does not implement LCO would not survive long. >You are right about catch/3 preventing LCO to some extent. You could >have a look at how catch/3 is implemented: depending on that, LCO is >dynamically (and locally) disabled, in a "natural" way. It is not >something the compiler (from Prolog to WAM for instance) needs to know >about. I can send you privately an old report named "A 20' >implementation of catch and throw in WAM" - SWI Prolog implements it >differently - I do not know how Ciao does it, but at some point in >SICStus, it was basically as my report describes, and Ciao derives >from SICStus. > >In a nutshell: LCO is (dynamically) detected not to apply if there is >a choicepoint blocking the reuse of an environment. The implementation >of catch/3 can push the necessary choicepoint (for unwinding) in such >a way that no special action is needed. > >Cheers > >Bart Demoen > >Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm >

1 0

Question about tail call optimization
by silviaumiliacchi＠libero.it 28 Jun '11

28 Jun '11

Good Morning, I'm a post-graduate student at University of Bologna. For my final thesis, I'm collecting informations about tail call optimization in a Prolog system. I read many articles on the web, and I found in Wikipedia that Ciao implements tail call optimization. My doubt is about when it is correct to perform this optimization; for example, when the query catch(Goal1, Arg, Goal2) calls the throw/1 predicate during the execution of Goal1, execution must go back to the catch predicate and proceed with Goal2. So, I think that no stack optimization can be performed in presence of this query and consequently it has to be disabled. I haven't found any documents that confirm my thought and the ISO standard doesn't specify anything on it. Please, can you help me? Thank you in advance and kind regards, Silvia Umiliacchi

2 1

CLP(FD) and reification
by Fernando Sáenz Pérez 07 Jun '11

07 Jun '11

Hello, Is it planned to extend the clpfd library to deal with reifiable constraints and '#<=>'/3? All the best, -- ============================================================== Fernando Saenz Perez Profesor Titular de Universidad / Associate Professor Home Page: http://www.fdi.ucm.es/profesor/fernan Tel: + 34 913947642. Fax: + 34 913947547 Despacho / Office: 435 (4ª planta / 4th floor) Dept. Ingenieria del Software e Inteligencia Artificial / Department of Software Engineering and Artificial Intelligence Universidad Complutense de Madrid Facultad de Informatica C/Profesor Jose Garcia Santesmases, s/n E - 28040 Madrid. Spain ==============================================================

1 0

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

Ciao-users June 2011