yap-users — General Information on Yap

Re: [Yap-users] Obtaining YAPInterface.h file for C interface

[Gökhan S. <so...@it...>]

Thank you for the answer. Using MSYS2 I was able to build yap 6.3.0 from
source, with some additional changes to source code.

Changes I did were:

In Regs.h, line 590,

    #define H          Yap_REGS.H_    /* top of heap (global)
stack           */

was causing compile error:

   error: expected ‘:’, ‘,’, ‘;’, ‘}’ or ‘__attribute__’ before ‘=’ token

So I refactored *#define H* with *#define HEAD*. And I changed every
occurrence of *H *with *HEAD* in all *.c and *.h files under yap-source.
(Using Notepad++ replaced every ([^\d\w'])H([^\d\w']) with \1HEAD\2).

In blob.c, compile error was caused:

    stderr undeclared (first use in this function)

So I added #include <stdio.h>

Now I am able to run it from yap.exe, it seems to work properly so far.

Regards,
Gökhan Solak

2016-03-15 3:39 GMT+02:00 Vitor Santos Costa <vs...@gm...>:

> Hi Gokhan
>
> Sorry for the delay. Thanks for your interest!
>
>  I think the problem is that 6.4.0 is very old and cygwin has changed a
> lot. Quite a lot.
>
> Right now I still have some problems with the github YAP version on
> Windows. If you want to give it a try, probably wan to install first msys2:
>
> https://msys2.github.io/
>
> That seems to have the best development environment. Thanks to cmake I was
> also able to compile YAP under VC and VisualStudio plus clang, but I
> haven't had the time to debug it so far.
>
> I have had problems with my version, but I am not sure where the problem
> comes from: YAP or WIndows 10.
>
> On Fri, Mar 11, 2016 at 1:31 PM, Gökhan Solak <so...@it...> wrote:
>
>> Hello,
>>
>> I want to define external predicates using C interface. I consulted to
>> online documentation and it seems I need to include
>> *"YAP/YAPInterface.h"* library in the C code (link
>> <http://www.dcc.fc.up.pt/~vsc/Yap/yap.html#C_002dInterface>). In online
>> documentation I found a part stating that I should create the YAP library (
>> link <http://www.dcc.fc.up.pt/~vsc/Yap/yap.html#YAPLibrary>) using
>>
>>
>>> make library
>>
>> make install_library
>>>
>>
>> So I downloaded YAP 6.3.0 source from here
>> <https://sourceforge.net/p/yap/yap-6.3/ci/6.3.0/tree/>. I tried to
>> execute the above commands using cygwin under windows 7. I have gmp and
>> readline packages installed. Gcc and all basic packages are up-to-date.
>>
>> First I executed
>>
>> ./configure
>>>
>>
>> and then
>>
>> make
>>>
>>
>> but it was failing with error:
>>
>> gcc: error: unrecognized command line option '-mno-cygwin'
>>
>>
>> same error occured on execution of
>>
>> make install_library
>>
>>
>> After some search according to an answer
>> <http://stackoverflow.com/questions/6034390/compiling-with-cython-and-mingw-produces-gcc-error-unrecognized-command-line-o/6035864#6035864>,
>> I removed 'mno-cygwin' from cygwinccompiler.py file under cygwin.
>>
>> I also removed '-mno-cygwin' argument from lines 61,62 in *Makefile *under
>> YAP folder.
>>
>> Now it tries to compile but this time it fails producing this message
>> (for both 'make' and 'make install_library' commands):
>>
>> Makefile:665: recipe for target 'agc.o' failed
>>> make: *** [agc.o] Error 1
>>>
>>
>> It produces many warnings and some errors. As I inspected some errors
>> occur due to the type definitions in *agc.c* such as *Int *and *UInt*
>> (starting with capital letters). Last portion of whole output is here
>> <http://pastebin.com/DzZwCQqA>. Whole text of Makefile is here
>> <http://pastebin.com/HhYgKEmA>.
>>
>> I tried replacing *Int* and *UInt* with *long int* and *long uint. *But
>> it caused more errors.
>>
>> Can you help me in building necessary files for yap - c interface?
>>
>> Thanks in advance,
>> Gökhan Solak
>>
>>
>>
>> ------------------------------------------------------------------------------
>> Transform Data into Opportunity.
>> Accelerate data analysis in your applications with
>> Intel Data Analytics Acceleration Library.
>> Click to learn more.
>> http://pubads.g.doubleclick.net/gampad/clk?id=278785111&iu=/4140
>> _______________________________________________
>> Yap-users mailing list
>> Yap...@li...
>> https://lists.sourceforge.net/lists/listinfo/yap-users
>>
>>
>

[Yap-users] How to configure tabling option?

[Francisco H. O. V. de F. <fra...@gm...>]

Hey, folks!


I am trying to run, on Ubuntu (Linux x86_64), an algorithm that requires
tabling.

I downloaded the YAP version available on Ubuntu repository, but I did not
succeed configuring the tabling option.

I can not find a configure script, neither the proper makefile, mentioned
in the user's manual.


Thank you in advance for your help.

Yours sincerely,

Francisco

[Yap-users] Obtaining YAPInterface.h file for C interface

[Gökhan S. <so...@it...>]

Hello,

I want to define external predicates using C interface. I consulted to
online documentation and it seems I need to include *"YAP/YAPInterface.h"*
library in the C code (link
<http://www.dcc.fc.up.pt/~vsc/Yap/yap.html#C_002dInterface>). In online
documentation I found a part stating that I should create the YAP library (
link <http://www.dcc.fc.up.pt/~vsc/Yap/yap.html#YAPLibrary>) using


> make library

make install_library
>

So I downloaded YAP 6.3.0 source from here
<https://sourceforge.net/p/yap/yap-6.3/ci/6.3.0/tree/>. I tried to execute
the above commands using cygwin under windows 7. I have gmp and readline
packages installed. Gcc and all basic packages are up-to-date.

First I executed

./configure
>

and then

make
>

but it was failing with error:

gcc: error: unrecognized command line option '-mno-cygwin'


same error occured on execution of

make install_library


After some search according to an answer
<http://stackoverflow.com/questions/6034390/compiling-with-cython-and-mingw-produces-gcc-error-unrecognized-command-line-o/6035864#6035864>,
I removed 'mno-cygwin' from cygwinccompiler.py file under cygwin.

I also removed '-mno-cygwin' argument from lines 61,62 in *Makefile *under
YAP folder.

Now it tries to compile but this time it fails producing this message (for
both 'make' and 'make install_library' commands):

Makefile:665: recipe for target 'agc.o' failed
> make: *** [agc.o] Error 1
>

It produces many warnings and some errors. As I inspected some errors occur
due to the type definitions in *agc.c* such as *Int *and *UInt* (starting
with capital letters). Last portion of whole output is here
<http://pastebin.com/DzZwCQqA>. Whole text of Makefile is here
<http://pastebin.com/HhYgKEmA>.

I tried replacing *Int* and *UInt* with *long int* and *long uint. *But it
caused more errors.

Can you help me in building necessary files for yap - c interface?

Thanks in advance,
Gökhan Solak

[Yap-users] Call For Workshop Proposals: 32nd International Conference on Logic Programming (ICLP 2016)

[Peter S. <pet...@ma...>]

           *** CALL FOR WORKSHOP PROPOSALS ***

                      ICLP 2016

     32nd International Conference on Logic Programming

                    Oct 17 - 21, 2016
                    New York City, USA

       http://software.imdea.org/Conferences/ICLP2016/

ICLP 2016, the 32nd International Conference on Logic Programming,
will be held in New York City, USA, from October 17 to October 21, 
2016.

Workshops collocated with an international conference are one of the
best venues for the presentation and discussion of preliminary work,
novel ideas, and new open problems to a wide and interested audience.
Collocated workshops also provide an opportunity for presenting
specialized topics and opportunities for intensive discussions and
project collaboration. The topics of the workshops collocated with
ICLP 2016 can cover any areas related to logic programming, (e.g.,
theory, implementation, environments, language issues, alternative
paradigms, applications), including cross-disciplinary areas. However,
any relevant workshop proposal will be considered.

The format of the workshop will be decided by the workshop organizers,
but ample time should be allowed for general discussion. Workshops can
vary in length, but the optimal duration will be half a day or a full
day.

Workshop Proposal:
==================
Those interested in organizing a workshop at ICLP 2016 are invited to
submit a workshop proposal. Proposals should be in English and about
two pages in length. They should contain:

 * The title of the workshop.
 * A brief technical description of the topics covered by the workshop.
 * A discussion of the timeliness and relevance of the workshop.
 * A list of some related workshops held in the last years
 * The requested number of half-days allotted to the workshop
   and an estimate of the number of expected attendees.
 * The names, affiliation and contact details (email, web page,
   phone) of the workshop organizers together with a designated
   contact person.
 * Previous experience of the workshop organizers in
   workshop/conference organization.

Proposals are expected in text or PDF format. All proposals should be
submitted to the Workshop Chair by email by March 29, 2016.


Reviewing Process:
==================
Each submitted proposal will be reviewed by the Workshop, Program and
General Chairs. Proposals that appear well-organized and that fit the
goals and scope of ICLP will be selected.  The decision will be
notified by email to the responsible organizer by April 8, 2016.

The definitive length of the workshop will be planned according to the
number of submissions received by the different workshops. For every
accepted workshop, the ICLP local organizers will prepare a meeting
room. The proceedings should be produced and distributed (usually via
web pages) by each workshop organizer.


Workshop Organizers' Tasks:
===========================

 * Producing a "Call for Papers" for the workshop and posting it
   on the Internet and other means.  A web page URL should be provided 
   by April 24, 2016, and will published on the ICLP 2016 home page.
 * Providing a brief description of the workshop for the conference
   program.
 * Reviewing/accepting submitted papers.
 * Scheduling workshop activities in collaboration with the local
   organizers and the Workshop Chair.
 * Sending workshop program in PDF format to the Workshop Chair for
   distribution and posting at the conference by September 18, 2016.
 * The use of the Computing Research Repository (CoRR) for the
   workshop proceedings is strongly recommended. For guidelines, see:
     http://dtai.cs.kuleuven.be/projects/ALP/electronic_publishing.html
   We encourage reading these instructions in advance so that you can
   ask paper authors to prepare the final versions of their papers
   accordingly.


Location:
=========
Workshops be collocated with ICLP 2016, in New York City, USA.
See the ICLP 2016 web site for location details.


Important Dates:
================
March 29, 2016: Proposal submission deadline
April  8, 2016: Notification
April 24, 2016: Deadline for receipt of CfP and workshop web page URL
Sep 18, 2016: Deadline for workshop program 
Oct 16-17, 2016: ICLP workshops (preliminary dates)


Workshop Chair:
===============
Marcello Balduccini    mar...@gm...

[Yap-users] 2nd CFP ICLP 2016, New York City: 32nd International Conference on Logic Programming, Oct 17-21

[Peter S. <pet...@ma...>]

                            Second Call For Papers
              32nd International Conference on Logic Programming

                              New York City, USA
                             October 17-21, 2016

               http://software.imdea.org/Conferences/ICLP2016/

Conference Scope

Since  the first conference held in Marseilles in 1982, ICLP has been the pre-
mier international conference for presenting research  in  logic  programming.
Contributions  are sought in all areas of logic programming, including but not
restricted to:


 - Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge
   Representation.

 - Implementation: Compilation, Virtual Machines, Parallelism, Constraint Han-
   dling Rules, Tabling.

 - Environments: Program Analysis, Transformation,  Validation,  Verification,
   Debugging, Profiling, Testing.

 - Language  Issues:  Concurrency,  Objects,  Coordination,  Mobility,  Higher
   Order, Types, Modes, Assertions, Programming Techniques.

 - Related Paradigms: Inductive and Co-inductive Logic Programming, Constraint
   Logic Programming, Answer-Set Programming, SAT-Checking.

 - Applications:  Databases,  Big Data, Data Integration and Federation, Soft-
   ware Engineering,  Natural  Language  Processing,  Web  and  Semantic  Web,
   Agents, Artificial Intelligence, Bioinformatics, and Education.


In  addition  to  the  presentations of accepted papers, the technical program
will include invited talks, advanced tutorials, the doctoral  consortium,  and
several workshops.

Important Dates

Paper registration (abstract):          22 April, 2016
Submission deadline:                    29 April, 2016
Notification to authors:                17 June, 2016
Revision deadline (when needed):        8 July, 2016
Final notification:                     22 July, 2016
Camera-ready copy due:                  5 Aug, 2016
Conference:                             17-21 Oct, 2016

Submission Details

Submissions  of  regular papers must be made in the condensed TPLP format (see
http://software.imdea.org/Conferences/ICLP2016/TPLP-ICLP-2016.tar)  via  Easy-
Chair  (see  http://www.easychair.org/conferences/?conf=iclp2016).   A regular
paper must not exceed 14 pages including the bibliography, but the  paper  may
be  supplemented  with  appendices for proofs and details of datasets which do
not count towards this limit and which will be available as appendices to  the
published paper. We accept three kinds of papers:


 - Technical  papers  for technically sound, innovative ideas that can advance
   the state of logic programming;

 - Application papers that impact interesting application domains;

 - System and tool papers which emphasize  novelty,  practicality,  usability,
   and availability of the systems and tools described.


Application, system, and tool papers need to be clearly marked in their title.
All submissions must be written in English and describe  original,  previously
unpublished research, and must not simultaneously be submitted for publication
elsewhere.  Papers of the highest quality will be selected to be published  in
the journal of Theory and Practice of Logic Programming (TPLP), Cambridge Uni-
versity Press (CUP). In order to ensure the  quality  of  the  final  version,
papers  may  be subject to more than one round of refereeing (within the deci-
sion period).

The program committee may recommend some papers to be published  as  technical
communications.  Technical  communications (TCs) will be published by Dagstuhl
Publishing   in   the    OpenAccess    Series    in    Informatics    (OASIcs)
(http://www.dagstuhl.de/publikationen/oasics/).   These  TC  papers should not
exceed 14 pages including bibliography.  Authors can  also  elect  to  convert
their  submissions  into extended abstracts, of 2 or 3 pages, for inclusion in
the TCs.  This should allow authors to submit a long version  elsewhere.   All
regular papers and regular TCs will be presented during the conference.

Doctoral  consortium position papers, of between 10 and 14 pages, will also be
published as TCs.

Authors of accepted papers will, by default, be automatically included in  the
list  of  ALP  members, who will receive quarterly updates from the Logic Pro-
gramming Newsletter at no cost.


Conference Organization

General Chairs:

Michael         Kifer           Stony Brook University, USA
Neng-Fa         Zhou            City University of New York, USA

Program Chairs:

Manuel          Carro           UPM and IMDEA Software Institute, Spain
Andy            King            University of Kent, UK

Workshop Chair:

Marcello        Balduccini      Drexel University, USA

Publicity Chair:

Peter           Schueller       Marmara University, Turkey

Doctoral Consortium Chairs:

Marina          De Vos          University of Bath, UK
Neda            Saeedloei       University of Minnesota Duluth, USA

Programming Contest Chair:

Paul            Fodor           Stony Brook University, USA

Web Presence:

Joaquin         Arias           IMDEA Software Institute, Spain

Preliminary Program Committee:

Marcello        Balduccini      Drexel University, USA
Mutsunori       Banbara         Kobe University, Japan
Roman           Bartak          Charles University, Czech Republic
Pedro           Cabalar         University of Corunna, Spain
Mats            Carlsson        SICS, Sweden
Manuel          Carro           UPM and IMDEA Software Institute, Spain
Michael         Codish          Ben-Gurion University of the Negev, Israel
Marina          De Vos          University of Bath, UK
Agostino        Dovier          Universita degli Studi di Udine, Italy
Gregory         Duck            National University of Singapore, Singapore
Esra            Erdem           Sabanci University, Turkey
Wolfgang        Faber           University of Huddersfield, UK
Thom            Fruehwirth      University of Ulm, Germany
John            Gallagher       Roskilde University, Denmark, and
                                IMDEA Software Institute, Spain
Marco           Gavanelli       Universita degli Studi di Ferrara, Italy
Martin          Gebser          University of Potsdam, Germany
Michael         Hanus           CAU Kiel, Germany
Katsumi         Inoue           NII, Japan
Gerda           Janssens        KU Leuven - University of Leuven, Belgium
Andy            King            University of Kent, UK
Ekaterina       Komendantskaya  Heriot-Watt University, UK
Michael         Leuschel        University of Dusseldorf, Germany
Vladimir        Lifschitz       University of Texas, USA
Jose F.         Morales         IMDEA Software Institute, Spain
Enrico          Pontelli        New Mexico State University, USA
Jorg            Puhrer          Leipzig University, Germany
Ricardo         Rocha           University of Porto, Portugal
Zoltan          Somogyi         Independent Researcher, Australia
Harald          Sondergaard     University of Melbourne, Australia
Theresa         Swift           NOVALINKS, US, and UNL, Portugal
Francesca       Toni            Imperial College London, UK
Irina           Trubitsyna      University of Calabria, Italy
Mirek           Truszczynski    University of Kentucky, USA
Alicia          Villanueva      Universitat Politecnica de Valencia, Spain
Jan             Wielemaker      VU University Amsterdam, Netherlands
Stefan          Woltran         TU Wien, Austria
Fangkai         Yang            Schlumberger Inc., USA
Jia-Huai        You             University of Alberta, Canada

Workshops

The ICLP 2016 program will include several workshops.  They  are  perhaps  the
best  places  for  the  presentation of preliminary work, underdeveloped novel
ideas, and new open problems to a wide and interested audience with opportuni-
ties for intensive discussions and project collaboration.

Autumn School on Computational Logic

A  school on computational logic is planned.  More up to date information will
be available at the conference Web page.

Doctoral Consortium

The Eleventh Doctoral Consortium (DC) on Logic Programming  provides  research
students  with  the  opportunity  to present and discuss their research direc-
tions, and to obtain feedback from  both  peers  and  experts  in  the  field.
Accepted  participants  will  receive  partial financial support to attend the
event and the main conference. The best paper from the DC will  be  given  the
opportunity to present in a session of the main ICLP conference.

Conference Venue

The  venue  will  be  the  Sheraton LaGuardia East Hotel in Flushing, New York
City.  New York City is an international  tourist  destination,  receiving  56
million  tourists in 2014 alone. Several sources have ranked New York the most
photographed city in the world. Times square, known as the  city's  heart,  is
the  brightly  illuminated hub of the Broadway theatre district. The Statue of
Liberty greets new arrivals to the Americas by ship in the late 19th and early
20th century, and is a globally recognized symbol of the United States. Flush-
ing is associated by many with the  National  Tennis  Centre,  since  Flushing
Meadows  has  been  the home of the US Open Grand Slam tennis tournament every
year since 1978.

New York is the most populous city in the United States and one  of  the  most
populous  urban  agglomerations  in  the world. Situated in one of the world's
largest natural harbours, New York City consists of  five  boroughs,  each  of
which is a separate county of New York State. The conference hotel is situated
in the Queens borough, just a two-minute walk from  the  Flushing-Main  Street
rail station.  Direct train lines take you directly from there to Times Square
in just over 45 minutes, which is fast for New York City. The Museum of Modern
Art  can  be  reached in under 40 mins, Grand Central Terminal in 40 mins, the
Empire State Building under 50 mins, and The High Line Park in 50 minutes.

The hotel is also close to LaGuardia Airports and JFK.  LaGuardia  is  just  3
miles  away  and  the  hotel  offers a complementary shuttle service.  John F.
Kennedy International Airport (JFK) is 10 miles away and can be reached within
30  minutes  by  taxi.  The hotel is situated in a vibrant Asian district that
offers a variety of Eastern cuisine, as well as many stores and shops.

Sponsor

The conference is sponsored by the Association for Logic Programming (ALP).

Financial Assistance

The Association for Logic Programming has funds to assist  financially  disad-
vantaged  participants  and, especially, students to enable them to attend the
conference.  Inquiries should be made to the general chairs.

[Yap-users] AI*IA Incoming Mobility Grants 2016

[Fabrizio R. <fab...@un...>]

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
AI*IA Incoming Mobility Grants 2016


                     Call for research visits

Deadline for applications: 10 June 2016
https://sites.google.com/a/aixia.it/italiano/premi/incoming-mobility
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

To favour mobility of young researchers the Italian Association for  
Artificial
Intelligence (AI*IA) issues the Association Incoming Mobility Grants for  
2015.
Applications are solicited for funding a research visit of a PhD student
enrolled at a foreign University to an Italian institution.

Students will be funded by AI*IA which will cover their travel costs and  
living
expenses (up to 2000 euro).
The funding will be provided as a reimbursement for the expenses incurred  
in the
visit. After the visit, the awarded person should send the Association the
receipts of her/his costs for which she/he would like to be refunded.

The central aim of these extended visits is to build a research bridge  
between
researchers and to create a solid basis for long term collaborations.   
Moreover,
the visit has to lead to a submission of an article on a joint
research topics to the Intelligenza Artificiale journal.

Eligibility for the visiting student is to be enrolled full-time in a PhD
programme at a foreign University.
Funding is available for 2 students.
The visit start should be between the 1st July 2016 and the 30th of June  
2017.

Deadline for applications: 10 June 2016
Notification of grants: 22 June 2016

The information required in the application are:
1. name of the foreign PhD student who will be hosted;
2. name and address of the foreign Lab/Department and University;
3. name of the Italian researcher of the hosting institution. The Italian
    researcher must be a member of the Association for 2016.
    If she/he is not a member for 2016 she/he must register before applying.
4. a short (max 2 pages) resume/CV of the foreign student;
5. a short (max 2 pages) resume/CV of the Italian host;
6. a short (max 2 pages) description of the research that will be carried  
out
    during the visit
7. a budget of the foreseen expenses
8. declaration of the Italian host indicating that the hosting institution  
is
    willing to provide office space and access to lab facilities to conduct  
the
    research
9. expected visit dates

The application must be sent by email to inc...@ai...

The applications will be examined by a committee composed by members of the
AI*IA Board of Directors.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

[Yap-users] AI*IA Outgoing Mobility Grants 2016

[Fabrizio R. <fab...@un...>]

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
AI*IA Outgoing Mobility Grants 2016

                        Call for research visits

Deadline for applications: 10 June 2016
https://sites.google.com/a/aixia.it/italiano/premi/outgoing-mobility
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

To favour mobility of young researchers the Italian Association for  
Artificial
Intelligence (AI*IA) issues the Association Outgoing Mobility Grants for  
2015.
Applications are solicited for funding a research visit abroad of a PhD  
student
enrolled at an Italian University.

Students will be funded by AI*IA which will cover their travel costs and  
living
expenses (up to 2000 euro).
The funding will be provided as a reimbursement for the expenses incurred  
in the
visit. After the visit, the awarded person should send the Association the
receipts of her/his costs for which she/he would like to be refunded.

The central aim of these extended visits is to build a research bridge  
between
researchers and to create a solid basis for long term collaborations.   
Moreover,
the visit has to lead to a submission of an article on a joint
research topics to the Intelligenza Artificiale journal.

Applications can be made by a student enrolled full-time in a PhD programme  
at an Italian University.
The applicant must be a member of the Association for 2016.
If she/he is not a member for 2016 she/he must register before applying.

Funding is available for 2 students.
The visit start should be between the 1st July 2016 and the 30th of June  
2017.

Deadline for applications: 10 June 2016
Notification of grants: 22 June 2016

The information required in the application are:
1. name of the Italian PhD student who will go abroad;
2. name of the foreign researcher that will host the student;
3. name and address of the foreign Lab/Department and University;
4. a short (max 2 pages) resume/CV of the Italian student;
5. a short (max 2 pages) resume/CV of the foreign researcher;
6. a short (max 2 pages) description of the research that will be carried  
out
    during the visit
7. a budget of the foreseen expenses
8. declaration of the foreign host indicating that the hosting institution  
is
    willing to provide office space and access to lab facilities to conduct  
the
    research
9. expected visit dates

The application must be sent by email to out...@ai...

The applications will be examined by a committee composed by members of the
AI*IA Board of Directors.

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

Re: [Yap-users] Fwd: Re: More fun problems!

[Edward S. <esc...@ce...>]

On 02/26/2016 01:46 PM, Vitor Santos Costa wrote:
> Ed
> 
> Can you send me the program?
> 
> I am a bit confused the only chance I can see is that you have the same goal above and below the final, i.e. 
> 
> a(X) :- ….. findall(Y, b(Y),L)
> 
> b(Y) :- … a(X).
> 
> the problem here is that solutions found by the lower call for a are sent back to the top one, kind of like having a loop between the inside and the outside of the findall.l
> 
> But it is just a guess :(
> 
> Best
> 
> 
> Vitor

Vitor,

I don't believe that is what is happening -- the rule containing findall
is not recursive.

I will attempt to minimize our program as much as possible and send it
to you soon.

Thanks!

Ed

Re: [Yap-users] Fwd: Re: More fun problems!

[Vitor S. C. <vs...@dc...>]

Ed

Can you send me the program?

I am a bit confused the only chance I can see is that you have the same goal above and below the final, i.e. 

a(X) :- ….. findall(Y, b(Y),L)

b(Y) :- … a(X).

the problem here is that solutions found by the lower call for a are sent back to the top one, kind of like having a loop between the inside and the outside of the findall.l

But it is just a guess :(

Best


Vitor


> On 25 Feb 2016, at 15:44, Edward Schwartz <esc...@ce...> wrote:
> 
> Sharing this with the mailing list.  (The same problem occurs with
> findall and bagof.)
> 
> 
> -------- Forwarded Message --------
> Subject: 	Re: [Yap-users] More fun problems!
> Date: 	Wed, 24 Feb 2016 19:49:22 -0500
> From: 	Eyal Dechter <eya...@gm...>
> To: 	Edward Schwartz <esc...@ce...>
> 
> 
> 
> Looks like a bug to me. Findall shouldn't leave choice points.
> 
> Sent from my iPhone
> 
> On Feb 24, 2016, at 6:39 PM, Edward Schwartz <esc...@ce...
> <mailto:esc...@ce...>> wrote:
> 
>> 
>> Yes. And bagof.
>> 
>> 
>> Sent from my T-Mobile 4G LTE Device
>> 
>> 
>> -------- Original message --------
>> From: Eyal Dechter <eya...@gm... <mailto:eya...@gm...>>
>> Date: 2/24/2016 6:10 PM (GMT-05:00)
>> To: Edward Schwartz <esc...@ce... <mailto:esc...@ce...>>
>> Subject: Re: [Yap-users] More fun problems!
>> 
>> Do you get the same behavior with findall?
>> 
>> Sent from my iPhone
>> 
>>> On Feb 24, 2016, at 4:37 PM, Edward Schwartz <esc...@ce... <mailto:esc...@ce...>> wrote:
>>> 
>>> On 02/24/2016 04:35 PM, Edward Schwartz wrote:
>>> 
>>> I forgot to include the query:
>>> 
>>> certainInstanceCallsMethodSet(C,S).
>>> 
>>>> Here is the problematic output:
>>>> ok
>>>> method(101)
>>>> method(101)
>>>> ok
>>>> method(101)
>>>> method(102)
>>>> ok
>>>> method(101)
>>>> method(103)
>>>> hey
>>>> _164154
>>>> hey2
>>>> method(101)
>>>> C = method(101),
>>>> S = [method(101),method(102),method(103)] ? ;
>>>> here we go
>>>> method(104)
>>>> done!
>>>> false.
>>>> 
>>>> So the first rule is used to prove
>>>> certainInstanceCallsMethod(method(101), method(101)),
>>>> certainInstanceCallsMethod(method(101), method(102)), and
>>>> certainInstanceCallsMethod(method(101), method(103)).
>>>> 
>>>> The second rule begins evaluating, but stops when it reaches
>>>> certainVFTableEntry.  AFTER I hit semicolon some type of backtracking
>>>> occurs and the second rule finishes, proving
>>>> certainInstanceCallsMethod(method(101), method(104)).  If I execute the
>>>> query again, all four methods are included in the resulting set.
>>>> 
>>>> It's possible and even likely that certainVFTableEntry is recursing and
>>>> calling certainInstanceCallsMethod again; this is why we are using
>>>> tabling.  Assuming I have rid my program of all coroutining, is this a
>>>> bug, or is it some type of expected behavior?  In particular, why does
>>>> the backtracking happen outside of the setof()?
>>>> 
>>>> Thanks again,
>>>> 
>>>> Ed
>>>> 
>>>> ------------------------------------------------------------------------------
>>>> Site24x7 APM Insight: Get Deep Visibility into Application Performance
>>>> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>>>> Monitor end-to-end web transactions and take corrective actions now
>>>> Troubleshoot faster and improve end-user experience. Signup Now!
>>>> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>>>> _______________________________________________
>>>> Yap-users mailing list
>>>> Yap...@li... <mailto:Yap...@li...>
>>>> https://lists.sourceforge.net/lists/listinfo/yap-users
>>> 
>>> ------------------------------------------------------------------------------
>>> Site24x7 APM Insight: Get Deep Visibility into Application Performance
>>> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>>> Monitor end-to-end web transactions and take corrective actions now
>>> Troubleshoot faster and improve end-user experience. Signup Now!
>>> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>>> _______________________________________________
>>> Yap-users mailing list
>>> Yap...@li... <mailto:Yap...@li...>
>>> https://lists.sourceforge.net/lists/listinfo/yap-users
> 
> 
> 
> ------------------------------------------------------------------------------
> Site24x7 APM Insight: Get Deep Visibility into Application Performance
> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
> Monitor end-to-end web transactions and take corrective actions now
> Troubleshoot faster and improve end-user experience. Signup Now!
> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users

Re: [Yap-users] Fwd: Re: More fun problems!

[Vitor S. C. <vs...@dc...>]

Ed

Can you send me the program?

I am a bit confused the only chance I can see is that you have the same goal above and below the final, i.e. 

a(X) :- ….. findall(Y, b(Y),L)

b(Y) :- … a(X).

the problem here is that solutions found by the lower call for a are sent back to the top one, kind of like having a loop between the inside and the outside of the findall.l

But it is just a guess :(

Best


Vitor


> On 25 Feb 2016, at 15:44, Edward Schwartz <esc...@ce...> wrote:
> 
> Sharing this with the mailing list.  (The same problem occurs with
> findall and bagof.)
> 
> 
> -------- Forwarded Message --------
> Subject: 	Re: [Yap-users] More fun problems!
> Date: 	Wed, 24 Feb 2016 19:49:22 -0500
> From: 	Eyal Dechter <eya...@gm...>
> To: 	Edward Schwartz <esc...@ce...>
> 
> 
> 
> Looks like a bug to me. Findall shouldn't leave choice points.
> 
> Sent from my iPhone
> 
> On Feb 24, 2016, at 6:39 PM, Edward Schwartz <esc...@ce...
> <mailto:esc...@ce...>> wrote:
> 
>> 
>> Yes. And bagof.
>> 
>> 
>> Sent from my T-Mobile 4G LTE Device
>> 
>> 
>> -------- Original message --------
>> From: Eyal Dechter <eya...@gm... <mailto:eya...@gm...>>
>> Date: 2/24/2016 6:10 PM (GMT-05:00)
>> To: Edward Schwartz <esc...@ce... <mailto:esc...@ce...>>
>> Subject: Re: [Yap-users] More fun problems!
>> 
>> Do you get the same behavior with findall?
>> 
>> Sent from my iPhone
>> 
>>> On Feb 24, 2016, at 4:37 PM, Edward Schwartz <esc...@ce... <mailto:esc...@ce...>> wrote:
>>> 
>>> On 02/24/2016 04:35 PM, Edward Schwartz wrote:
>>> 
>>> I forgot to include the query:
>>> 
>>> certainInstanceCallsMethodSet(C,S).
>>> 
>>>> Here is the problematic output:
>>>> ok
>>>> method(101)
>>>> method(101)
>>>> ok
>>>> method(101)
>>>> method(102)
>>>> ok
>>>> method(101)
>>>> method(103)
>>>> hey
>>>> _164154
>>>> hey2
>>>> method(101)
>>>> C = method(101),
>>>> S = [method(101),method(102),method(103)] ? ;
>>>> here we go
>>>> method(104)
>>>> done!
>>>> false.
>>>> 
>>>> So the first rule is used to prove
>>>> certainInstanceCallsMethod(method(101), method(101)),
>>>> certainInstanceCallsMethod(method(101), method(102)), and
>>>> certainInstanceCallsMethod(method(101), method(103)).
>>>> 
>>>> The second rule begins evaluating, but stops when it reaches
>>>> certainVFTableEntry.  AFTER I hit semicolon some type of backtracking
>>>> occurs and the second rule finishes, proving
>>>> certainInstanceCallsMethod(method(101), method(104)).  If I execute the
>>>> query again, all four methods are included in the resulting set.
>>>> 
>>>> It's possible and even likely that certainVFTableEntry is recursing and
>>>> calling certainInstanceCallsMethod again; this is why we are using
>>>> tabling.  Assuming I have rid my program of all coroutining, is this a
>>>> bug, or is it some type of expected behavior?  In particular, why does
>>>> the backtracking happen outside of the setof()?
>>>> 
>>>> Thanks again,
>>>> 
>>>> Ed
>>>> 
>>>> ------------------------------------------------------------------------------
>>>> Site24x7 APM Insight: Get Deep Visibility into Application Performance
>>>> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>>>> Monitor end-to-end web transactions and take corrective actions now
>>>> Troubleshoot faster and improve end-user experience. Signup Now!
>>>> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>>>> _______________________________________________
>>>> Yap-users mailing list
>>>> Yap...@li... <mailto:Yap...@li...>
>>>> https://lists.sourceforge.net/lists/listinfo/yap-users
>>> 
>>> ------------------------------------------------------------------------------
>>> Site24x7 APM Insight: Get Deep Visibility into Application Performance
>>> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>>> Monitor end-to-end web transactions and take corrective actions now
>>> Troubleshoot faster and improve end-user experience. Signup Now!
>>> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>>> _______________________________________________
>>> Yap-users mailing list
>>> Yap...@li... <mailto:Yap...@li...>
>>> https://lists.sourceforge.net/lists/listinfo/yap-users
> 
> 
> 
> ------------------------------------------------------------------------------
> Site24x7 APM Insight: Get Deep Visibility into Application Performance
> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
> Monitor end-to-end web transactions and take corrective actions now
> Troubleshoot faster and improve end-user experience. Signup Now!
> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users

[Yap-users] RR 2016 - 1st Call for Papers

[Magdalena O. <or...@kr...>]

Apologies for multiple postings. 

[Yap-users] Fwd: Re: More fun problems!

[Edward S. <esc...@ce...>]

Sharing this with the mailing list.  (The same problem occurs with
findall and bagof.)


-------- Forwarded Message --------
Subject: 	Re: [Yap-users] More fun problems!
Date: 	Wed, 24 Feb 2016 19:49:22 -0500
From: 	Eyal Dechter <eya...@gm...>
To: 	Edward Schwartz <esc...@ce...>



Looks like a bug to me. Findall shouldn't leave choice points.

Sent from my iPhone

On Feb 24, 2016, at 6:39 PM, Edward Schwartz <esc...@ce...
<mailto:esc...@ce...>> wrote:

>
> Yes. And bagof.
>
>
> Sent from my T-Mobile 4G LTE Device
>
>
> -------- Original message --------
> From: Eyal Dechter <eya...@gm... <mailto:eya...@gm...>>
> Date: 2/24/2016 6:10 PM (GMT-05:00)
> To: Edward Schwartz <esc...@ce... <mailto:esc...@ce...>>
> Subject: Re: [Yap-users] More fun problems!
>
> Do you get the same behavior with findall?
>
> Sent from my iPhone
>
> > On Feb 24, 2016, at 4:37 PM, Edward Schwartz <esc...@ce... <mailto:esc...@ce...>> wrote:
> > 
> > On 02/24/2016 04:35 PM, Edward Schwartz wrote:
> > 
> > I forgot to include the query:
> > 
> > certainInstanceCallsMethodSet(C,S).
> > 
> >> Here is the problematic output:
> >> ok
> >> method(101)
> >> method(101)
> >> ok
> >> method(101)
> >> method(102)
> >> ok
> >> method(101)
> >> method(103)
> >> hey
> >> _164154
> >> hey2
> >> method(101)
> >> C = method(101),
> >> S = [method(101),method(102),method(103)] ? ;
> >> here we go
> >> method(104)
> >> done!
> >> false.
> >> 
> >> So the first rule is used to prove
> >> certainInstanceCallsMethod(method(101), method(101)),
> >> certainInstanceCallsMethod(method(101), method(102)), and
> >> certainInstanceCallsMethod(method(101), method(103)).
> >> 
> >> The second rule begins evaluating, but stops when it reaches
> >> certainVFTableEntry.  AFTER I hit semicolon some type of backtracking
> >> occurs and the second rule finishes, proving
> >> certainInstanceCallsMethod(method(101), method(104)).  If I execute the
> >> query again, all four methods are included in the resulting set.
> >> 
> >> It's possible and even likely that certainVFTableEntry is recursing and
> >> calling certainInstanceCallsMethod again; this is why we are using
> >> tabling.  Assuming I have rid my program of all coroutining, is this a
> >> bug, or is it some type of expected behavior?  In particular, why does
> >> the backtracking happen outside of the setof()?
> >> 
> >> Thanks again,
> >> 
> >> Ed
> >> 
> >> ------------------------------------------------------------------------------
> >> Site24x7 APM Insight: Get Deep Visibility into Application Performance
> >> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
> >> Monitor end-to-end web transactions and take corrective actions now
> >> Troubleshoot faster and improve end-user experience. Signup Now!
> >> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
> >> _______________________________________________
> >> Yap-users mailing list
> >> Yap...@li... <mailto:Yap...@li...>
> >> https://lists.sourceforge.net/lists/listinfo/yap-users
> > 
> > ------------------------------------------------------------------------------
> > Site24x7 APM Insight: Get Deep Visibility into Application Performance
> > APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
> > Monitor end-to-end web transactions and take corrective actions now
> > Troubleshoot faster and improve end-user experience. Signup Now!
> > http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
> > _______________________________________________
> > Yap-users mailing list
> > Yap...@li... <mailto:Yap...@li...>
> > https://lists.sourceforge.net/lists/listinfo/yap-users

[Yap-users] CFP ICLP 2016: 32nd International Conference on Logic Programming, New York City, Oct 17-21

[Peter S. <pet...@ma...>]

                               Call For Papers
              32nd International Conference on Logic Programming

                              New York City, USA
                             October 17‐21, 2016

               http://software.imdea.org/Conferences/ICLP2016/

Conference Scope

Since  the first conference held in Marseilles in 1982, ICLP has been the pre‐
mier international conference for presenting research  in  logic  programming.
Contributions  are sought in all areas of logic programming, including but not
restricted to:


 · Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge
   Representation.

 · Implementation: Compilation, Virtual Machines, Parallelism, Constraint Han‐
   dling Rules, Tabling.

 · Environments: Program Analysis, Transformation,  Validation,  Verification,
   Debugging, Profiling, Testing.

 · Language  Issues:  Concurrency,  Objects,  Coordination,  Mobility,  Higher
   Order, Types, Modes, Assertions, Programming Techniques.

 · Related Paradigms: Inductive and Co‐inductive Logic Programming, Constraint
   Logic Programming, Answer‐Set Programming, SAT‐Checking.

 · Applications:  Databases,  Big Data, Data Integration and Federation, Soft‐
   ware Engineering,  Natural  Language  Processing,  Web  and  Semantic  Web,
   Agents, Artificial Intelligence, Bioinformatics, and Education.


In  addition  to  the  presentations of accepted papers, the technical program
will include invited talks, advanced tutorials, the doctoral  consortium,  and
several workshops.

Important Dates

Paper registration (abstract):          22 April, 2016
Submission deadline:                    29 April, 2016
Notification to authors:                17 June, 2016
Revision deadline (when needed):        8 July, 2016
Final notification:                     22 July, 2016
Camera‐ready copy due:                  5 Aug, 2016
Conference:                             17‐21 Oct, 2016

Submission Details

Submissions  of  regular papers must be made in the condensed TPLP format (see
http://software.imdea.org/Conferences/ICLP2016/TPLP-ICLP-2016.tar)  via  Easy‐
Chair  (see  http://www.easychair.org/conferences/?conf=iclp2016).   A regular
paper must not exceed 14 pages including the bibliography, but the  paper  may
be  supplemented  with  appendices for proofs and details of datasets which do
not count towards this limit and which will be available as appendices to  the
published paper. We accept three kinds of papers:


 · Technical  papers  for technically sound, innovative ideas that can advance
   the state of logic programming;

 · Application papers that impact interesting application domains;

 · System and tool papers which emphasize  novelty,  practicality,  usability,
   and availability of the systems and tools described.


Application, system, and tool papers need to be clearly marked in their title.
All submissions must be written in English and describe  original,  previously
unpublished research, and must not simultaneously be submitted for publication
elsewhere.  Papers of the highest quality will be selected to be published  in
the journal of Theory and Practice of Logic Programming (TPLP), Cambridge Uni‐
versity Press (CUP). In order to ensure the  quality  of  the  final  version,
papers  may  be subject to more than one round of refereeing (within the deci‐
sion period).

The program committee may recommend some papers to be published  as  technical
communications.  Technical  communications (TCs) will be published by Dagstuhl
Publishing   in   the    OpenAccess    Series    in    Informatics    (OASIcs)
(http://www.dagstuhl.de/publikationen/oasics/).   These  TC  papers should not
exceed 14 pages including bibliography.  Authors can  also  elect  to  convert
their  submissions  into extended abstracts, of 2 or 3 pages, for inclusion in
the TCs.  This should allow authors to submit a long version  elsewhere.   All
regular papers and regular TCs will be presented during the conference.

Doctoral  consortium position papers, of between 10 and 14 pages, will also be
published as TCs.

Authors of accepted papers will, by default, be automatically included in  the
list  of  ALP  members, who will receive quarterly updates from the Logic Pro‐
gramming Newsletter at no cost.


Conference Organization

General Chairs:

Michael         Kifer           Stony Brook University, USA
Neng‐Fa         Zhou            City University of New York, USA

Program Chairs:

Manuel          Carro           UPM and IMDEA Software Institute, Spain
Andy            King            University of Kent, UK

Workshop Chair:

Marcello        Balduccini      Drexel University, USA

Publicity Chair:

Peter           Schueller       Marmara University, Turkey

Doctoral Consortium Chairs:

Marina          De Vos          University of Bath, UK
Neda            Saeedloei       University of Minnesota Duluth, USA

Programming Contest Chair:

Paul            Fodor           Stony Brook University, USA

Web Presence:

Joaquin         Arias           IMDEA Software Institute, Spain

Preliminary Program Committee:

Marcello        Balduccini      Drexel University, USA
Mutsunori       Banbara         Kobe University, Japan
Roman           Bartak          Charles University, Czech Republic
Pedro           Cabalar         University of Corunna, Spain
Mats            Carlsson        SICS, Sweden
Manuel          Carro           UPM and IMDEA Software Institute, Spain
Michael         Codish          Ben‐Gurion University of the Negev, Israel
Marina          De Vos          University of Bath, UK
Agostino        Dovier          Universita degli Studi di Udine, Italy
Gregory         Duck            National University of Singapore, Singapore
Esra            Erdem           Sabanci University, Turkey
Wolfgang        Faber           University of Huddersfield, UK
Thom            Fruehwirth      University of Ulm, Germany
John            Gallagher       Roskilde University, Denmark, and
                                IMDEA Software Institute, Spain
Marco           Gavanelli       Universita degli Studi di Ferrara, Italy
Martin          Gebser          University of Potsdam, Germany
Michael         Hanus           CAU Kiel, Germany
Katsumi         Inoue           NII, Japan
Gerda           Janssens        KU Leuven ‐ University of Leuven, Belgium
Andy            King            University of Kent, UK
Ekaterina       Komendantskaya  Heriot‐Watt University, UK
Michael         Leuschel        University of Dusseldorf, Germany
Vladimir        Lifschitz       University of Texas, USA
Jose F.         Morales         IMDEA Software Institute, Spain
Enrico          Pontelli        New Mexico State University, USA
Jorg            Puhrer          Leipzig University, Germany
Ricardo         Rocha           University of Porto, Portugal
Zoltan          Somogyi         Independent Researcher, Australia
Harald          Sondergaard     University of Melbourne, Australia
Theresa         Swift           NOVALINKS, US, and UNL, Portugal
Francesca       Toni            Imperial College London, UK
Irina           Trubitsyna      University of Calabria, Italy
Mirek           Truszczynski    University of Kentucky, USA
Alicia          Villanueva      Universitat Politecnica de Valencia, Spain
Jan             Wielemaker      VU University Amsterdam, Netherlands
Stefan          Woltran         TU Wien, Austria
Fangkai         Yang            Schlumberger Inc., USA
Jia‐Huai        You             University of Alberta, Canada

Workshops

The ICLP 2016 program will include several workshops.  They  are  perhaps  the
best  places  for  the  presentation of preliminary work, underdeveloped novel
ideas, and new open problems to a wide and interested audience with opportuni‐
ties for intensive discussions and project collaboration.

Autumn School on Computational Logic

A  school on computational logic is planned.  More up to date information will
be available at the conference Web page.

Doctoral Consortium

The Eleventh Doctoral Consortium (DC) on Logic Programming  provides  research
students  with  the  opportunity  to present and discuss their research direc‐
tions, and to obtain feedback from  both  peers  and  experts  in  the  field.
Accepted  participants  will  receive  partial financial support to attend the
event and the main conference. The best paper from the DC will  be  given  the
opportunity to present in a session of the main ICLP conference.

Conference Venue

The  venue  will  be  the  Sheraton LaGuardia East Hotel in Flushing, New York
City.  New York City is an international  tourist  destination,  receiving  56
million  tourists in 2014 alone. Several sources have ranked New York the most
photographed city in the world. Times square, known as the  city’s  heart,  is
the  brightly  illuminated hub of the Broadway theatre district. The Statue of
Liberty greets new arrivals to the Americas by ship in the late 19th and early
20th century, and is a globally recognized symbol of the United States. Flush‐
ing is associated by many with the  National  Tennis  Centre,  since  Flushing
Meadows  has  been  the home of the US Open Grand Slam tennis tournament every
year since 1978.

New York is the most populous city in the United States and one  of  the  most
populous  urban  agglomerations  in  the world. Situated in one of the world’s
largest natural harbours, New York City consists of  five  boroughs,  each  of
which is a separate county of New York State. The conference hotel is situated
in the Queens borough, just a two‐minute walk from  the  Flushing‐Main  Street
rail station.  Direct train lines take you directly from there to Times Square
in just over 45 minutes, which is fast for New York City. The Museum of Modern
Art  can  be  reached in under 40 mins, Grand Central Terminal in 40 mins, the
Empire State Building under 50 mins, and The High Line Park in 50 minutes.

The hotel is also close to LaGuardia Airports and JFK.  LaGuardia  is  just  3
miles  away  and  the  hotel  offers a complementary shuttle service.  John F.
Kennedy International Airport (JFK) is 10 miles away and can be reached within
30  minutes  by  taxi.  The hotel is situated in a vibrant Asian district that
offers a variety of Eastern cuisine, as well as many stores and shops.

Sponsor

The conference is sponsored by the Association for Logic Programming (ALP).

Financial Assistance

The Association for Logic Programming has funds to assist  financially  disad‐
vantaged  participants  and, especially, students to enable them to attend the
conference.  Inquiries should be made to the general chairs.

Re: [Yap-users] More fun problems!

[Edward S. <esc...@ce...>]

On 02/24/2016 04:35 PM, Edward Schwartz wrote:

I forgot to include the query:

certainInstanceCallsMethodSet(C,S).

> Here is the problematic output:
> ok
> method(101)
> method(101)
> ok
> method(101)
> method(102)
> ok
> method(101)
> method(103)
> hey
> _164154
> hey2
> method(101)
> C = method(101),
> S = [method(101),method(102),method(103)] ? ;
> here we go
> method(104)
> done!
> false.
> 
> So the first rule is used to prove
> certainInstanceCallsMethod(method(101), method(101)),
> certainInstanceCallsMethod(method(101), method(102)), and
> certainInstanceCallsMethod(method(101), method(103)).
> 
> The second rule begins evaluating, but stops when it reaches
> certainVFTableEntry.  AFTER I hit semicolon some type of backtracking
> occurs and the second rule finishes, proving
> certainInstanceCallsMethod(method(101), method(104)).  If I execute the
> query again, all four methods are included in the resulting set.
> 
> It's possible and even likely that certainVFTableEntry is recursing and
> calling certainInstanceCallsMethod again; this is why we are using
> tabling.  Assuming I have rid my program of all coroutining, is this a
> bug, or is it some type of expected behavior?  In particular, why does
> the backtracking happen outside of the setof()?
> 
> Thanks again,
> 
> Ed
> 
> ------------------------------------------------------------------------------
> Site24x7 APM Insight: Get Deep Visibility into Application Performance
> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
> Monitor end-to-end web transactions and take corrective actions now
> Troubleshoot faster and improve end-user experience. Signup Now!
> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
> 

[Yap-users] More fun problems!

[Edward S. <esc...@ce...>]

Hi all,

Thanks again for the help so far.  I removed clpfd from our program, and
that particular issue went away.  Unfortunately, we have another one.

Here's a snippet of the problem:

certainInstanceCallsMethod(Constructor, Method) :-
    someStuff(Constructor, Method),
    writeln('ok'), writeln(Constructor), writeln(Method).

certainInstanceCallsMethod(Constructor, Method) :-
    writeln('hey'),
    writeln(Method),
    certainConstructor(Constructor),
    writeln('hey2'),
    writeln(Constructor),
    certainVFTableEntry(VFTable, _, Method),
    writeln('here we go'),
    writeln(Method),
    % And the method is in that virtual function table.
    certainVFTableWrite(_, Constructor, _, VFTable),
    writeln('done!').

certainInstanceCallsMethodSet(Constructor, Set) :-
    certainConstructor(Constructor),
    setof(Method, certainInstanceCallsMethod(Constructor, Method), Set).

Here is the problematic output:
ok
method(101)
method(101)
ok
method(101)
method(102)
ok
method(101)
method(103)
hey
_164154
hey2
method(101)
C = method(101),
S = [method(101),method(102),method(103)] ? ;
here we go
method(104)
done!
false.

So the first rule is used to prove
certainInstanceCallsMethod(method(101), method(101)),
certainInstanceCallsMethod(method(101), method(102)), and
certainInstanceCallsMethod(method(101), method(103)).

The second rule begins evaluating, but stops when it reaches
certainVFTableEntry.  AFTER I hit semicolon some type of backtracking
occurs and the second rule finishes, proving
certainInstanceCallsMethod(method(101), method(104)).  If I execute the
query again, all four methods are included in the resulting set.

It's possible and even likely that certainVFTableEntry is recursing and
calling certainInstanceCallsMethod again; this is why we are using
tabling.  Assuming I have rid my program of all coroutining, is this a
bug, or is it some type of expected behavior?  In particular, why does
the backtracking happen outside of the setof()?

Thanks again,

Ed

Re: [Yap-users] Forall/2 Problem

[Vitor S. C. <vs...@gm...>]

That is correct, and Ricardo and I were talking about the need to improve
the tabling docs yesterday. There are a number of very usefuk features that
are not documented yet.

there are two problems with tabling constraints,IMHO

The first is the attribute vars. Shouldn't be so hard.

The second is something like

:- table a/2.

X in 1..5, x \== Y, Y in 1..5, b(X)


X in 1..5, x \== Y, Y in 1..5, Z \== Y, b(y), Z = 3

What should we table? Y depends on X (and Z)

One solution would be to tablethe whole graph, but tabling is about
repeating, so I don't see this helping.

You can also table graph fragments (sat)

I don't remember how far xsb went in their work, I think a general solution
is maybe very hard, so the programmer has to take charge.

So I'd suggest start withprojecting the constraints out before you table,
so that you only table what you want and can table.

Hope this helps

Vitor



On Wed, 24 Feb 2016 at 04:01, Eyal Dechter <eya...@gm...> wrote:

> Yes, they are incompatible. What "coroutining" is is not documented very
> well, but in section 1.1 there is the following
>
> "
>
>    - --enable-coroutining=yes gives you support for coroutining,
>    including freezing of goals, attributed variables, and constraints. This
>    will also enable support for infinite rational trees.
>
> "
>
> XSB Prolog according to its manual supports tabling with attributed
> variables, so it would be even nicer if this could be ported to YAP.
>
> Eyal
>
> On Tue, Feb 23, 2016 at 6:11 PM, Edward Schwartz <esc...@ce...>
> wrote:
>
>> On 02/23/2016 10:07 AM, Eyal Dechter wrote:
>> > Clpfd is implemented using attributed variables, I think, so I think
>> you'll have the same problem you did with diff/2.
>> >
>> > Sent from my iPhone
>>
>> Looking at the source code, clpfd does use attributed variables.  I take
>> it then that attributed variables and tabling are incompatible?  Are
>> attributed variables considered part of coroutining?
>>
>> In any case, it would be very nice if such cases could raise an error
>> instead of having unexpected behavior for us novice users!
>>
>> Best,
>>
>> Ed
>>
>
>

Re: [Yap-users] Forall/2 Problem

[Eyal D. <eya...@gm...>]

Yes, they are incompatible. What "coroutining" is is not documented very
well, but in section 1.1 there is the following

"

   - --enable-coroutining=yes gives you support for coroutining, including
   freezing of goals, attributed variables, and constraints. This will also
   enable support for infinite rational trees.

"

XSB Prolog according to its manual supports tabling with attributed
variables, so it would be even nicer if this could be ported to YAP.

Eyal

On Tue, Feb 23, 2016 at 6:11 PM, Edward Schwartz <esc...@ce...> wrote:

> On 02/23/2016 10:07 AM, Eyal Dechter wrote:
> > Clpfd is implemented using attributed variables, I think, so I think
> you'll have the same problem you did with diff/2.
> >
> > Sent from my iPhone
>
> Looking at the source code, clpfd does use attributed variables.  I take
> it then that attributed variables and tabling are incompatible?  Are
> attributed variables considered part of coroutining?
>
> In any case, it would be very nice if such cases could raise an error
> instead of having unexpected behavior for us novice users!
>
> Best,
>
> Ed
>

Re: [Yap-users] Forall/2 Problem

[Edward S. <esc...@ce...>]

On 02/23/2016 10:07 AM, Eyal Dechter wrote:
> Clpfd is implemented using attributed variables, I think, so I think you'll have the same problem you did with diff/2.
> 
> Sent from my iPhone

Looking at the source code, clpfd does use attributed variables.  I take
it then that attributed variables and tabling are incompatible?  Are
attributed variables considered part of coroutining?

In any case, it would be very nice if such cases could raise an error
instead of having unexpected behavior for us novice users!

Best,

Ed

Re: [Yap-users] Forall/2 Problem

[Eyal D. <eya...@gm...>]

Clpfd is implemented using attributed variables, I think, so I think you'll have the same problem you did with diff/2.

Sent from my iPhone

> On Feb 23, 2016, at 9:26 AM, Edward Schwartz <esc...@ce...> wrote:
> 
> Hi Vitor and Eyal,
> 
> Thank you for responding.  We don't use any cuts in our own code.  We do
> use clpfd; I'm not sure how that is implemented internally, and whether
> it would cause problems with tabling.
> 
> When I use start_low_level_trace, some of the progress right before
> "why?" is printed is related to clpfd... which makes me think that might
> be responsible.
> 
> Does this seem like a possibility?
> 
> Many thanks,
> 
> Ed
> 
>> On 02/22/2016 05:45 PM, Vitor Santos Costa wrote:
>> hi Edward
>> 
>> If you compile YAP under debug mode, there are two predicates
>> 
>> :- start_low_level_trace.
>> 
>> :- stop_low_level_trace.
>> 
>> They will tell you all calls made. It is often a good idea to filter
>> them by using grep or by narrowing. 
>> 
>> The second point may be looking at the final tables, that may help too.
>> 
>> I'm forwarding this to Ricardo, he is the expert.
>> 
>> Best
>> 
>> Vitor
>> 
>> On Mon, Feb 22, 2016 at 9:56 PM, Eyal Dechter <eya...@gm...
>> <mailto:eya...@gm...>> wrote:
>> 
>>    HI Ed, there are all sorts of reasons this could print 'why?'. Its
>>    hard to say without knowing more about what your code does.  If the
>>    code is pure, I'm not sure why this would happen, but otherwise it's
>>    not hard to come up with examples. For example: 
>> 
>>     ?- [user].
>>     % consulting user_input...
>>    c(X) :- nonvar(X), !, fail. 
>>    |     c(1). 
>>    |     c(2).
>>    |      % consulted user_input in module user, 1 msec 0 bytes
>>    true.
>>     ?- forall(c(X), (c(X); writeln(why))).
>>    why
>>    why
>>    true.
>> 
>>    All any use of mutable variables, set_arg, asserta, or similar
>>    things can cause this. Not sure about tabling. 
>> 
>>    Eyal
>> 
>>    On Mon, Feb 22, 2016 at 3:28 PM, Edward Schwartz <esc...@ce...
>>    <mailto:esc...@ce...>> wrote:
>> 
>>        Hi all,
>> 
>>        I am encountering another strange problem.  It's difficult to
>>        reproduce
>>        in a small example, but should the following rule ever print "WHY?":
>> 
>>        testcase :-
>>            forall(foo(I, F, P, O, T, E, M),
>>                    (foo(I, F, P, O, T, E, M);
>>                    writeln('why?'))).
>> 
>>        Is it possible this is a bug relating to tabling (foo is
>>        tabled)?  How
>>        can I debug this?
>> 
>>        Thanks,
>> 
>>        Ed
>> 
>>        ------------------------------------------------------------------------------
>>        Site24x7 APM Insight: Get Deep Visibility into Application
>>        Performance
>>        APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>>        Monitor end-to-end web transactions and take corrective actions now
>>        Troubleshoot faster and improve end-user experience. Signup Now!
>>        http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>>        _______________________________________________
>>        Yap-users mailing list
>>        Yap...@li...
>>        <mailto:Yap...@li...>
>>        https://lists.sourceforge.net/lists/listinfo/yap-users
>> 
>> 
>> 
>>    ------------------------------------------------------------------------------
>>    Site24x7 APM Insight: Get Deep Visibility into Application Performance
>>    APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>>    Monitor end-to-end web transactions and take corrective actions now
>>    Troubleshoot faster and improve end-user experience. Signup Now!
>>    http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>>    _______________________________________________
>>    Yap-users mailing list
>>    Yap...@li... <mailto:Yap...@li...>
>>    https://lists.sourceforge.net/lists/listinfo/yap-users
>> 
>> 

Re: [Yap-users] Forall/2 Problem

[Edward S. <esc...@ce...>]

Hi Vitor and Eyal,

Thank you for responding.  We don't use any cuts in our own code.  We do
use clpfd; I'm not sure how that is implemented internally, and whether
it would cause problems with tabling.

When I use start_low_level_trace, some of the progress right before
"why?" is printed is related to clpfd... which makes me think that might
be responsible.

Does this seem like a possibility?

Many thanks,

Ed

On 02/22/2016 05:45 PM, Vitor Santos Costa wrote:
> hi Edward
> 
> If you compile YAP under debug mode, there are two predicates
> 
> :- start_low_level_trace.
> 
> :- stop_low_level_trace.
> 
> They will tell you all calls made. It is often a good idea to filter
> them by using grep or by narrowing. 
> 
> The second point may be looking at the final tables, that may help too.
> 
> I'm forwarding this to Ricardo, he is the expert.
> 
> Best
> 
> Vitor
> 
> On Mon, Feb 22, 2016 at 9:56 PM, Eyal Dechter <eya...@gm...
> <mailto:eya...@gm...>> wrote:
> 
>     HI Ed, there are all sorts of reasons this could print 'why?'. Its
>     hard to say without knowing more about what your code does.  If the
>     code is pure, I'm not sure why this would happen, but otherwise it's
>     not hard to come up with examples. For example: 
> 
>      ?- [user].
>      % consulting user_input...
>     c(X) :- nonvar(X), !, fail. 
>     |     c(1). 
>     |     c(2).
>     |      % consulted user_input in module user, 1 msec 0 bytes
>     true.
>      ?- forall(c(X), (c(X); writeln(why))).
>     why
>     why
>     true.
> 
>     All any use of mutable variables, set_arg, asserta, or similar
>     things can cause this. Not sure about tabling. 
> 
>     Eyal
> 
>     On Mon, Feb 22, 2016 at 3:28 PM, Edward Schwartz <esc...@ce...
>     <mailto:esc...@ce...>> wrote:
> 
>         Hi all,
> 
>         I am encountering another strange problem.  It's difficult to
>         reproduce
>         in a small example, but should the following rule ever print "WHY?":
> 
>         testcase :-
>             forall(foo(I, F, P, O, T, E, M),
>                     (foo(I, F, P, O, T, E, M);
>                     writeln('why?'))).
> 
>         Is it possible this is a bug relating to tabling (foo is
>         tabled)?  How
>         can I debug this?
> 
>         Thanks,
> 
>         Ed
> 
>         ------------------------------------------------------------------------------
>         Site24x7 APM Insight: Get Deep Visibility into Application
>         Performance
>         APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>         Monitor end-to-end web transactions and take corrective actions now
>         Troubleshoot faster and improve end-user experience. Signup Now!
>         http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>         _______________________________________________
>         Yap-users mailing list
>         Yap...@li...
>         <mailto:Yap...@li...>
>         https://lists.sourceforge.net/lists/listinfo/yap-users
> 
> 
> 
>     ------------------------------------------------------------------------------
>     Site24x7 APM Insight: Get Deep Visibility into Application Performance
>     APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>     Monitor end-to-end web transactions and take corrective actions now
>     Troubleshoot faster and improve end-user experience. Signup Now!
>     http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>     _______________________________________________
>     Yap-users mailing list
>     Yap...@li... <mailto:Yap...@li...>
>     https://lists.sourceforge.net/lists/listinfo/yap-users
> 
> 

Re: [Yap-users] Forall/2 Problem

[Vitor S. C. <vs...@gm...>]

hi Edward

If you compile YAP under debug mode, there are two predicates

:- start_low_level_trace.

:- stop_low_level_trace.

They will tell you all calls made. It is often a good idea to filter them
by using grep or by narrowing.

The second point may be looking at the final tables, that may help too.

I'm forwarding this to Ricardo, he is the expert.

Best

Vitor

On Mon, Feb 22, 2016 at 9:56 PM, Eyal Dechter <eya...@gm...> wrote:

> HI Ed, there are all sorts of reasons this could print 'why?'. Its hard to
> say without knowing more about what your code does.  If the code is pure,
> I'm not sure why this would happen, but otherwise it's not hard to come up
> with examples. For example:
>
>  ?- [user].
>  % consulting user_input...
> c(X) :- nonvar(X), !, fail.
> |     c(1).
> |     c(2).
> |      % consulted user_input in module user, 1 msec 0 bytes
> true.
>  ?- forall(c(X), (c(X); writeln(why))).
> why
> why
> true.
>
> All any use of mutable variables, set_arg, asserta, or similar things can
> cause this. Not sure about tabling.
>
> Eyal
>
> On Mon, Feb 22, 2016 at 3:28 PM, Edward Schwartz <esc...@ce...>
> wrote:
>
>> Hi all,
>>
>> I am encountering another strange problem.  It's difficult to reproduce
>> in a small example, but should the following rule ever print "WHY?":
>>
>> testcase :-
>>     forall(foo(I, F, P, O, T, E, M),
>>             (foo(I, F, P, O, T, E, M);
>>             writeln('why?'))).
>>
>> Is it possible this is a bug relating to tabling (foo is tabled)?  How
>> can I debug this?
>>
>> Thanks,
>>
>> Ed
>>
>>
>> ------------------------------------------------------------------------------
>> Site24x7 APM Insight: Get Deep Visibility into Application Performance
>> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
>> Monitor end-to-end web transactions and take corrective actions now
>> Troubleshoot faster and improve end-user experience. Signup Now!
>> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
>> _______________________________________________
>> Yap-users mailing list
>> Yap...@li...
>> https://lists.sourceforge.net/lists/listinfo/yap-users
>>
>
>
>
> ------------------------------------------------------------------------------
> Site24x7 APM Insight: Get Deep Visibility into Application Performance
> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
> Monitor end-to-end web transactions and take corrective actions now
> Troubleshoot faster and improve end-user experience. Signup Now!
> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
>
>

Re: [Yap-users] Forall/2 Problem

[Eyal D. <eya...@gm...>]

HI Ed, there are all sorts of reasons this could print 'why?'. Its hard to
say without knowing more about what your code does.  If the code is pure,
I'm not sure why this would happen, but otherwise it's not hard to come up
with examples. For example:

 ?- [user].
 % consulting user_input...
c(X) :- nonvar(X), !, fail.
|     c(1).
|     c(2).
|      % consulted user_input in module user, 1 msec 0 bytes
true.
 ?- forall(c(X), (c(X); writeln(why))).
why
why
true.

All any use of mutable variables, set_arg, asserta, or similar things can
cause this. Not sure about tabling.

Eyal

On Mon, Feb 22, 2016 at 3:28 PM, Edward Schwartz <esc...@ce...> wrote:

> Hi all,
>
> I am encountering another strange problem.  It's difficult to reproduce
> in a small example, but should the following rule ever print "WHY?":
>
> testcase :-
>     forall(foo(I, F, P, O, T, E, M),
>             (foo(I, F, P, O, T, E, M);
>             writeln('why?'))).
>
> Is it possible this is a bug relating to tabling (foo is tabled)?  How
> can I debug this?
>
> Thanks,
>
> Ed
>
>
> ------------------------------------------------------------------------------
> Site24x7 APM Insight: Get Deep Visibility into Application Performance
> APM + Mobile APM + RUM: Monitor 3 App instances at just $35/Month
> Monitor end-to-end web transactions and take corrective actions now
> Troubleshoot faster and improve end-user experience. Signup Now!
> http://pubads.g.doubleclick.net/gampad/clk?id=272487151&iu=/4140
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
>

[Yap-users] Forall/2 Problem

[Edward S. <esc...@ce...>]

Hi all,

I am encountering another strange problem.  It's difficult to reproduce
in a small example, but should the following rule ever print "WHY?":

testcase :-
    forall(foo(I, F, P, O, T, E, M),
            (foo(I, F, P, O, T, E, M);
            writeln('why?'))).

Is it possible this is a bug relating to tabling (foo is tabled)?  How
can I debug this?

Thanks,

Ed

[Yap-users] Prolog standards compliance bugs

[Paulo M. <pm...@lo...>]

Hi,

For those of you that are looking for opportunities to help in YAP development, you can get a list of current Prolog standards (official and de facto) bugs by installing Logtalk and using its standard compliance suite. After installation and compilation of the current YAP git version, try:

$ cd ~/logtalk/tests/prolog
$ logtalk_tester -p yap
...

As of this writing, we have:

*******************************************************************************
***** 1516 tests:       14 skipped,     1313 passed,      189 failed
*******************************************************************************

A good number of the failed tests concern non-standard exception terms and should be easy or relatively easy to fix. Happy patching :-)

Cheers,

Paulo

-----------------------------------------------------------------
Paulo Moura
Logtalk developer

Email: <mailto:pm...@lo...>
Web:   <http://logtalk.org/>
-----------------------------------------------------------------

Re: [Yap-users] Strange tabling behavior with dif/2

[Eyal D. <eya...@gm...>]

Why do you need this diff/1 at all?

Why not?

:- table same/2.

same(1, 2).
same(1, 3).

same(4, 5).
same(4, 6).

same(X, Y) :- same(Y, X).
same(X, Z) :- same(X, Y), same(Y, Z).

you can exclude same(X, X) in a new predicate like:

same1(X, Y) :- same(X, Y), X \= Y.

Eyal




On Tue, Feb 16, 2016 at 2:05 PM, Edward Schwartz <esc...@ce...> wrote:

> Hi Eyal,
>
> Thank you -- this seems to explain the behavior I'm seeing.  Do you have
> any suggested alternative?  A version of dif/2 that doesn't use
> co-routining maybe?  Does such a thing exist?
>
> Thanks,
>
> Ed
>
> On 02/16/2016 01:29 PM, Eyal Dechter wrote:
> > Hi Ed,
> >
> > I think that this is because dif/2 is part of the co-routining extension
> > and the tabling extension (YAPTab) doesn't support the co-routining
> > extension. According to the manual (section 18) this should through an
> > error; that it doesn't is likely a bug.
> >
> > I think the reason it is not supported is because tabling in YAP depends
> > on being able to ask when one term is a variant of another. But in the
> > presence of constraints like dif/2, two terms that are syntactic
> > variants are no longer necessarily unifiable.
> >
> > Best,
> > Eyal
>