yap-users — General Information on Yap

[Yap-users] ACAI 2018 Summer School on Statistical Relational Artificial Intelligence

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

The Advanced Course on AI (ACAI) is a specialized course in Artificial Intelligence sponsored by EurAI. The 2018 edition will be in Ferrara, Italy on August 27th - 31st 2018, save the date!
The theme of the 2018 ACAI School is Statistical Relational Artificial Intelligence (StarAI).
StarAI is an emerging area that combines logical (or relational) AI and probabilistic (or statistical) AI.

Relational AI deals very effectively with complex domains involving many and even a varying number of entities connected by complex relationships, while statistical AI manages well the uncertainty that derives from incomplete and noisy descriptions of the domains. Both fields achieved significant successes over the last thirty years but evolved largely independently until about fifteen years ago, when the potential originating from their combination started to emerge. Statistical Relational Learning (SRL) was proposed for exploiting relational descriptions in statistical machine learning methods from the field of graphical models. Meanwhile, the scope of SRL was significantly advanced in StarAI to cover all forms of reasoning and models of AI. StarAI is nowadays an ample area encompassing many and diverse approaches.

The school includes courses on foundations of relational and statistical AI together with advanced courses on the new StarAI approaches and applications. The talks will provide theoretical background, practical examples and real applications where StarAI can play a role. Hands-on classes will be also organized where the main StarAI techniques will be applied to 'small' examples.

The list of confirmed lectures is:

Luc De Raedt: Probabilistic Programming
Paolo Frasconi: Kernels and deep networks for structured data
Sebastian Riedel: Differentiable Program Interpreters
Artur d'Avila Garcez: Neural-symbolic learning
Marco Lippi: Applications of Statistical Relational Artificial Intelligence
Sriraam Natarajan: Human-in-the-loop Statistical Relational Learning
Mathias Niepert and Alberto García Durán: Multi-Modal Neural Link Prediction
Kristian Kersting: Lifted Statistical Machine Learning
Fabrizio Riguzzi: Probabilistic Inductive Logic Programming

Up to date information can be found at the event website
http://acai2018.unife.it/.
The registration fees will be published shortly.

ACAI 2018 is part of the Relational Artificial Intelligence Days 2018 (RAID 2018, http://raid2018.unife.it/ ), which will be held in Ferrara, Italy, on August 27th 2018 - September 4th 2018. RAID includes, besides ACAI 2018, also:
- PLP 2018: 5th Workshop on Probabilistic Logic Programming, September 1st 2018, http://stoics.org.uk/plp/plp2018/;
- ILP 2018: 28th International Conference on Inductive Logic Programming, September 2nd - 4th 2018, http://ilp2018.unife.it/.

Probabilistic Logic Programming (PLP) addresses the need to reason about relational domains under uncertainty arising in a variety of application domains. PLP is part of a wider current interest in probabilistic programming.  PLP 2018  aims to bring together researchers in all aspects of probabilistic logic programming, including theoretical work, system implementations and applications.

The ILP conference series, started in 1991, is the premier international forum for learning from structured or semi-structured relational data. Originally focusing on the induction of logic programs, over the years it has significantly expanded and it welcomes contributions to all aspects of learning in logic, multi-relational data mining, statistical relational learning, graph and tree mining, learning in other (non-propositional) logic-based knowledge representation frameworks, exploring intersections to statistical learning and other probabilistic approaches.

RAID 2018 offers a very good opportunity to get up to date with the latest trends in logical and relational AI. We really hope to meet you in Ferrara!

Organizers
Kristian Kersting, TU Darmstadt, Germany
Marco Lippi, University of Modena and Reggio Emilia, Italy
Sriraam Natarajan, University of Texas at Dallas, USA
Fabrizio Riguzzi, University of Ferrara, Italy
Elena Bellodi, University of Ferrara, Italy
Tom Schrijvers, KU Leuven, Belgium
Riccardo Zese, University of Ferrara, Italy

[Yap-users] [Last CfP] PADL 2018 - abstract deadline EXTENDED TO SEPTEMBER 10, 2017

[<ma...@ma...>]

[with apologies for cross-postings]


Call for Papers
===============
20th International Symposium on
Practical Aspects of Declarative Languages (PADL 2018)
http://popl18.sigplan.org/track/PADL-2018-papers

Los Angeles, CA, USA, 8 - 9 January, 2018

Co-located with ACM POPL 2018 (http://popl18.sigplan.org/home)

The two best papers accepted for publication at PADL will be invited to
submit an extended version for rapid publication in the journal Theory and
Practice of Logic Programming.


Conference Description
======================
Declarative languages build on sound theoretical bases to provide
attractive frameworks for application development. These languages have
been successfully applied to many different real-world situations, ranging
from data base management to active networks to software engineering to
decision support systems.

New developments in theory and implementation have opened up new
application areas. At the same time, applications of declarative languages
to novel problems raise numerous interesting research issues. Well-known
questions include designing for scalability, language extensions for
application deployment, and programming environments. Thus, applications
drive the progress in the theory and implementation of declarative
systems, and benefit from this progress
as well.

PADL is a well-established forum for researchers and practitioners to
present original work emphasizing novel applications and implementation
techniques for all forms of declarative concepts, including, functional,
logic, constraints, etc.
Topics of interest include, but are not limited to:
* Innovative applications of declarative languages
* Declarative domain-specific languages and applications
* Practical applications of theoretical results
* New language developments and their impact on applications
* Declarative languages and software engineering
* Evaluation of implementation techniques on practical applications
* Practical experiences and industrial applications
* Novel uses of declarative languages in the classroom
* Practical extensions such as constraint-based, probabilistic, and
  reactive languages.

PADL 2018 welcomes new ideas and approaches pertaining to applications and
implementation of declarative languages, and is not limited to the scope
of the past PADL symposia. It will be co-located with the Symposium on
Principles of Programming Languages (POPL 2018), in Los Angeles, CA, USA.


Important Dates and Submission Guidelines
=========================================
Abstract submission: September 10, 2017 (Extended)
Paper submission: September 15, 2017 (Extended)
Notification: October 9, 2017
Camera-ready: October 23, 2017
Symposium: January 8-9, 2018

Authors should submit an electronic copy of the full paper in PDF using
the Springer LNCS format. The submission will be done through EasyChair
conference system:

    https://easychair.org/conferences/?conf=padl2018

All submissions must be original work written in English. Submissions must
be unpublished and not submitted for publication elsewhere. Work that
already appeared in unpublished or informally published workshops
proceedings may be submitted but the authors should notify the program
chair about the place on which it has previously appeared.

PADL 2018 will accept both technical and application papers:
* Technical papers must describe original, previously unpublished research
results. Technical papers must not exceed 15 pages (plus one page of
references) in Springer LNCS format.
* Application papers are a mechanism to present important practical  
applications of declarative languages that occur in industry or in areas
of research other than Computer Science. Application papers are expected
to describe complex and/or real-world applications that rely on an
innovative use of declarative languages. Application descriptions,
engineering solutions and real-world experiences (both positive and
negative) are solicited. The limit for application papers is 8 pages in
Springer LNCS format but such papers can also point to sites with
supplemental information about the application or the system that they
describe.

The proceedings of PADL 2018 will appear in the LNCS series of Springer
Verlag (www.springer.com/lncs).

Two papers accepted for publication at PADL'18 will be nominated for the
Most Practical Paper award (one of them as the Student Best Paper), each
in cash amount of 250 Euro. These two papers will be invited to submit an
extended version of their contribution to the journal "Theory and Practice
of Logic Programming" for rapid publication. The extended version should
contain at least 30% new content compared to the published conference
paper. The extended paper will undergo an additional review process.


Program Committee
=================
* Daan Leijen, Microsoft Research
* Daniel Winograd-Cort, University of Pennsylvania
* David Van Horn, University of Maryland
* Edwin Brady, University of St. Andrews
* Enrico Pontelli, New Mexico State University
* Erika Abraham, RWTH Aachen University
* Esra Erdem, Sabanci University
* Francesco Calimeri, University of Calabria
* Geoffrey Mainland, Drexel University
* Grigore Rosu, University of Illinois at Urbana-Champaign
* James Cheney, University of Edinburgh
* Jurriaan Hage, Universiteit Utrecht
* Karl Crary, Carnegie Mellon University
* Konstantin Schekotihin, University of Klagenfurt
* Lars Bergstrom, Mozilla Research
* Lukasz Ziarek, SUNY Buffalo
* Manuel Carro, Technical University of Madrid and UPM and IMDEA Software
Institute
* Marcello Balduccini, Saint Joseph's University
* Marco Gavanelli, University of Ferrara
* Marco Maratea, University of Genova
* Martin Gebser, University of Potsdam
* Mats Carlsson, SICS
* Meera Sridhar, University of North Carolina Charlotte
* Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center
* Paul Tarau, University of North Texas
* Paulo Oliva, Queen Mary University of London
* Peter Schüller, Marmara University
* Ricardo Rocha, University of Porto
* Stefan Woltran, Vienna University of Technology
* Stefania Costantini, University of L'Aquila
* Wolfgang Faber, University of Huddersfield

Publicity Chair:
* Marco Manna, University of Calabria, Italy

Program Chairs:
* Nicola Leone, University of Calabria, Italy
* Kevin Hamlen, University of Texas at Dallas, TX, USA


Contacts
========
For additional information about papers and submissions, please write to
the official conference email address, or contact the Program
Chairs:

* email: pad...@ea...

* Nicola Leone
  University of Calabria, Italy
  https://www.mat.unical.it/leone/

* Kevin Hamlen
  University of Texas at Dallas, TX, USA
  http://www.utdallas.edu/~hamlen/

[Yap-users] [CfP] PADL 2018 - abstract submission DEADLINE APPROACHING

[<ma...@ma...>]

[We apology for possible cross posting]


Call for Papers
===============
20th International Symposium on
Practical Aspects of Declarative Languages (PADL 2018)
http://popl18.sigplan.org/track/PADL-2018-papers

Los Angeles, CA, USA, 8 - 9 January, 2018

Co-located with ACM POPL 2018 (http://popl18.sigplan.org/home)

The two best papers accepted for publication at PADL will be invited to
submit an extended version for rapid publication in the journal Theory and
Practice of Logic Programming.


Conference Description
======================
Declarative languages build on sound theoretical bases to provide
attractive frameworks for application development. These languages have
been successfully applied to many different real-world situations, ranging
from data base management to active networks to software engineering to
decision support systems.

New developments in theory and implementation have opened up new
application areas. At the same time, applications of declarative languages
to novel problems raise numerous interesting research issues. Well-known
questions include designing for scalability, language extensions for
application deployment, and programming environments. Thus, applications
drive the progress in the theory and implementation of declarative
systems, and benefit from this progress
as well.

PADL is a well-established forum for researchers and practitioners to
present original work emphasizing novel applications and implementation
techniques for all forms of declarative concepts, including, functional,
logic, constraints, etc.
Topics of interest include, but are not limited to:
* Innovative applications of declarative languages
* Declarative domain-specific languages and applications
* Practical applications of theoretical results
* New language developments and their impact on applications
* Declarative languages and software engineering
* Evaluation of implementation techniques on practical applications
* Practical experiences and industrial applications
* Novel uses of declarative languages in the classroom
* Practical extensions such as constraint-based, probabilistic, and
  reactive languages.

PADL 2018 welcomes new ideas and approaches pertaining to applications and
implementation of declarative languages, and is not limited to the scope
of the past PADL symposia. It will be co-located with the Symposium on
Principles of Programming Languages (POPL 2018), in Los Angeles, CA, USA.


Important Dates and Submission Guidelines
=========================================
Abstract submission: September 3, 2017
Paper submission: September 10, 2017
Notification: October 9, 2017
Camera-ready: October 23, 2017
Symposium: January 8-9, 2018

Authors should submit an electronic copy of the full paper in PDF using
the Springer LNCS format. The submission will be done through EasyChair
conference system:

    https://easychair.org/conferences/?conf=padl2018

All submissions must be original work written in English. Submissions must
be unpublished and not submitted for publication elsewhere. Work that
already appeared in unpublished or informally published workshops
proceedings may be submitted but the authors should notify the program
chair about the place on which it has previously appeared.

PADL 2018 will accept both technical and application papers:
* Technical papers must describe original, previously unpublished research
results. Technical papers must not exceed 15 pages (plus one page of
references) in Springer LNCS format.
* Application papers are a mechanism to present important practical  
applications of declarative languages that occur in industry or in areas
of research other than Computer Science. Application papers are expected
to describe complex and/or real-world applications that rely on an
innovative use of declarative languages. Application descriptions,
engineering solutions and real-world experiences (both positive and
negative) are solicited. The limit for application papers is 8 pages in
Springer LNCS format but such papers can also point to sites with
supplemental information about the application or the system that they
describe.

The proceedings of PADL 2018 will appear in the LNCS series of Springer
Verlag (www.springer.com/lncs).

Two papers accepted for publication at PADL'18 will be nominated for the
Most Practical Paper award (one of them as the Student Best Paper), each
in cash amount of 250 Euro. These two papers will be invited to submit an
extended version of their contribution to the journal "Theory and Practice
of Logic Programming" for rapid publication. The extended version should
contain at least 30% new content compared to the published conference
paper. The extended paper will undergo an additional review process.


Program Committee
=================
* Daan Leijen, Microsoft Research
* Daniel Winograd-Cort, University of Pennsylvania
* David Van Horn, University of Maryland
* Edwin Brady, University of St. Andrews
* Enrico Pontelli, New Mexico State University
* Erika Abraham, RWTH Aachen University
* Esra Erdem, Sabanci University
* Francesco Calimeri, University of Calabria
* Geoffrey Mainland, Drexel University
* Grigore Rosu, University of Illinois at Urbana-Champaign
* James Cheney, University of Edinburgh
* Jurriaan Hage, Universiteit Utrecht
* Karl Crary, Carnegie Mellon University
* Konstantin Schekotihin, University of Klagenfurt
* Lars Bergstrom, Mozilla Research
* Lukasz Ziarek, SUNY Buffalo
* Manuel Carro, Technical University of Madrid and UPM and IMDEA Software
Institute
* Marcello Balduccini, Saint Joseph's University
* Marco Gavanelli, University of Ferrara
* Marco Maratea, University of Genova
* Martin Gebser, University of Potsdam
* Mats Carlsson, SICS
* Meera Sridhar, University of North Carolina Charlotte
* Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center
* Paul Tarau, University of North Texas
* Paulo Oliva, Queen Mary University of London
* Peter Schüller, Marmara University
* Ricardo Rocha, University of Porto
* Stefan Woltran, Vienna University of Technology
* Stefania Costantini, University of L'Aquila
* Wolfgang Faber, University of Huddersfield

Publicity Chair:
* Marco Manna, University of Calabria, Italy

Program Chairs:
* Nicola Leone, University of Calabria, Italy
* Kevin Hamlen, University of Texas at Dallas, TX, USA


Contacts
========
For additional information about papers and submissions, please write to
the official conference email address, or contact the Program
Chairs:

* email: pad...@ea...

* Nicola Leone
  University of Calabria, Italy
  https://www.mat.unical.it/leone/

* Kevin Hamlen
  University of Texas at Dallas, TX, USA
  http://www.utdallas.edu/~hamlen/

[Yap-users] 3rd CfP: PADL 2018 - 20th International Symposium on Practical Aspects of Declarative Languages

[<ma...@ma...>]

[Apologize for unintended cross-mailing]


Call for Papers
===============
20th International Symposium on
Practical Aspects of Declarative Languages (PADL 2018)
http://popl18.sigplan.org/track/PADL-2018-papers

Los Angeles, CA, USA, 8 - 9 January, 2018

Co-located with ACM POPL 2018 (http://popl18.sigplan.org/home)

The two best papers accepted for publication at PADL will be invited to
submit an extended version for rapid publication in the journal Theory and
Practice of Logic Programming.


Conference Description
======================
Declarative languages build on sound theoretical bases to provide
attractive frameworks for application development. These languages have
been successfully applied to many different real-world situations, ranging
from data base management to active networks to software engineering to
decision support systems.

New developments in theory and implementation have opened up new
application areas. At the same time, applications of declarative languages
to novel problems raise numerous interesting research issues. Well-known
questions include designing for scalability, language extensions for
application deployment, and programming environments. Thus, applications
drive the progress in the theory and implementation of declarative
systems, and benefit from this progress
as well.

PADL is a well-established forum for researchers and practitioners to
present original work emphasizing novel applications and implementation
techniques for all forms of declarative concepts, including, functional,
logic, constraints, etc.
Topics of interest include, but are not limited to:
* Innovative applications of declarative languages
* Declarative domain-specific languages and applications
* Practical applications of theoretical results
* New language developments and their impact on applications
* Declarative languages and software engineering
* Evaluation of implementation techniques on practical applications
* Practical experiences and industrial applications
* Novel uses of declarative languages in the classroom
* Practical extensions such as constraint-based, probabilistic, and
  reactive languages.

PADL 2018 welcomes new ideas and approaches pertaining to applications and
implementation of declarative languages, and is not limited to the scope
of the past PADL symposia. It will be co-located with the Symposium on
Principles of Programming Languages (POPL 2018), in Los Angeles, CA, USA.


Important Dates and Submission Guidelines
=========================================
Abstract submission: September 3, 2017
Paper submission: September 10, 2017
Notification: October 9, 2017
Camera-ready: October 23, 2017
Symposium: January 8-9, 2018

Authors should submit an electronic copy of the full paper in PDF using
the Springer LNCS format. The submission will be done through EasyChair
conference system:

    https://easychair.org/conferences/?conf=padl2018

All submissions must be original work written in English. Submissions must
be unpublished and not submitted for publication elsewhere. Work that
already appeared in unpublished or informally published workshops
proceedings may be submitted but the authors should notify the program
chair about the place on which it has previously appeared.

PADL 2018 will accept both technical and application papers:
* Technical papers must describe original, previously unpublished research
results. Technical papers must not exceed 15 pages (plus one page of
references) in Springer LNCS format.
* Application papers are a mechanism to present important practical  
applications of declarative languages that occur in industry or in areas
of research other than Computer Science. Application papers are expected
to describe complex and/or real-world applications that rely on an
innovative use of declarative languages. Application descriptions,
engineering solutions and real-world experiences (both positive and
negative) are solicited. The limit for application papers is 8 pages in
Springer LNCS format but such papers can also point to sites with
supplemental information about the application or the system that they
describe.

The proceedings of PADL 2018 will appear in the LNCS series of Springer
Verlag (www.springer.com/lncs).

Two papers accepted for publication at PADL'18 will be nominated for the
Most Practical Paper award (one of them as the Student Best Paper), each
in cash amount of 250 Euro. These two papers will be invited to submit an
extended version of their contribution to the journal "Theory and Practice
of Logic Programming" for rapid publication. The extended version should
contain at least 30% new content compared to the published conference
paper. The extended paper will undergo an additional review process.


Program Committee
=================
* Daan Leijen, Microsoft Research
* Daniel Winograd-Cort, University of Pennsylvania
* David Van Horn, University of Maryland
* Edwin Brady, University of St. Andrews
* Enrico Pontelli, New Mexico State University
* Erika Abraham, RWTH Aachen University
* Esra Erdem, Sabanci University
* Francesco Calimeri, University of Calabria
* Geoffrey Mainland, Drexel University
* Grigore Rosu, University of Illinois at Urbana-Champaign
* James Cheney, University of Edinburgh
* Jurriaan Hage, Universiteit Utrecht
* Karl Crary, Carnegie Mellon University
* Konstantin Schekotihin, University of Klagenfurt
* Lars Bergstrom, Mozilla Research
* Lukasz Ziarek, SUNY Buffalo
* Manuel Carro, Technical University of Madrid and UPM and IMDEA Software
Institute
* Marcello Balduccini, Saint Joseph's University
* Marco Gavanelli, University of Ferrara
* Marco Maratea, University of Genova
* Martin Gebser, University of Potsdam
* Mats Carlsson, SICS
* Meera Sridhar, University of North Carolina Charlotte
* Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center
* Paul Tarau, University of North Texas
* Paulo Oliva, Queen Mary University of London
* Peter Schüller, Marmara University
* Ricardo Rocha, University of Porto
* Stefan Woltran, Vienna University of Technology
* Stefania Costantini, University of L'Aquila
* Wolfgang Faber, University of Huddersfield

Publicity Chair:
* Marco Manna, University of Calabria, Italy

Program Chairs:
* Nicola Leone, University of Calabria, Italy
* Kevin Hamlen, University of Texas at Dallas, TX, USA


Contacts
========
For additional information about papers and submissions, please write to
the official conference email address, or contact the Program
Chairs:

* email: pad...@ea...

* Nicola Leone
  University of Calabria, Italy
  https://www.mat.unical.it/leone/

* Kevin Hamlen
  University of Texas at Dallas, TX, USA
  http://www.utdallas.edu/~hamlen/

[Yap-users] YAP on IRIX anyone ?

[Frederick I. <fre...@ya...>]

Hi,
I know - why wold anyone want to do this but just for fun lets assume that irix is a nice new fancy os :)
I have downloaded YAP6.2.2 and that didn't get anywhere as it just throws a SIGBUS and dies when it tries to execute ./yap -b .pl/init.py during the build process.
So I thought I would backup to 5.1.3 and see if that played nicely.
It does better (except problems compiling two functions in c_interface.c which require REGISTER_BACKUP_REGS else it throws undeclared BK_H ? errors and a problem with fenv.h requiring a __c99 declaration).
Once past this things got a bit better, although it throws a permission_error in a few of the bootstrap).
Then it gives a "YOP OOPs this is probably a yap problem" error.
I do not have the machine at hand right now - but can post an exact error stack later.
I am using gcc 4.7.2 and irix 6.5 (although I am probably the only person with access to this. I have compiled with the -g flag so I can at least debug and get a stack trace from there.
Any thoughts on where I should look of pieces of codeI can check to try to help identify this?
Any assistance much appreciated..
Cheers
Freddy

Re: [Yap-users] No CLP FD Library in Yap-6.3 Source Build

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

Copying *process.pl <http://process.pl>* and *process.so* files from
installed yap-6.2.2 did not work.

I fixed the syntax errors in *pybips.c*, there were not many as I thought
at the beginning. But building *with-python* did not solve my problem
neither.

Gökhan Solak

2017-07-13 17:18 GMT+03:00 Gökhan Solak <so...@it...>:

> I have copied all *.pl, *.yap files and directories under git repo
> *yap-6.3/library* into *usr/local/share/Yap. *After that CLPFD library
> was available via *yap. *However, I noticed that another library I need,
> *process* is not available. It doesn't exist under yap-6.3 repo. Would
> copying the process.pl file from yap-6.2.2 work? Is it replaced with
> another library with similar capabilities?
>
>
> Gökhan Solak
>
> 2017-07-12 22:18 GMT+03:00 Gökhan Solak <so...@it...>:
>
>> Forgot to mention my tools:
>>
>>> gcc (Ubuntu 4.8.5-2ubuntu1~14.04.1) 4.8.5
>>>
>> GNU Make 3.81
>>
>>
>>
>> Gökhan Solak
>>
>> 2017-07-12 22:14 GMT+03:00 Gökhan Solak <so...@it...>:
>>
>>> Hello,
>>>
>>> Short:
>>> I have built Yap-6.3 from the latest source code. I can't locate or use
>>> CLPFD library. It is not under *usr/local/share/Yap*.
>>>
>>> Long:
>>> I have cloned the latest version of Yap-6.3 and built with the following
>>> commands:
>>>
>>> mkdir build
>>>
>>> cd build
>>>
>>> ../configure --enable-coroutining=yes --with-gmp=/usr/lib/x86_64-linux-gnu
>>> --enable-max-performance=yes
>>>
>>> make
>>>
>>> sudo make install
>>>
>>> At first, it gave lots of syntax errors at the *pybips.c* file, so I
>>> removed *Py4Yap* from MakeFile and set WITH_PYTHON option to OFF in
>>> CMakeLists.txt.
>>>
>>> After these changes I was able to build it. However, it shows syntax
>>> errors for CLPFD specific operators in my PL code and I can't locate it in
>>> libraries. Though it's written in autoloader.yap file.
>>>
>>> Do I need to add/remove any flags to the build options to obtain CLPFD?
>>>
>>> Regards,
>>> Gökhan Solak
>>>
>>
>>
>

Re: [Yap-users] No CLP FD Library in Yap-6.3 Source Build

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

I have copied all *.pl, *.yap files and directories under git repo
*yap-6.3/library* into *usr/local/share/Yap. *After that CLPFD library was
available via *yap. *However, I noticed that another library I need,
*process* is not available. It doesn't exist under yap-6.3 repo. Would
copying the process.pl file from yap-6.2.2 work? Is it replaced with
another library with similar capabilities?


Gökhan Solak
Mobil:+905058688653

2017-07-12 22:18 GMT+03:00 Gökhan Solak <so...@it...>:

> Forgot to mention my tools:
>
>> gcc (Ubuntu 4.8.5-2ubuntu1~14.04.1) 4.8.5
>>
> GNU Make 3.81
>
>
>
> Gökhan Solak
>
> 2017-07-12 22:14 GMT+03:00 Gökhan Solak <so...@it...>:
>
>> Hello,
>>
>> Short:
>> I have built Yap-6.3 from the latest source code. I can't locate or use
>> CLPFD library. It is not under *usr/local/share/Yap*.
>>
>> Long:
>> I have cloned the latest version of Yap-6.3 and built with the following
>> commands:
>>
>> mkdir build
>>
>> cd build
>>
>> ../configure --enable-coroutining=yes --with-gmp=/usr/lib/x86_64-linux-gnu
>> --enable-max-performance=yes
>>
>> make
>>
>> sudo make install
>>
>> At first, it gave lots of syntax errors at the *pybips.c* file, so I
>> removed *Py4Yap* from MakeFile and set WITH_PYTHON option to OFF in
>> CMakeLists.txt.
>>
>> After these changes I was able to build it. However, it shows syntax
>> errors for CLPFD specific operators in my PL code and I can't locate it in
>> libraries. Though it's written in autoloader.yap file.
>>
>> Do I need to add/remove any flags to the build options to obtain CLPFD?
>>
>> Regards,
>> Gökhan Solak
>>
>
>

[Yap-users] No CLP FD Library in Yap-6.3 Source Build

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

Hello,

Short:
I have built Yap-6.3 from the latest source code. I can't locate or use
CLPFD library. It is not under *usr/local/share/Yap*.

Long:
I have cloned the latest version of Yap-6.3 and built with the following
commands:

mkdir build

cd build

../configure --enable-coroutining=yes --with-gmp=/usr/lib/x86_64-linux-gnu
--enable-max-performance=yes

make

sudo make install

At first, it gave lots of syntax errors at the *pybips.c* file, so I
removed *Py4Yap* from MakeFile and set WITH_PYTHON option to OFF in
CMakeLists.txt.

After these changes I was able to build it. However, it shows syntax errors
for CLPFD specific operators in my PL code and I can't locate it in
libraries. Though it's written in autoloader.yap file.

Do I need to add/remove any flags to the build options to obtain CLPFD?

Regards,
Gökhan Solak

Re: [Yap-users] No CLP FD Library in Yap-6.3 Source Build

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

Forgot to mention my tools:

> gcc (Ubuntu 4.8.5-2ubuntu1~14.04.1) 4.8.5
>
GNU Make 3.81



Gökhan Solak

2017-07-12 22:14 GMT+03:00 Gökhan Solak <so...@it...>:

> Hello,
>
> Short:
> I have built Yap-6.3 from the latest source code. I can't locate or use
> CLPFD library. It is not under *usr/local/share/Yap*.
>
> Long:
> I have cloned the latest version of Yap-6.3 and built with the following
> commands:
>
> mkdir build
>
> cd build
>
> ../configure --enable-coroutining=yes --with-gmp=/usr/lib/x86_64-linux-gnu
> --enable-max-performance=yes
>
> make
>
> sudo make install
>
> At first, it gave lots of syntax errors at the *pybips.c* file, so I
> removed *Py4Yap* from MakeFile and set WITH_PYTHON option to OFF in
> CMakeLists.txt.
>
> After these changes I was able to build it. However, it shows syntax
> errors for CLPFD specific operators in my PL code and I can't locate it in
> libraries. Though it's written in autoloader.yap file.
>
> Do I need to add/remove any flags to the build options to obtain CLPFD?
>
> Regards,
> Gökhan Solak
>

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

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

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

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

AI*IA Outgoing Mobility Grants 2017

                     Call for research visits

Deadline for applications: June 20th, 2017

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 AI*IA Outgoing Mobility Grants for 2017.

Applications are solicited for funding a research visit abroad of a PhD
student

enrolled at an Italian University.

AI*IA will cover the travel costs and living expenses (up to 2,000 euros)
of successful applicants.

The funding will be provided as a reimburswement 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 long 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 (
http://www.iospress.nl/journal/intelligenza-artificiale/).

Applications can be made by students enrolled full-time in a PhD programme
at an Italian University.

The applicant must be a member of the Association for 2017.

If she/he is not a member for 2017 she/he must register before applying.

Funding is available for 2 students.

The visit should start between the 15th of July 2017 and the 30th of June
2018.

Deadline for applications: June 20th, 2017

Notification of grants: July 4th, 2017

The information required in the application are:

1. name of the Italian PhD student who will go abroad;

2. name of the foreign researcher who 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 applications 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.

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

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

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

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

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

AI*IA Incoming Mobility Grants 2017



                  Call for research visits

Deadline for applications: June 20th, 2017

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 AIxIA Incoming Mobility Grants for 2017.

Applications are solicited for funding a research visit of a PhD student

enrolled at a foreign University to an Italian institution.

AI*IA will cover the travel costs and living expenses (up to 2,000 euros)
of successful applicants.

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 long 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 (
www.iospress.nl/journal/intelligenza-artificiale/).

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 should start between the 15th of July 2017 and the 30th of June
2018.

Deadline for applications: June 20th, 2017

Notification of grants: July 4th, 2017

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 applications 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.

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

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

Re: [Yap-users] Can't read output of a process with pipe

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

My YAP was 64-bit. But compiling with libGMP solved the problem.

Thank you for the help.

Regards,
Gökhan Solak

2017-03-27 12:16 GMT+03:00 Vitor Santos Costa <vs...@gm...>:

> Hi Gokhan
>
> You probably are using a 32  bit version of YAP. Have you tried 64 bit
> or compiling with libGMP?
> Your bug seems to be caused by this.
>
> Best
>
>
> Vitor
>
> On Mon, Mar 27, 2017 at 9:40 AM, Gökhan Solak <so...@it...> wrote:
> > Hello,
> >
> > I want to run a python process from my prolog script (YAP-6.2.2) and read
> > its output formatted as a list of integers, e.g. [1,2,3,4,5,6].
> >
> > This is what I do:
> >
> > :- use_module(library(process)).
> >
> > :-  process_create(path(python3),
> >     ['my_script.py'],
> >     [stdout(pipe(Out))]),
> > read(Out, OutputList),
> > close(Out).
> >
> > However, it fails at read/2 predicate with the error:
> >
> > PL_unify_term: PL_int64 not supported
> > Exception ignored in: <_io.TextIOWrapper name='<stdout>' mode='w'
> > encoding='UTF-8'>
> > BrokenPipeError: [Errno 32] Broken pipe
> >
> > I am sure that I can run the process correctly because with [stdout(std)]
> > parameter given to process_create the program outputs [1,2,3,4,5,6] as
> > expected.
> >
> > Weird thing is that when I change the process to output some
> constant_term
> > it still gives the same PL_int64 error. Appending a dot to the process'
> > output ([1,2,3,4,5,6].) doesn't solve the error. Using read_term/3 gives
> the
> > same error.
> >
> > How can I solve this problem?
> >
> > This question is also asked here.
> >
> > Thanks in advance,
> > Gökhan Solak
> >
> > ------------------------------------------------------------
> ------------------
> > Check out the vibrant tech community on one of the world's most
> > engaging tech sites, Slashdot.org! http://sdm.link/slashdot
> > _______________________________________________
> > Yap-users mailing list
> > Yap...@li...
> > https://lists.sourceforge.net/lists/listinfo/yap-users
> >
>

Re: [Yap-users] Can't read output of a process with pipe

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

Hi Gokhan

You probably are using a 32  bit version of YAP. Have you tried 64 bit
or compiling with libGMP?
Your bug seems to be caused by this.

Best


Vitor

On Mon, Mar 27, 2017 at 9:40 AM, Gökhan Solak <so...@it...> wrote:
> Hello,
>
> I want to run a python process from my prolog script (YAP-6.2.2) and read
> its output formatted as a list of integers, e.g. [1,2,3,4,5,6].
>
> This is what I do:
>
> :- use_module(library(process)).
>
> :-  process_create(path(python3),
>     ['my_script.py'],
>     [stdout(pipe(Out))]),
> read(Out, OutputList),
> close(Out).
>
> However, it fails at read/2 predicate with the error:
>
> PL_unify_term: PL_int64 not supported
> Exception ignored in: <_io.TextIOWrapper name='<stdout>' mode='w'
> encoding='UTF-8'>
> BrokenPipeError: [Errno 32] Broken pipe
>
> I am sure that I can run the process correctly because with [stdout(std)]
> parameter given to process_create the program outputs [1,2,3,4,5,6] as
> expected.
>
> Weird thing is that when I change the process to output some constant_term
> it still gives the same PL_int64 error. Appending a dot to the process'
> output ([1,2,3,4,5,6].) doesn't solve the error. Using read_term/3 gives the
> same error.
>
> How can I solve this problem?
>
> This question is also asked here.
>
> Thanks in advance,
> Gökhan Solak
>
> ------------------------------------------------------------------------------
> Check out the vibrant tech community on one of the world's most
> engaging tech sites, Slashdot.org! http://sdm.link/slashdot
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
>

[Yap-users] Can't read output of a process with pipe

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

Hello,

I want to run a python process from my prolog script (YAP-6.2.2) and read
its output formatted as a list of integers, e.g. [1,2,3,4,5,6].

This is what I do:

:- use_module(library(process)).

:-  process_create(path(python3),
    ['my_script.py'],
    [stdout(pipe(Out))]),
read(Out, OutputList),
close(Out).

However, it fails at read/2 predicate with the error:

PL_unify_term: PL_int64 not supported
Exception ignored in: <_io.TextIOWrapper name='<stdout>' mode='w'
encoding='UTF-8'>
BrokenPipeError: [Errno 32] Broken pipe

I am sure that I can run the process correctly because with [stdout(std)]
parameter given to process_create the program outputs [1,2,3,4,5,6] as
expected.

Weird thing is that when I change the process to output some constant_term
it still gives the same PL_int64 error. Appending a dot to the process'
output ([1,2,3,4,5,6].) doesn't solve the error. Using read_term/3 gives
the same error.

How can I solve this problem?

This question is also asked here
<http://stackoverflow.com/questions/43029488/read-a-list-from-stream-using-yap-prolog>
.

Thanks in advance,
Gökhan Solak

Re: [Yap-users] yap-6.2.2 fails to buld on i686 with GCC 7

[Petr P. <pp...@re...>]

On Mon, Feb 13, 2017 at 02:53:07PM +0100, Petr Pisar wrote:
> Hello, when building yap-6.2.2 with GCC 7, I obtain this build failure on i686
> only:
> 
I tried 6.3.3 and it also fails on i686:

LD_LIBRARY_PATH=/builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/lib:/builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/lib/Yap: YAPSHAREDIR=/builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap YAPLIBDIR=/builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/lib/Yap /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/bin/yap /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/lib/Yap/startup.yss -q -f /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_swi_bootstrap.pl \
	      -g "chr_compile_step2('/builddir/build/BUILD/yap-6.3.3/packages/chr/chr_translate_bootstrap2.chr','chr_translate_bootstrap2.pl'),halt" \
	      -t 'halt(1)'
 % reconsulting /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_translate_bootstrap1.pl...
  % reconsulting /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_runtime.pl...
   % reconsulting /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/dialect/hprolog.yap...
    % reconsulting /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/assoc.yap...
     % reconsulting /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/rbtrees.yap...
     % reconsulted /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/rbtrees.yap in module rbtrees, 10 msec 116424 bytes
    % reconsulted /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/assoc.yap in module assoc, 11 msec 140032 bytes
   % reconsulted /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/dialect/hprolog.yap in module hprolog, 14 msec 168392 bytes
  % including /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_op.pl...
  % /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_op.pl included in module chr_runtime, 0 msec 1152 bytes
% Warning:  (/builddir/build/BUILD/yap-6.3.3/packages/chr/chr_runtime.pl:378).
% Discontiguous definition of chr_runtime:attr_unify_hook/2.
% Warning:  (/builddir/build/BUILD/yap-6.3.3/packages/chr/chr_runtime.pl:769).
% Discontiguous definition of chr_runtime:exception/3.
  % reconsulted /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_runtime.pl in module chr_runtime, 22 msec 252072 bytes
  % reconsulting /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/ordsets.yap...
  % reconsulted /builddir/build/BUILDROOT/yap-6.3.3-1.fc26.i386/usr/share/Yap/ordsets.yap in module ordsets, 2 msec 32888 bytes
  % reconsulting /builddir/build/BUILD/yap-6.3.3/packages/chr/pairlist.pl...
  % reconsulted /builddir/build/BUILD/yap-6.3.3/packages/chr/pairlist.pl in module pairlist, 0 msec 6888 bytes
 % including /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_op2.pl...
 % /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_op2.pl included in module chr_translate_bootstrap1, 0 msec 904 bytes
 % reconsulted /builddir/build/BUILD/yap-6.3.3/packages/chr/chr_translate_bootstrap1.pl in module chr_translate_bootstrap1, 42 msec 674168 bytes
% Translating CHR file chr_translate_bootstrap2.chr
make[1]: *** [Makefile:43: chr_translate_bootstrap2.pl] Segmentation fault (core dumped)

-- Petr

Re: [Yap-users] yap-6.2.2 fails to buld on i686 with GCC 7

[Petr P. <pp...@re...>]

On Mon, Feb 13, 2017 at 03:58:33PM +0100, Petr Pisar wrote:
> Because i686 allows unaliagned access, I think a problem could be the signed
> integer overflow in get_num() at C/scanner.c:567:
> 
Even though this is a bug, it does not seem to be the cause of the access to
illegal address. Building with -fwrapv experiences the same access to illegal
address.

-- Petr

Re: [Yap-users] yap-6.2.2 fails to buld on i686 with GCC 7

[Petr P. <pp...@re...>]

On Mon, Feb 13, 2017 at 02:53:07PM +0100, Petr Pisar wrote:
> Hello, when building yap-6.2.2 with GCC 7, I obtain this build failure on i686
> only:
[...] 
> Do you have any idea what's wrong? I guess GCC 7 brought some new
> optimizations that leads to misbehaving code.
> 
After compiling the code with -fsanitize=undefined compiler option, I can see
these warnings:

C/scanner.c:567:17: runtime error: signed integer overflow: 268435453 * 16 cannot be represented in type 'int'
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x1005c299 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10120631 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10120631 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10120631 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10120631 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10120631 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10120631 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10120631 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10063889 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10063889 for type 'struct FunctorEntry', which requires 4 byte alignment
H/Yatom.h:161:39: runtime error: member access within misaligned address 0x10063889 for type 'struct FunctorEntry', which requires 4 byte alignment
C/absmi.c:12286:4: runtime error: member access within misaligned address 0x101e6e52 for type 'struct yami', which requires 4 byte alignment

Because i686 allows unaliagned access, I think a problem could be the signed integer overflow in get_num() at C/scanner.c:567:

  Int val = 0L;
  [...]

  } else if (ch == 'x' && base == 0) {
    might_be_float = FALSE;
    if (--max_size == 0) {
      Yap_ErrorMessage = "Number Too Long";
      return TermNil;
    }
    *sp++ = ch;
    ch = Nxtch(inp_stream);
    while (my_isxdigit(ch, 'F', 'f')) {
      Int oval = val;
      int chval = (chtype(ch) == NU ? ch - '0' :
                   (my_isupper(ch) ? ch - 'A' : ch - 'a') + 10);
      if (--max_size == 0) {
        Yap_ErrorMessage = "Number Too Long";
        return TermNil;
      }
      *sp++ = ch;
→     val = val * 16 + chval;
      if (oval != (val-chval)/16) /* overflow */
        has_overflow = TRUE;
      ch = Nxtch(inp_stream);
    }
    *chp = ch;
  }

-- Petr

[Yap-users] yap-6.2.2 fails to buld on i686 with GCC 7

[Petr P. <pp...@re...>]

Hello, when building yap-6.2.2 with GCC 7, I obtain this build failure on i686
only:

make[1]: Entering directory '/builddir/build/BUILD/yap-6.2.2/packages/clib'
mkdir -p /builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/lib/Yap
for f in unix.so random.so socket.so cgi.so memfile.so files.so mime.so crypt.so time.so readutil.so streaminfo.so process.so sha4pl.so uri.so; do \
	  /usr/bin/install -c $f /builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/lib/Yap; \
	done
mkdir -p /builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/share/Yap
for f in ./unix.pl ./random.pl ./socket.pl ./cgi.pl ./memfile.pl ./filesex.pl ./mime.pl ./crypt.pl ./time.pl ./streaminfo.pl ./process.pl ./prolog_server.pl ./sha.pl ./socket.pl ./uri.pl; do \
	  /usr/bin/install -c -m 644 $f /builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/share/Yap; \
	done
LD_LIBRARY_PATH=/builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/lib:/builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/lib/Yap: YAPSHAREDIR=/builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/share/Yap YAPLIBDIR=/builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/lib/Yap /builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/bin/yap /builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/lib/Yap/startup.yss -f none -g make -t halt
% Restoring file /builddir/build/BUILDROOT/yap-6.2.2-19.fc26.i386/usr/lib/Yap/startup.yss
YAP 6.2.2 (i686-linux): Sun Feb 12 05:55:49 UTC 2017
MYDDAS version MYDDAS-0.9.1
%
%
% YAP OOOPS: tried to access illegal address 0x2024448b!!!!.
%
%
1295KB of Code Space (0x10000000--0x10143db0)
%
% PC: prolog:$file_is_unchanged/3 at clause 1 
%   Continuation: prolog:$ensure_file_unchanged/3 at clause 1 
%    512KB of Global Stack (0x103ea000--0x1046a25c)
%    0KB of Local Stack (0x10515d00--0x10516000)
%    0KB of Trail (0x10516004--0x10516030)
%    Performed 0 garbage collections
% All Active Calls and
%         Goals With Alternatives Open  (Global In Use--Local In Use)
%
%  prolog:$ensure_file_unchanged/3 at clause 1 
%  prolog:$ensure_file_unchanged/3 at clause 1 
%  prolog:$start_lf/11 at clause 2 
%  prolog:$lf/14 at clause 7 
%  prolog:$load_files/3 at clause 1 
%         idb:$lf_loaded/0 (512KB--0KB)
%  prolog:make/0 at clause 1 
%  prolog:once/1 at clause 1 
%  prolog:$do_yes_no/2 at clause 2 
%  prolog:$yes_no/2 at clause 1 
%         prolog:$catch/3 (512KB--0KB)
%  prolog:$system_catch/4 at clause 1 
%  prolog:$startup_goals/0 at clause 2 
%  prolog:$init_system/0 at clause 1 
%  prolog:$live/0 at clause 1 
%  meta-call
   Exiting ....
make[1]: Leaving directory '/builddir/build/BUILD/yap-6.2.2/packages/clib'
make[1]: *** [Makefile:175: install] Error 1

Do you have any idea what's wrong? I guess GCC 7 brought some new optimizations that leads to misbehaving code.

-- Petr

[Yap-users] online probabilistic logic reasoning with continuous random variables

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

Dear all,

I would like to announce a new version of the web application

http://cplint.lamping.unife.it

for reasoning with probabilistic logic programming.

The new version now includes the possibility of defining continuous random
variables and of conditioning on continuous evidence using likelihood
weighting and particle filtering.

Examples of use include:

·         Gaussian Process regression
<http://cplint.lamping.unife.it/example/inference/gpr.pl>

·         Particle filtering
<http://cplint.lamping.unife.it/example/inference/kalman_filter.pl>

·         Dirichlet Process (stick breaking)
<http://cplint.lamping.unife.it/example/inference/dirichlet_process.pl>

·         Dirichlet Process (Chinese restaurant)
<http://cplint.lamping.unife.it/example/inference/dp_chinese.pl>

·         Dirichlet Process mixture model
<http://cplint.lamping.unife.it/example/inference/dp_mix.pl>

·         Gaussian mixture
<http://cplint.lamping.unife.it/example/inference/gaussian_mixture.pl>

·         Kalman filter
<http://cplint.lamping.unife.it/example/inference/kalman_filter.pl>

·         Bayesian estimation
<http://cplint.lamping.unife.it/example/inference/seven_scientists.pl>

The application offers also facilities for plotting the distribution of
sampled values.

A tutorial is available at

http://cplint.lamping.unife.it/tutorial/tutorial.swinb



Please use the Google group cp...@go... (
https://groups.google.com/forum/#!forum/cplint) to send questions,
suggestions, comments and bug reports.



Best

Fabrizio Riguzzi

http://ds.ing.unife.it/~friguzzi/

Re: [Yap-users] Implement call_with_inference_limit(:Goal, +Limit, -Result)?

[Stefan K. <skr...@gm...>]

Hi Andrew,

a meta-interpreter is a good start.

Which impure features do you use? Control flow stuff like cut and
if-then-else? All-solution predicates like setof/3? Exceptions?

Are you in control of the code that the meta-interpreter runs -- or is it
contributed by some third party?

Best Regards, Stefan.

PS. So... how about moving the discussion to SO?

On Jul 29, 2016 16:46, "Cropper, Andrew" <a.c...@im...> wrote:

> Hi Stefan,
>
> I have replicated this by writing a meta-interpreter which keeps track of
> the number of resolutions, which I will extend to include a resolution
> limit. Although this solution works for my problem, it is not general
> purpose because the meta-interpreter can only handle pure Prolog.
>
> Hope that helps a little,
>
> Andrew
>
>
>
>
>
>
> > On 27 Jul 2016, at 21:08, Cropper, Andrew <a.c...@im...>
> wrote:
> >
> > Hi Stefan,
> >
> > One option would be to replicate the SWI predicate in YAP, but this
> seems a big job. I may be wrong but I think that YAP does not record the
> number of inferences, so it would require a change there.
> >
> > We can move the discussion to StackOverflow.
> >
> > Kind regards,
> >
> > Andrew
> >
> >
> >
> >
> >
> >
> >
> >> On 27 Jul 2016, at 11:54, Stefan Kral <skr...@gm...> wrote:
> >>
> >> Hi Andrew,
> >>
> >> I'm looking for exactly the same feature too!
> >>
> >> Unlike you, I require a portable solution, as my primary Prolog
> processor is SICStus Prolog—not YAP. That being said, let me emphasize that
> I would love to see said feature in YAP, too, of course... what else?!
> Right now, I cannot offer a working solution, but I can offer perspective:
> >>
> >> Let's move this discussion to StackOverflow! It addresses a much larger
> audience and encourages cross-fertilization between different Prolog
> processors (I hope).
> >>
> >> What are your thoughts on this? I'm looking to hearing from you soon!
> >>
> >> All the best,
> >> Stefan.
> >>
> >>
> >> On Jul 27, 2016 11:52, "Cropper, Andrew" <a.c...@im...>
> wrote:
> >> Hi all,
> >>
> >> I would like to enforce a limit on the number of inferences allowed to
> find a solution for a given goal. This idea is akin to the
> call_with_inference_limit(:Goal, +Limit, -Result) predicate in SWIPL.
> >>
> >> I have looked through the YAP documentation and there seems to be no
> obvious way to do this. Has anyone tried to do this before, or know of a
> relatively simple way to implement this?
> >>
> >> Thanks,
> >>
> >> Andrew
> >>
> ------------------------------------------------------------------------------
> >> What NetFlow Analyzer can do for you? Monitors network bandwidth and
> traffic
> >> patterns at an interface-level. Reveals which users, apps, and
> protocols are
> >> consuming the most bandwidth. Provides multi-vendor support for NetFlow,
> >> J-Flow, sFlow and other flows. Make informed decisions using capacity
> planning
> >> reports.http://sdm.link/zohodev2dev
> >> _______________________________________________
> >> Yap-users mailing list
> >> Yap...@li...
> >> https://lists.sourceforge.net/lists/listinfo/yap-users
> >
> >
> ------------------------------------------------------------------------------
> > _______________________________________________
> > Yap-users mailing list
> > Yap...@li...
> > https://lists.sourceforge.net/lists/listinfo/yap-users
>
>

Re: [Yap-users] Implement call_with_inference_limit(:Goal, +Limit, -Result)?

[Cropper, A. <a.c...@im...>]

Hi Stefan,

I have replicated this by writing a meta-interpreter which keeps track of the number of resolutions, which I will extend to include a resolution limit. Although this solution works for my problem, it is not general purpose because the meta-interpreter can only handle pure Prolog.

Hope that helps a little,

Andrew






> On 27 Jul 2016, at 21:08, Cropper, Andrew <a.c...@im...> wrote:
> 
> Hi Stefan,
> 
> One option would be to replicate the SWI predicate in YAP, but this seems a big job. I may be wrong but I think that YAP does not record the number of inferences, so it would require a change there.
> 
> We can move the discussion to StackOverflow.
> 
> Kind regards,
> 
> Andrew
> 
> 
> 
> 
> 
> 
> 
>> On 27 Jul 2016, at 11:54, Stefan Kral <skr...@gm...> wrote:
>> 
>> Hi Andrew,
>> 
>> I'm looking for exactly the same feature too!
>> 
>> Unlike you, I require a portable solution, as my primary Prolog processor is SICStus Prolog—not YAP. That being said, let me emphasize that I would love to see said feature in YAP, too, of course... what else?! Right now, I cannot offer a working solution, but I can offer perspective:
>> 
>> Let's move this discussion to StackOverflow! It addresses a much larger audience and encourages cross-fertilization between different Prolog processors (I hope).
>> 
>> What are your thoughts on this? I'm looking to hearing from you soon!
>> 
>> All the best,
>> Stefan.
>> 
>> 
>> On Jul 27, 2016 11:52, "Cropper, Andrew" <a.c...@im...> wrote:
>> Hi all,
>> 
>> I would like to enforce a limit on the number of inferences allowed to find a solution for a given goal. This idea is akin to the call_with_inference_limit(:Goal, +Limit, -Result) predicate in SWIPL.
>> 
>> I have looked through the YAP documentation and there seems to be no obvious way to do this. Has anyone tried to do this before, or know of a relatively simple way to implement this?
>> 
>> Thanks,
>> 
>> Andrew
>> ------------------------------------------------------------------------------
>> What NetFlow Analyzer can do for you? Monitors network bandwidth and traffic
>> patterns at an interface-level. Reveals which users, apps, and protocols are
>> consuming the most bandwidth. Provides multi-vendor support for NetFlow,
>> J-Flow, sFlow and other flows. Make informed decisions using capacity planning
>> reports.http://sdm.link/zohodev2dev
>> _______________________________________________
>> Yap-users mailing list
>> Yap...@li...
>> https://lists.sourceforge.net/lists/listinfo/yap-users
> 
> ------------------------------------------------------------------------------
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users

Re: [Yap-users] Implement call_with_inference_limit(:Goal, +Limit, -Result)?

[Cropper, A. <a.c...@im...>]

Hi Stefan,

One option would be to replicate the SWI predicate in YAP, but this seems a big job. I may be wrong but I think that YAP does not record the number of inferences, so it would require a change there.

We can move the discussion to StackOverflow.

Kind regards,

Andrew







> On 27 Jul 2016, at 11:54, Stefan Kral <skr...@gm...> wrote:
> 
> Hi Andrew,
> 
> I'm looking for exactly the same feature too!
> 
> Unlike you, I require a portable solution, as my primary Prolog processor is SICStus Prolog—not YAP. That being said, let me emphasize that I would love to see said feature in YAP, too, of course... what else?! Right now, I cannot offer a working solution, but I can offer perspective:
> 
> Let's move this discussion to StackOverflow! It addresses a much larger audience and encourages cross-fertilization between different Prolog processors (I hope).
> 
> What are your thoughts on this? I'm looking to hearing from you soon!
> 
> All the best,
> Stefan.
> 
> 
> On Jul 27, 2016 11:52, "Cropper, Andrew" <a.c...@im...> wrote:
> Hi all,
> 
> I would like to enforce a limit on the number of inferences allowed to find a solution for a given goal. This idea is akin to the call_with_inference_limit(:Goal, +Limit, -Result) predicate in SWIPL.
> 
> I have looked through the YAP documentation and there seems to be no obvious way to do this. Has anyone tried to do this before, or know of a relatively simple way to implement this?
> 
> Thanks,
> 
> Andrew
> ------------------------------------------------------------------------------
> What NetFlow Analyzer can do for you? Monitors network bandwidth and traffic
> patterns at an interface-level. Reveals which users, apps, and protocols are
> consuming the most bandwidth. Provides multi-vendor support for NetFlow,
> J-Flow, sFlow and other flows. Make informed decisions using capacity planning
> reports.http://sdm.link/zohodev2dev
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users

Re: [Yap-users] Implement call_with_inference_limit(:Goal, +Limit, -Result)?

[Stefan K. <skr...@gm...>]

Hi Andrew,

I'm looking for exactly the same feature too!

Unlike you, I require a portable solution, as my primary Prolog processor
is SICStus Prolog—not YAP. That being said, let me emphasize that I would
love to see said feature in YAP, too, of course... what else?! Right now, I
cannot offer a working solution, but I can offer perspective:

Let's move this discussion to StackOverflow! It addresses a much larger
audience and encourages cross-fertilization between different Prolog
processors (I hope).

What are your thoughts on this? I'm looking to hearing from you soon!

All the best,
Stefan.

On Jul 27, 2016 11:52, "Cropper, Andrew" <a.c...@im...> wrote:

> Hi all,
>
> I would like to enforce a limit on the number of inferences allowed to
> find a solution for a given goal. This idea is akin to the
> call_with_inference_limit(:Goal, +Limit, -Result) predicate in SWIPL.
>
> I have looked through the YAP documentation and there seems to be no
> obvious way to do this. Has anyone tried to do this before, or know of a
> relatively simple way to implement this?
>
> Thanks,
>
> Andrew
>
> ------------------------------------------------------------------------------
> What NetFlow Analyzer can do for you? Monitors network bandwidth and
> traffic
> patterns at an interface-level. Reveals which users, apps, and protocols
> are
> consuming the most bandwidth. Provides multi-vendor support for NetFlow,
> J-Flow, sFlow and other flows. Make informed decisions using capacity
> planning
> reports.http://sdm.link/zohodev2dev
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
>

[Yap-users] Implement call_with_inference_limit(:Goal, +Limit, -Result)?

[Cropper, A. <a.c...@im...>]

Hi all, 

I would like to enforce a limit on the number of inferences allowed to find a solution for a given goal. This idea is akin to the call_with_inference_limit(:Goal, +Limit, -Result) predicate in SWIPL. 

I have looked through the YAP documentation and there seems to be no obvious way to do this. Has anyone tried to do this before, or know of a relatively simple way to implement this?

Thanks,

Andrew

[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.

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