yap-users — General Information on Yap

Re: [Yap-users] multiple instances of YAP from c

[Jean-Noël V. <jea...@un...>]

Hi Vitor,
thanks for your answer.

> Yes, the current interface does not support threads. It is just an
> initial effort.
> The best way may be to have a YAPDB class and YAPEngine class, and
> create an YAP thread that inherits from both.
> 
> Jean-Noel, why not just have different processes?
> 

I don’t need threads all the time. Sometimes, I just want to launch a Yap engine to carry out a task and then destroy it and continue using my program. Sometimes, I want to use several instances of Yap at the same time, but I prefer to launch threads directly from my C++ program (apparently, it could be done using YAP_ThreadCreateEngine but I didn’t know at the time I modified Yap). It is also convenient not to worry about synchronization: my instances of Yap are completely independent (they have their own stack, their own heap, their own database).

I’ll look into YAP_ThreadCreateEngine to see if I can simulate the same behavior without actually launching threads.

Jean-Noël

Re: [Yap-users] multiple instances of YAP from c

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

On Mon, Jun 16, 2014 at 1:03 PM, Davide Nitti
<dav...@cs...> wrote:
> thanks for the reply!
>> Have a look at
>>
>> YAP_ThreadCreateEngine, YAP_ThreadAttachEngine,
>> YAP_ThreadDetachEngine, YAP_ThreadDestroyEngine.

I think that is briefly explained in the YAP manual. You can also look
at swi.c and that shows how it is used to implement the next one:

 YAP also supports the
>> thread creation ops in the SWi interface:
>>
>> PL_thread_self()
>> PL_unify_thread_id()
>> PL_thread_attach_engine()
>> PL_thread_destroy_engine()
>> PL_thread_at_exit()
>>

That is explained in the SWI page.

> do you have some documentations or example for those functions?
>> You may want to have a look at the directory CXX in yap-6.3.4.
> any example/doc for this as well?
>

Look into packages/swig/python/demo.py for a simple example of how to
use the interface from python.

A Java/android example is at packages/swig/android but that is being developed.

Last, the yapi.hh file has some documentation in doxygen format.

The yapi interface is work in progress, of course.

Thanks!

Vitor


> thanks!
>
> Davide
>
> Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

Re: [Yap-users] multiple instances of YAP from c

[Davide N. <dav...@cs...>]

thanks for the reply!
> Have a look at
>
> YAP_ThreadCreateEngine, YAP_ThreadAttachEngine,
> YAP_ThreadDetachEngine, YAP_ThreadDestroyEngine. YAP also supports the
> thread creation ops in the SWi interface:
>
> PL_thread_self()
> PL_unify_thread_id()
> PL_thread_attach_engine()
> PL_thread_destroy_engine()
> PL_thread_at_exit()
>
do you have some documentations or example for those functions?
> You may want to have a look at the directory CXX in yap-6.3.4.
any example/doc for this as well?

thanks!

Davide

Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

Re: [Yap-users] multiple instances of YAP from c

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

Hi Jean-Noel

> Davide, I needed exactly what you are looking for so I modified Yap 6.2.2 to put all global variables of Yap into a C++ class, changed functions into methods and modified some code to be correct C++. The result is working well (note that signals are broken since there is now more than one Yap).
>
> It might be an extension of the work done in the directory CXX in yap-6.3.4 in which I noticed that only one instance of YAPEngine can be created. The problem is I don’t see a clean way to keep together the C code and the C++ code together in order to make C++Yap only an extension of CYap.
>

Yes, the current interface does not support threads. It is just an
initial effort.
The best way may be to have a YAPDB class and YAPEngine class, and
create an YAP thread that inherits from both.

Jean-Noel, why not just have different processes?

> Jean-Noël
>
>
>
> Le 15 juin 2014 à 14:19, Vitor Santos Costa <vs...@gm...> a écrit :
>
>> Dear Davide.
>>
>> Sorry for the delay
>>
>>
>>> is it possible to create multiple prolog interpreters in the same C/C++
>>> program?
>>
>> Yes, if you have -DTHREADS (or if you use --enable-threads).
>>
>>> As far as I know, functions such as YAP_FastInit and YAP_RunGoalOnce are
>>> global, so I cannot initialize multiple instances.
>>
>> FastInit will create a single database, thaat will be shared by all
>> threads. But threads can run separate, and RunGoal shsould be
>> thread-local. Have a look at
>>
>> YAP_ThreadCreateEngine, YAP_ThreadAttachEngine,
>> YAP_ThreadDetachEngine, YAP_ThreadDestroyEngine. YAP also supports the
>> thread creation ops in the SWi interface:
>>
>> PL_thread_self()
>> PL_unify_thread_id()
>> PL_thread_attach_engine()
>> PL_thread_destroy_engine()
>> PL_thread_at_exit()
>>
>>
>>> In particular, I'm creating a c++ class that calls yap, so I would like
>>> to create a new instance of yap prolog every time I create a new object
>>> of the class. Thus every object will call and use yap independently in
>>> the same c++ program.
>>
>>
>> You may want to have a look at the directory CXX in yap-6.3.4. It is
>> designed to interface with the swig package, but it is growing
>> quickly. Any feedback, extensions or patches will be much appreciated!
>>
>> Vitor
>>
>>>
>>> thanks!
>>>
>>> regards,
>>> Davide
>>>
>>> Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm
>>>
>>> ------------------------------------------------------------------------------
>>> HPCC Systems Open Source Big Data Platform from LexisNexis Risk Solutions
>>> Find What Matters Most in Your Big Data with HPCC Systems
>>> Open Source. Fast. Scalable. Simple. Ideal for Dirty Data.
>>> Leverages Graph Analysis for Fast Processing & Easy Data Exploration
>>> http://p.sf.net/sfu/hpccsystems
>>> _______________________________________________
>>> Yap-users mailing list
>>> Yap...@li...
>>> https://lists.sourceforge.net/lists/listinfo/yap-users
>>
>> ------------------------------------------------------------------------------
>> HPCC Systems Open Source Big Data Platform from LexisNexis Risk Solutions
>> Find What Matters Most in Your Big Data with HPCC Systems
>> Open Source. Fast. Scalable. Simple. Ideal for Dirty Data.
>> Leverages Graph Analysis for Fast Processing & Easy Data Exploration
>> http://p.sf.net/sfu/hpccsystems
>> _______________________________________________
>> Yap-users mailing list
>> Yap...@li...
>> https://lists.sourceforge.net/lists/listinfo/yap-users
>

Re: [Yap-users] multiple instances of YAP from c

[Jean-Noel V. <jea...@un...>]

Hi Davide, hi Vitor,

Davide, I needed exactly what you are looking for so I modified Yap 6.2.2 to put all global variables of Yap into a C++ class, changed functions into methods and modified some code to be correct C++. The result is working well (note that signals are broken since there is now more than one Yap).

It might be an extension of the work done in the directory CXX in yap-6.3.4 in which I noticed that only one instance of YAPEngine can be created. The problem is I don’t see a clean way to keep together the C code and the C++ code together in order to make C++Yap only an extension of CYap.

Jean-Noël



Le 15 juin 2014 à 14:19, Vitor Santos Costa <vs...@gm...> a écrit :

> Dear Davide.
> 
> Sorry for the delay
> 
> 
>> is it possible to create multiple prolog interpreters in the same C/C++
>> program?
> 
> Yes, if you have -DTHREADS (or if you use --enable-threads).
> 
>> As far as I know, functions such as YAP_FastInit and YAP_RunGoalOnce are
>> global, so I cannot initialize multiple instances.
> 
> FastInit will create a single database, thaat will be shared by all
> threads. But threads can run separate, and RunGoal shsould be
> thread-local. Have a look at
> 
> YAP_ThreadCreateEngine, YAP_ThreadAttachEngine,
> YAP_ThreadDetachEngine, YAP_ThreadDestroyEngine. YAP also supports the
> thread creation ops in the SWi interface:
> 
> PL_thread_self()
> PL_unify_thread_id()
> PL_thread_attach_engine()
> PL_thread_destroy_engine()
> PL_thread_at_exit()
> 
> 
>> In particular, I'm creating a c++ class that calls yap, so I would like
>> to create a new instance of yap prolog every time I create a new object
>> of the class. Thus every object will call and use yap independently in
>> the same c++ program.
> 
> 
> You may want to have a look at the directory CXX in yap-6.3.4. It is
> designed to interface with the swig package, but it is growing
> quickly. Any feedback, extensions or patches will be much appreciated!
> 
> Vitor
> 
>> 
>> thanks!
>> 
>> regards,
>> Davide
>> 
>> Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm
>> 
>> ------------------------------------------------------------------------------
>> HPCC Systems Open Source Big Data Platform from LexisNexis Risk Solutions
>> Find What Matters Most in Your Big Data with HPCC Systems
>> Open Source. Fast. Scalable. Simple. Ideal for Dirty Data.
>> Leverages Graph Analysis for Fast Processing & Easy Data Exploration
>> http://p.sf.net/sfu/hpccsystems
>> _______________________________________________
>> Yap-users mailing list
>> Yap...@li...
>> https://lists.sourceforge.net/lists/listinfo/yap-users
> 
> ------------------------------------------------------------------------------
> HPCC Systems Open Source Big Data Platform from LexisNexis Risk Solutions
> Find What Matters Most in Your Big Data with HPCC Systems
> Open Source. Fast. Scalable. Simple. Ideal for Dirty Data.
> Leverages Graph Analysis for Fast Processing & Easy Data Exploration
> http://p.sf.net/sfu/hpccsystems
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users

Re: [Yap-users] multiple instances of YAP from c

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

Dear Davide.

Sorry for the delay


> is it possible to create multiple prolog interpreters in the same C/C++
> program?

Yes, if you have -DTHREADS (or if you use --enable-threads).

> As far as I know, functions such as YAP_FastInit and YAP_RunGoalOnce are
> global, so I cannot initialize multiple instances.

FastInit will create a single database, thaat will be shared by all
threads. But threads can run separate, and RunGoal shsould be
thread-local. Have a look at

YAP_ThreadCreateEngine, YAP_ThreadAttachEngine,
YAP_ThreadDetachEngine, YAP_ThreadDestroyEngine. YAP also supports the
thread creation ops in the SWi interface:

PL_thread_self()
PL_unify_thread_id()
PL_thread_attach_engine()
PL_thread_destroy_engine()
PL_thread_at_exit()


> In particular, I'm creating a c++ class that calls yap, so I would like
> to create a new instance of yap prolog every time I create a new object
> of the class. Thus every object will call and use yap independently in
> the same c++ program.


You may want to have a look at the directory CXX in yap-6.3.4. It is
designed to interface with the swig package, but it is growing
quickly. Any feedback, extensions or patches will be much appreciated!

Vitor

>
> thanks!
>
> regards,
> Davide
>
> Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm
>
> ------------------------------------------------------------------------------
> HPCC Systems Open Source Big Data Platform from LexisNexis Risk Solutions
> Find What Matters Most in Your Big Data with HPCC Systems
> Open Source. Fast. Scalable. Simple. Ideal for Dirty Data.
> Leverages Graph Analysis for Fast Processing & Easy Data Exploration
> http://p.sf.net/sfu/hpccsystems
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users

[Yap-users] multiple instances of YAP from c

[Davide N. <dav...@cs...>]

Dear,
is it possible to create multiple prolog interpreters in the same C/C++
program?
As far as I know, functions such as YAP_FastInit and YAP_RunGoalOnce are
global, so I cannot initialize multiple instances.
In particular, I'm creating a c++ class that calls yap, so I would like
to create a new instance of yap prolog every time I create a new object
of the class. Thus every object will call and use yap independently in
the same c++ program.

thanks!

regards,
Davide

Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

[Yap-users] WCB '14: Final call for papers.

[Nicos A. <nic...@ya...>]

------------------------------------------------------------
CALL FOR PAPERS
------------------------------------------------------------

WCB 2014

10th Workshop on Constraint-Based Methods for Bioinformatics
http://cp2014.a4cp.org/workshops/bioinfo14

Co-located with 20th International Conference on Principles 
and Practice of Constraint Programming

September 8, Lyon, France

Submisssions deadline: June 30

------------------------------------------------------------

Technical Description
---------------------
During  the last  years, Biology  has become  a source  of challenging
problems for the entire field  of Computer Science in general, and for
the  areas  of  computational  logic  and  constraint  programming  in
particular. Successful approaches to these problems are likely to have
significant  applications  in  several  fields of  research,  such  as
medicine, agriculture, industry,  etc. Several successful applications
of the  Logic and  Constraint Programming paradigms  in Bioinformatics
have been carried  out in the last years, in  the area of phylogenetic
tree  reconstruction, in  haplotype inference,  in  proteins structure
prediction,  in  RNA secondary  structure  prediction,  and in  system
biology, just  to cite  a few. The  workshop aims at  exchanging ideas
between researchers  and collecting, if  possible, new problems  to be
faced in the next future by our community.

Workshop Format
---------------
WCB'14  is  the  10-th  of   a  series  of  consecutive  Workshops  on
Constraint-Based Methods for  Bioinformatics. Previous editions of WCB
were co-located  with various important  international conferences, as
reported below:
- WCB'05: co-located with ICLP-CP 2005 in Sitges
- WCB'06: co-located with CP 2006 in Nantes
- WCB'07: co-located with ICLP 2007 in Porto
- WCB'08: co-located with CPAIOR 2008 in Paris
- WCB'09: co-located with CP 2009 in Lisbon
- WCB'10: co-located with FLOC 2010 in Edinburgh
- WCB'11: co-located with CP 2011 in Perugia
- WCB'12: co-located with ICLP 2012 in Budapest
- WCB'13: co-located with CP 2013 in Uppsala

Details about last-year WCB'13 can be found at http://cp2013.a4cp.org/workshops/wcb

Paper Submission
----------------
The  topic of  interest are  all those  concerning  bioinformatics and
constraints  and related  (SAT/ASP/Logic  Programming/ILP) techniques,
such as:
- RNA prediction and motif search
- protein structure and functional prediction
- genetic linkage analysis and haplotype inference
- pedigree reconstruction and diagnosis
- genomic selection design
- gene regulatory network inference and analysis
- biochemical network simulation and visualization
- solvers for problems in biology
- metabolic pathway analysis
- DNA sequence assembly
- contig scaffolding
- multiple sequence alignment
- machine learning and big data
- ontologies
- constraint databases 
- logical interfaces to relational databases
- web services
- databases integration and federation
- RDF graphs and tools
 
Submitted papers can be:
- Full papers describing new research results
- Extended Abstracts concerning original (unpublished) results.
- Abstracts describing ongoing work.
- System descriptions (with demos at the workshop).
- Summaries of already accepted or recently published papers/results.
- Well-motivated proposals of bioinformatics problems for constraint
  based methods.

Submitted papers should be 3-15 pages long in the LNCS format.

Submissions are managed through EasyChair
https://www.easychair.org/conferences/?conf=wcb14

Important dates
---------------
- Paper Submission Dealine     June 30
- Notification to Authors      July 28
- Final Version                August 18
- Workshop Date                September 8

Invited Speaker
---------------
- Graham Kemp, Chalmers University, Sweden

Workshop Organizers
-------------------
- Nicos Angelopoulos, Imperial College, London, UK
- Simon de Givry, MIAT INRA, Toulouse, France

Program Committee
-----------------
- Pedro Barahona, Universidade Nova de Lisboa, Portugal
- Alexander Bockmayr, Freie Universitat Berlin, Germany
- Mats Carlsson, SICS AB, Uppsala, Sweden
- Agostino Dovier, Universita degli Studi di Udine, Italy 
- Francois Fages, INRIA Paris-Rocquencourt, France
- Arun Konagurthu, Monash University, Australia
- David Lesaint, University of Angers, France
- Ines Lynce, INESC-ID, Lisbon, Portugal
- Nigel Martin, Birkbeck College, UK
- Chris Mungall, Lawrence Berkeley National Laboratory, CA, USA
- Alessandro Dal Palu, Universita degli Studi di Parma, Italy 
- Enrico Pontelli, New Mexico State University, USA
- Sylvain Soliman, INRIA France
- Sebastian Will, University Leipzig, Germany
- Matthias Zytnicki, MIAT INRA, Toulouse, France

[Yap-users] 2014: Call for participation

[Nicos A. <nic...@ya...>]

                    PLP: Probabilistic Logic Programming
                    ------------------------------------

     A workshop of the 2014 International Conference on Logic Programming
                               17 July 2014
                              Vienna, Austria
                          http://stoics.org.uk/plp
           

Deadline for early registration:       8th of June

The programme for the 1st workshop on Probabilistic Logic Programming
is now available at 

                http://stoics.org.uk/plp/programme.html


The programme includes 1 invited talk, 8 contributed papers and an
invited perspectives session to be held in conjunction with CICLOPS/WLPE.

Interested parties are invited to register via the VSL (Vienna Summer of Logic)
website:
                http://vsl2014.at/registration/

[Yap-users] CfP IMBSA2014: 4th International Symposium on Model-Based Safety and Assessment

[Lipaczewski, M. <Mic...@ov...>]

Our apologies if you have received multiple copies.

--------------------------------------------------------------------
CALL FOR PAPERS
 4th International Symposium on Model-Based Safety Assessment

 Munich, Germany, October 27-29, 2014
 Web: http://www.imbsa.org
Mail: in...@im...
--------------------------------------------------------------------

After previous editions in Toulouse (2011), Bordeaux (2012), and Versailles (2013), the 4th International Symposium on Model-Based Safety and Assessment (IMBSA 2014) will be held in Munich, Germany.
This forum aims at bringing together engineers, software specialists and researchers working on all aspects of model-based safety assessment.

The goal of IMBSA is to provide a forum, where brand new ideas from academia, leading edge technology and industrial experiences are brought together. The objectives are to present experiences and tools, to share ideas, and to consolidate the community. We solicit contributions concerning any domain of safety critical application using model-based methods. This includes, but is not limited to:

*             System Dependability Modeling and Assessment
*             Domain Specific Modeling Formalisms (AltaRica, ...)
*             Model-Driven Engineering Methodologies
*             System Architecture and Optimization
*             System Engineering Modeling Tools with Safety Assessment (SysML...)
*             Case Studies and Practical Experiences
*             Traceability of (Safety)-Requirements
*             Specification of Safety Requirements and Patterns
*             Certification and Standardization of and with Model-Based Methods
*             Integration in Interdisciplinary Processes

*------------------------------------------------------------------*
THE IMBSA APPROACH
*------------------------------------------------------------------*
IMBSA is looking back at a rich tradition of successfully combining research with a high number of industrial contributions. It shows that bridging the gap between basic research and industrial practice can be done effectively through interactive presentation of tools and methods. To take this into account, the conference will - in contrast to solely scientific events - be split into three main parts:

  * a scientific part, where newest findings are presented by renown scientists (DAY 1)
  * a tools and tutorials parts, in which consolidated research achievements are interactively demonstrated (DAY 2)
  * and one part reporting on experiences and hot challenges in industrial practice of safety critical systems (DAY 3)

This way, participants from the industry learn about new tools and techniques, while research groups and spin-off companies can present their achievements to an interested audience. Also industrial contributors and young spin-offs can convince future customers of their tools in this mixed environment. We believe, that this mixture of conventional talks about newest achievements, presentation of practical experiences and interactive learning allows for fruitful discussions, exchange of information as well as future cooperation.

*------------------------------------------------------------------*
SUBMISSION DETAILS
*------------------------------------------------------------------*
For each academic and industrial submission, an abstract should be submitted by May 31th, 2014, using the EasyChair website (https://www.easychair.org/conferences/?conf=imbsa2014). Academic papers should not exceed 14 pages. Industrial experiences reports may either be submitted as short papers (8 pages) or full papers (14 pages). Both forms of submission have to comply with the LNCS style format and be handed in by 15th of June. For tutorials and tool demonstration, extended abstracts (2 pages) are sufficient but full length papers may also be accepted. All papers will be subject to a full review.

All accepted papers will be published as an Springer LNCS proceedings. The proceedings are planned as pre-conference proceedings and the printed books should be available at the conference day (final approval pending). To be considered for the proceedings, at least one author of each paper has to participate at the conference. Scientific and industrial experience will be presented at the conference in oral form. Tools and tutorials will be presented in special slots (within the main program) and may be presented in an interactive manner.

*------------------------------------------------------------------*
IMPORTANT DATES
*------------------------------------------------------------------*
Full paper submission deadline: June 15,2014
Notification of acceptance:     July 30,2014
Camera-ready submission:        August 10,2014
Tutorial proposals:             September 10,2014
Conference:                     October 27-29,2014

*------------------------------------------------------------------*
INTERNATIONAL PROGRAM COMMITTEE
*------------------------------------------------------------------*
*             Jean-Paul Blanquart (Astrium Satellites, FR)
*             Marco Bozzano (FBK-irst, IT)
*             Jean-Charles Chaudemar (ISAE, FR)
*             Jana Dittmann (Otto-von-Guericke University of Magdeburg, DE)
*             Marielle Doche-Petit (Systerel, FR)
*             Lars Grunske (University of Stuttgart, DE)
*             Matthias Güdemann (Syterel, FR)
*             Kai Höfig (Siemens, DE)
*             Michaela Huhn (Technical University of Clausthal, DE)
*             Tim Kelly (University of York, GB)
*             Leila Kloul (Universite de Versailles, FR)
*             Agnes Lanusse (CEA LIST, FR)
*             Till Mossakowski (Otto-von-Guericke University of Magdeburg, DE)
*             Jürgen Mottok (University of Regensburg, DE)
*             Frank Ortmeier (Otto-von-Guericke University of Magdeburg, DE)
*             Yiannis Papadopoulos (University of Hull, GB)
*             Antoine Rauzy (Ecole Polytechnique, FR)
*             Wolfgang Reif (Augsburg University, DE)
*             Jean-Marc Roussel (LURPA, ENS Cachan, FR)
*             Christel Seguin (ONERA, FR)
*             Pascal Traverse (AIRBUS, FR)

General Chair:
*             Martin Bott (Zühlke Engineering, DE)
*             Frank Ortmeier (Otto-von-Guericke University of Magdeburg, DE)
PC-Chairs:
*             Frank Ortmeier (Otto-von-Guericke University of Magdeburg, DE)
*             Antoine Rauzy (Ecole Polytechnique, FR)
Tools & Tutorials Chairs:
*             Jürgen Mottok (Hochschule Regensburg, DE)
*             Antoine Rauzy (Ecole Polytechnique, FR)
Industrial Chairs:
*             Martin Bott (Zühlke Engineering, DE)
*             Christel Seguin (ONERA, FR)
Organizing Committee:
*             Tim Gonschorek
*             Michael Lipaczewski
*             Marianne Schulze

*------------------------------------------------------------------*
Web: http://www.imbsa.org
Mail: in...@im...

Re: [Yap-users] Installing YAP mac osx 10.9.2

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

Hi Jeremy

Thanks for trying yap, there is indeed a problem with readline in
MacOS. Baaically, due to licensing matters, the readline distributed
with the MacOS it is not readline but something else, and that
confuses everyone.

If you are using brew, maybe this will work:

configure --with-readline=/usr/local

readline is installed in /usr/local by brew, I think.

If this doesn't work, tell me again.

Thanks for the kind words about yap.

Best

Vitor






On Tue, May 27, 2014 at 12:22 PM, Pitt, Jeremy V <j....@im...> wrote:
> Hello
>
> I'm not sure if this counts as a bug, but...
>
> Please can you give me some assistance with installing yap on mac osx
> 10.9.2?
>
> I am getting the (dreaded?)
> ==
> configure: error: --with-readline was given, but test for readline failed
> ==
>
> I have done brew install readline
> and even
> ==
> brew link --force readline
> Linking /usr/local/Cellar/readline/6.3.5... 18 symlinks created
> ==
>
> But I still get this error...
>
> Any help hugely appreciate, thank you
>
> Best wishes
>
> Jeremy Pitt
> Reader in Intelligent Systems
> Imperial college London
>
> ------------------------------------------------------------------------------
> The best possible search technologies are now affordable for all companies.
> Download your FREE open source Enterprise Search Engine today!
> Our experts will assist you in its installation for $59/mo, no commitment.
> Test it for FREE on our Cloud platform anytime!
> http://pubads.g.doubleclick.net/gampad/clk?id=145328191&iu=/4140/ostg.clktrk
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
>

[Yap-users] ASPOCP 2014: Call for participation

[Marco M. <ma...@di...>]

[Apologize for multiple posting.]


===============================================================================
                               CALL FOR PAPERS
                                 ASPOCP 2014
     7th Workshop on Answer Set Programming and Other Computing
Paradigms
                    https://sites.google.com/site/aspocp2014
                              July 23rd, 2014
 
    Affiliated with the International Conference on Logic Programming
2014
                  (part of the Federated Logic Conference 2014)
                               Vienna, Austria
                              July 19-22, 2014

                Collocated with the Vienna Summer of Logic 2014
                               Vienna, Austria
                              July 12-24, 2014

===============================================================================

AIMS AND SCOPE
 Since its introduction in the late 1980s, answer set programming (ASP)
 has been widely applied to various knowledge-intensive tasks and
 combinatorial search problems. ASP was found to be closely related to
 SAT, which has led to a method of computing answer sets using SAT
 solvers and techniques adapted from SAT. While this has been the most
 studied relationship which is currently extended towards
 satisfiability modulo theories (SMT), the relationship of ASP to other
 computing paradigms, such as constraint satisfaction, quantified
 boolean formulas (QBF), first-order logic (FOL), or FO(ID) logic is
 also the subject of active research. New methods of computing answer
 sets are being developed based on the relation between ASP and other
 paradigms, such as the use of pseudo-Boolean solvers, QBF solvers, FOL
 theorem provers, and CLP systems.
 Furthermore, the practical applications of ASP also foster work on
 multi-paradigm problem-solving, and in particular language and solver
 integration. The most prominent examples in this area currently are the
 integration of ASP with description logics (in the realm of the
 Semantic Web), constraint satisfaction, and general means of external
 computation.  This workshop will  facilitate the discussion about
 crossing the boundaries of current ASP techniques in theory, solving,
 and applications, in combination with or inspired by other computing
 paradigms.


ACCEPTED PAPERS 

 Gerhard Brewka, James Delgrande, Javier Romero and Torsten Schaub. 
  ``Are Preferences Giving You a Headache?'' - ``Take asprin!''

 Michael Gelfond, Patrick Kahl, Richard Watson and Yuanlin Zhang. 
  A Refinement of the Language of Epistemic Specifications

 Evgenii Balai and Patrick Kahl. 
  Epistemic Logic Programs with Sorts

 Stefania Costantini and Andrea Formisano. 
  Query Answering in Resource-Based Answer Set Semantics

 Martin Gebser, Tomi Janhunen and Jussi Rintanen. 
  Declarative Encodings of Acyclicity Properties

 Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger
and Stefan Woltran. 
  Computing Secure Sets in Graphs using Answer Set Programming

 Pedro Cabalar and Martín Diéguez. 
  Temporal Stable Models are LTL-representable

 Mario Alviano, Carmine Dodaro, Joao Marques-Silva and Francesco Ricca. 
  On the Implementation of Weak Constraints in WASP

 Shiqi Zhang, Fangkai Yang, Piyush Khandelwal and Peter Stone. 
  Applying Action Language BC with Hierarchical Domain Abstraction to
Mobile Robots

 Kostyantyn Shchekotykhin. 
  Interactive Query-based Debugging of ASP Programs

 Shahab Tasharrofi and Eugenia Ternovska. 
  Supported Semantics for Modular Systems

 Joseph Babb and Joohyung Lee. 
  Action Language BC+: Preliminary Report

 Amelia Harrison, Vladimir Lifschitz, David Pearce and Agustín
Valverde. 
  Infinitary Equilibrium Logic

 Ilias Tachmazidis, Grigoris Antoniou and Wolfgang Faber. 
  Computing Answer Sets for Monadic Logic Programs via MapReduce


(EARLY) REGISTRATION AND LOCAL ARRANGEMENTS

 Registration is operated by the VSL 2014 organization. Early
registration
 deadline is June 8th.

 For further corresponding information, as well as for travel and
 accommodation details consult:

 http://vsl2014.at/


WORKSHOP CO-CHAIRS
 Daniela Inclezan, Miami University, USA
 Marco Maratea, DIBRIS - University of Genova, Italy

[Yap-users] Installing YAP mac osx 10.9.2

[Pitt, J. V <j....@im...>]

Hello

I'm not sure if this counts as a bug, but...

Please can you give me some assistance with installing yap on mac osx 10.9.2?

I am getting the (dreaded?)
==
configure: error: --with-readline was given, but test for readline failed
==

I have done brew install readline
and even
==
brew link --force readline
Linking /usr/local/Cellar/readline/6.3.5... 18 symlinks created
==

But I still get this error...

Any help hugely appreciate, thank you

Best wishes

Jeremy Pitt
Reader in Intelligent Systems
Imperial college London

[Yap-users] CFP Synasc 2014, Timisoara, Romania

[Isabela D. <idr...@in...>]

[Please post - apologies for multiple copies.] 




Call for Papers 
--------------- 

SYNASC 2014 

16th International Symposium on 
Symbolic and Numeric Algorithms for Scientific Computing 
September 22-25, 2014, Timisoara, Romania 
http://synasc.ro/2014/ 
http://synasc14.info.uvt.ro/ 




Aim 
--- 

SYNASC aims to stimulate the interaction between the two 
scientific communities of symbolic and numeric computing 
and to exhibit interesting applications of the areas both 
in theory and in practice. The choice of the topic is motivated 
by the belief of the organizers that the dialogue between 
the two communities is very necessary for accelerating the 
progress in making the computer a truly intelligent aid for 
mathematicians and engineers. 




Important Dates 
--------------- 

08 June 2014 (EXTENDED) : Abstract submission 
15 June 2014 (EXTENDED) : Paper submission 
27 July 2014 (EXTENDED) : Notification of acceptance 
01 September 2014 : Registration 
05 September 2014 : Revised papers according to the reviews 
22-25 September 2014 : Symposium 
30 November 2014 : Final papers for post-proceedings 


Tracks 
------ 

* Symbolic Computation 
+ computer algebra 
+ symbolic techniques applied to numerics 
+ hybrid symbolic and numeric algorithms 
+ numerics and symbolics for geometry 
+ programming with constraints, narrowing 




* Numerical Computing 
+ iterative approximation of fixed points 
+ solving systems of nonlinear equations 
+ numerical and symbolic algorithms for differential equations 
+ numerical and symbolic algorithms for optimization 
+ parallel algorithms for numerical computing 
+ scientific visualization and image processing 




* Logic and Programming 
+ automatic reasoning 
+ formal system verification 
+ formal verification and synthesis 
+ software quality assessment 
+ static analysis 
+ timing analysis 




* Artificial Intelligence 
+ methods for hard computational problems 
+ intelligent systems for scientific computing 
+ agent-based complex systems modeling and development 
+ scientific knowledge management 
+ computational intelligence 
+ machine learning 
+ recommender and expert systems for scientific computing 
+ data mining and web mining 
+ natural language processing 
+ uncertain reasoning in scientific computing 
+ intelligent hybrid systems 




* Distributed Computing 
+ parallel and distributed algorithms for clouds, GPUs, 
HPC, P2P systems, autonomous systems. Work should focus 
on scheduling, scaling, load balancing, networks, fault-tolerance, 
gossip algorithms, energy saving 
+ applications for parallel and distributed systems, including work 
on cross disciplinary (scientific) applications for grids/clouds, 
web applications, workflow platforms, network measurement tools, 
programming environments 
+ architectures for parallel and distributed systems, including 
self-managing and autonomous systems, negotiation protocols, HPC on 
clouds, GPU processing, PaaS for (inter)cloud, brokering platforms, 
mobile computing 
+ modelling of parallel and distributed systems including models on 
resources and networks, semantic representation, negotiation, social 
networks, trace management, simulators 
+ any other topic deemed relevant to the field 




* Advances in the Theory of Computing 
+ data Structures and algorithms 
+ combinatorial Optimization 
+ formal languages and Combinatorics on Words 
+ graph-theoretic and Combinatorial methods in Computer Science 
+ algorithmic paradigms, including distributed, online, 
approximation, probabilistic, game-theoretic algorithms 
+ computational Complexity Theory, including structural complexity, 
boolean complexity, communication complexity, average-case complexity, 
derandomization and property testing 
+ logical approaches to complexity, including finite model theory 
+ algorithmic and computational learning theory 
+ aspects of computability theory, including computability in 
analysis and algorithmic information theory 
+ proof complexity 
+ computational social choice and game theory 
+ new computational paradigms: CNN computing, quantum, 
holographic and other non-standard approaches to Computability 
+ randomized methods, random graphs, threshold phenomena and 
typical-case complexity 
+ automata theory and other formal models, particularly in 
relation to formal verification methods such as model 
checking and runtime verification 
+ applications of theory, including wireless and sensor networks, 
computational biology and computational economics 
+ experimental algorithmics 


This list is not intended to be exhaustive. 

Workshops 
--------- 

* Workshop on Agents for Complex Systems (ACSys) 
http://synasc.ro/2014/workshops/acsys-2014 
* Workshop on Computational Topology in Image Context (CTIC) 
http://ctic2014.synasc.ro/index.html 
* Workshop on HPC research services (HPCReS) 
http://host.hpc.uvt.ro/events/hpcres-2014-international-workshop-on-hpc-research-services/ 
* Workshop on GIC and Hydrologic Modeling (HydroGIS) 
http://synasc.ro/2014/workshops/hydrogis-2014 
* Workshop on Iterative Approximation of Fixed Points (IAFP) 
http://synasc.ro/2014/workshops/iafp-2014 
* Workshop on Management of Resources and Services in Cloud and Sky Computing (MICAS) 
http://amicas.hpc.uvt.ro/micas-2014 
* Workshop on Natural Computing and Applications (NCA) 
http://synasc.ro/2014/workshops/nca-2014 




Tutorials 
--------- 

* Tutorial on Symbolic Summation in Difference Rings 
http://synasc.ro/2014/tutorials/carsten-schneider 
* Tutorial Multi-Cloud 
http://synasc.ro/2014/tutorials/multi-cloud 




Publication 
----------- 
Research papers that are accepted and presented at the 
symposium will be collected as post-proceedings published 
by Conference Publishing Service (CPS) (included in IEEE Xplore) and 
will be submitted for indexing in ISI Web of Science, DBLP, SCOPUS. 

Extended versions of the selected papers published in post-proceedings 
will be considering to be published as special issues in international journals. 




Invited Speakers 
---------------- 
* Viorica Sofronie-Stokkermans, University Koblenz-Landau, Germany 
* Gheorghe Paun, Institute of Mathematics of the Romanian Academy, Bucharest, Romania 
* William Langdon, University College London, UK 
* Stefan Takacs, TU Chemnitz, Germany 
* Stephen Watt, University of Western Ontario, Canada 
* Tetsuo Ida, University of Tsukuba, Japan 




Honorary Chairs 
--------------- 
* Bruno Buchberger, Johannes Kepler University, Austria 
* Stefan Maruster, West University of Timisoara, Romania 




Steering Committee 

------------------ 
* Tetsuo Ida, University of Tsukuba, Japan 
* Tudor Jebelean, Johannes Kepler University, Austria 
* Viorel Negru, West University of Timisoara, Romania 
* Dana Petcu, West University of Timisoara, Romania 
* Stephen Watt, University of Western Ontario, Canada 
* Daniela Zaharie, West University of Timisoara, Romania 




General Chair 
------------- 
* Viorel Negru, West University of Timisoara, Romania 




Program Chair 
------------- 
* Franz Winkler, Johannes Kepler University, Austria 




Track Chairs 
------------ 
* Symbolic Computation 
+ Tetsuo Ida, University of Tsukuba, Japan 
+ Stephen Watt, University of Western Ontario, Canada 




* Numerical Computing 
+ Richard Liska, Technical University of Prague, Czech Republic 
+ Dana Petcu, West University of Timisoara, Romania 

* Logic and Programming 
+ Tudor Jebelean, Johannes Kepler University Linz, Austria 
+ Laura Kovacs, Chalmers University of Technology, Sweden 




* Artificial Intelligence 
+ Andrei Petrovski, Robert Gordon University, UK 
+ Daniela Zaharie, West University of Timisoara, Romania 

* Distributed Computing 
+ Marc Frincu, University of Southern California, US and West University of Timisoara, Romania 
+ Karoly Bosa, Johannes Kepler University Linz, Austria 

* Advances in the Theory of Computing 
+ Mircea Marin, West University of Timisoara, Romania 
+ Gabriel Istrate, Research Institute e-Austria Timisoara, Romania 

Special sessions and workshops chair 
------------------------------------ 
* Daniel Pop, West University of Timisoara, Romania 




Tutorial chair 
-------------- 
* Dana Petcu, West University of Timisoara, Romania 

Proceedings Chairs 
------------------ 
* Franz Winkler, Johannes Kepler University Linz, Austria 
* Daniela Zaharie, West University of Timisoara, Romania 

Local Committee Chairs 
---------------------- 
* Isabela Dramnesc, West University of Timisoara, Romania 
* Silviu Panica, Institute e-Austria Timisoara, Romania 




Submission 
----------- 

Submissions of research papers are invited. The papers must contain 
original research results not submitted and not published elsewhere. 

The submission process consists of two steps. 

* In the first step the authors are invited to express their 
intention to participate at the conference by submitting a 
short abstract (1/2 page, at maximum) where it is clearly 
stated the main contribution(s) of the paper. 

* In the second step the authors should submit the full paper 
(up to 8 pages in the two-columns IEEE conference style). 


Both the abstract and the full paper should be submitted electronically 
through http://www.easychair.org/conferences/?conf=synasc2014. 


----------- 
SYNASC 2014 
West University of Timisoara 
Department of Computer Science 
Bd. V. Parvan 4, 300223 Timisoara, Romania 
tel: + (40) 256 592195, +(40) 256 592389 
fax: + (40) 256 592316, +(40) 256 592380 
e-mail: syn...@sy... 

[Yap-users] ICLP 2014: Call for Participation

[Tom S. <tom...@ug...>]

CALL FOR PARTICIPATION

    30th International Conference on Logic Programming (ICLP 2014)
 Part of the Federated Logic Conference FLoC 2014

                 Vienna, Austria, July 19-22, 2014

      http://www.logicprogramming.org/iclp2014


                           ACCEPTED PAPERS

The list of accepted regular papers and technical communications is
available on the conference home page.


                            INVITED TALKS

* Andrey Rybalchenko  (Microsoft Research)
  (Quantified) Horn Constraint Solving for Program Verification and
Synthesis

* Neng-Fa Zhou (City University of New York)
  Combinatorial Search With Picat

* Invited author(s) of the most influential paper of ICLP/ILPS 1994.

* Invited author(s) of the most influential paper of ICLP 2004.

* FLoC Panel chaired by Moshe Vardi

* FLoC Plenary Talk by Veronique Cortier

* VSL Keynote Talks by Franz Baader and Edmund Clarke

                      WORKSHOPS, DC, AND SUMMER SCHOOL

* 2014 Summer School on Computational Logic, July 17-18

* International Joint Workshop on Implementation of Constraint and Logic
  Programming Systems and Logic-based Methods in Programming Environments
2014
  (CICLOPS - WLPE), July 17-18

* 21st International Workshop on Experimental Evaluation of Algorithms for
  solving problems with combinatorial explosion (RCRA), July 17-18

* 2nd International Workshop on Verification and Program Transformation
(VPT),
  July 17-18

* Workshop on Horn Clauses for Verification and Synthesis (HCVS), July 17

* Workshop on Probabilistic Logic Programming (PLP), July 17

* 11th International Workshop on Constraint Handling Rules (CHR), July 18

* Workshop on Logic and Search (LaSh), July 18

* Parallel Methods for Search & Optimization (ParSearchOpt), July 18

* 10th ICLP Doctoral Consortium, July 20

* 7th Workshop on Answer Set Programming and Other Computing Paradigms
  (ASPOC), July 23


                    REGISTRATION AND ACCOMMODATION

Information about registration and accommodation is available at the
conference
web site. Early registration ends on June 8, 2014.


                        ICLP 2014 ORGANIZATION

* General Chair: Manuel Carro (Technical University of Madrid).

* Program Chairs: Michael Leuschel (Heinrich-Heine-Universität Düsseldorf),
    Tom Schrijvers (Ghent University)

* Workshop Chair: Haifeng Guo (University of Nebraska at Omaha)

* Doctoral Consortium Chairs: Martin Gebser (University of Potsdam),
    Jael Kriener (Microsoft Research - Inria Joint Center)


                           CONFERENCE VENUE

The Vienna University of Technology (TU Wien) is situated in the very heart
of
Vienna, in the pulsating cultural centre of town, right on the Karlsplatz
metro
station, the largest metro station at which three different subway lines
cross
each other.

The University is within easy walking distance from the Imperial  Palace,
important music venues including the Opera House and the Musikverein,
home of the Vienna Philharmonic Orchestra, from where the New Year's Concert
is annually broadcasted around the globe, from beautiful churches such as
the
splendid baroque Karlskirche (Church of St. Charles) and St. Stephen's
Cathedral,
which is at the very city center, from major museums including the art
nouveau
Secession building, the Albertina Museum, the Museum of Fine Arts, the
Museum
of Natural History, and the newly built Museum's Quarter hosting modern art,
and largest European open market "the Naschmarkt" with variety of
international restaurants.

Vienna International Airport is about 20 km away from the venue. The venue
is
easily accessible from the airport by a range of means of public
transportation,
as well as cabs. Prices range from EUR 3,6 to EUR 34 depending on kind of
transportation.
Travel time to downtown Vienna is between 16 and 30 minutes.
Another airport close by is Bratislava Airport in Slovakia, about 50 km away
from the venue. It takes about 45 minutes to get to downtown Vienna by car
or bus.
Bus tickets currently cost EUR 10 for one way ride, and depart approximately
every 45 minutes.

[Yap-users] LOPSTR 2014: Deadline Approaching

[Maurizio P. <mau...@IA...>]

===================== CALL FOR PAPERS ======================

                24th International Symposium on
       Logic-Based Program Synthesis and Transformation
                         LOPSTR 2014

           http://www.iasi.cnr.it/events/lopstr14/
  University of Kent, Canterbury, UK, September 10-11, 2014


DEADLINES
Abstract submission:                     May 30, 2014
Paper/Extended abstract submission:      June 6, 2014

============================================================
NEW! Invited Speakers:
     Roberto Giacobazzi (University of Verona, Italy)
     Viktor Kuncak (EPFL, Switzerland)
============================================================


The aim of the LOPSTR series is to stimulate and promote international
research and collaboration on logic-based program development. LOPSTR
is open to contributions in logic-based program development in any
language paradigm. LOPSTR has a reputation for being a lively,
friendly forum for presenting and discussing work in progress. Formal
proceedings are produced only after the symposium so that authors can
incorporate this feedback in the published papers.

The 24th International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR 2014) will be held at the University of Kent,
Canterbury, United Kingdom; previous symposia were held in Madrid,
Leuven, Odense, Hagenberg, Coimbra, Valencia, Lyngby, Venice, London,
Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven,
Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester.
LOPSTR 2014 will be co-located with PPDP 2014 (International ACM SIGPLAN
Symposium on Principles and Practice of Declarative Programming).

Topics of interest cover all aspects of logic-based program
development, all stages of the software life cycle, and issues of both
programming-in-the-small and programming-in-the-large. Both full
papers and extended abstracts describing applications in these areas
are especially welcome. Contributions are welcome on all aspects of
logic-based program development, including, but not limited to:

    * synthesis
    * transformation
    * specialization
    * composition
    * optimization
    * inversion
    * specification
    * analysis and verification
    * testing and certification
    * program and model manipulation
    * transformational techniques in SE
    * applications and tools

Survey papers that present some aspects of the above topics from a new
perspective, and application papers that describe experience with
industrial applications are also welcome.

Papers must describe original work, be written and presented in
English, and must not substantially overlap with papers that have been
published or that are simultaneously submitted to a journal,
conference, or workshop with refereed proceedings. Work that already
appeared in unpublished or informally published workshop proceedings
may be submitted (please contact the PC co-chairs in case of questions).


Important Dates

 Abstract submission:                            May 30, 2014
 Paper/Extended abstract submission:             June 6, 2014
 Notification:                                   July 18, 2014
 Camera-ready (for electronic pre-proceedings):  August 25, 2014
 Symposium:                                      September 10-11, 2014


Submission Guidelines

Authors should submit an electronic copy of the paper (written in English)
in PDF, formatted in the Lecture Notes in Computer Science style.
Each submission must include on its first page the paper title; authors
and their affiliations; contact author's email; abstract; and three to
four keywords which will be used to assist the PC in selecting appropriate
reviewers for the paper. Page numbers should appear on the manuscript to
help the reviewers in writing their report. Submissions cannot exceed 15
pages including references but excluding well-marked appendices not intended
for publication. Reviewers are not required to read the appendices, and thus
papers should be intelligible without them.
Paper should be submitted via the Easychair submission website for LOPSTR 2014.
If electronic submission is impossible, please contact the program co-chairs
for information on how to submit hard copies.


Proceedings

The formal post-conference proceedings will be published by Springer in the
Lecture Notes in Computer Science series. Full papers can be directly accepted
for publication in the formal proceedings, or accepted only for presentation at
the symposium and inclusion in informal proceedings. After the symposium, all
authors of extended abstracts and full papers accepted only for presentation
will be invited to revise and/or extend their submissions in the light of the
feedback solicited at the symposium. Then, after another round of reviewing,
these revised papers may also be published in the formal proceedings.


Program Committee

Slim Abdennadher        German University of Cairo, Egypt
Étienne André          Université Paris 13, France
Martin Brain            University of Oxford, UK
Wei-Ngan Chin        National University of Singapore, Singapore
Marco Comini            University of Udine, Italy
Wlodzimierz Drabent     IPIPAN, Poland and Linköping University, Sweden
Fabio Fioravanti        University of Chieti-Pescara, Italy
Jürgen Giesl        RWTH Aachen University, Germany
Miguel Gómez-Zamalloa Complutense University of Madrid, Spain
Arnaud Gotlieb        SIMULA Research Laboratory, Norway
Gopal Gupta             University of Texas at Dallas, USA
Jacob Howe              City University London, UK
Zhenjiang Hu        National Institute of Informatics, Japan
Alexei Lisitsa        University of Liverpool, UK
Yanhong Annie Liu       Stony Brook University, USA
Jorge Navas        NASA, USA
Naoki Nishida        Nagoya University, Japan
Corneliu Popeea         Technische Universität München, Germany
Maurizio Proietti       IASI-CNR, Italy (Program Co-Chair)
Tom Schrijvers        Ghent University, Belgium
Hirohisa Seki        Nagoya Institute of Technology, Japan (Program Co-Chair)
Jon Sneyers        K.U. Leuven, Belgium
Fausto Spoto        University of Verona, Italy
Wim Vanhoof             University of Namur, Belgium
German Vidal            Universitat Politecnica de Valencia, Spain


Program Co-Chairs:

Maurizio Proietti, IASI-CNR, Italy (mau...@ia...)
Hirohisa Seki, Nagoya Institute of Technology, Japan (se...@ni...)


Symposium Co-Chairs

Olaf Chitil and Andy King
School of Computing
University of Kent
CT2 7NF Kent, UK


Organizing Committee

Emanuele De Angelis, University of Chieti-Pescara and IASI-CNR, Italy
Fabrizio Smith, IASI-CNR, Italy

[Yap-users] CFP: WCB'14 Workshop on Constraint-Based Methods for Bioinformatics

[Nicos A. <nic...@st...>]

------------------------------------------------------------
CALL FOR PAPERS
------------------------------------------------------------
    WCB 2014   ---   10th Workshop on Constraint-Based Methods for Bioinformatics
    http://cp2014.a4cp.org/workshops/bioinfo14
    Co-located with 20th International Conference on Principles and Practice of Constraint Programming
    September 8 2014, Lyon, France
------------------------------------------------------------


Technical Description
------------------------------------------------------------
During  the last  years, Biology  has become  a source  of challenging
problems for the entire field  of Computer Science in general, and for
the  areas  of  computational  logic  and  constraint  programming  in
particular. Successful approaches to these problems are likely to have
significant  applications  in  several  fields of  research,  such  as
medicine, agriculture, industry,  etc. Several successful applications
of the  Logic and  Constraint Programming paradigms  in Bioinformatics
have been carried  out in the last years, in  the area of phylogenetic
tree  reconstruction, in  haplotype inference,  in  proteins structure
prediction,  in  RNA secondary  structure  prediction,  and in  system
biology, just  to cite  a few. The  workshop aims at  exchanging ideas
between researchers  and collecting, if  possible, new problems  to be
faced in the next future by our community.

Workshop Format
---------------
WCB'14  is  the  10-th  of   a  series  of  consecutive  Workshops  on
Constraint-Based Methods for  Bioinformatics. Previous editions of WCB
were co-located  with various important  international conferences, as
reported below:
- WCB'05: co-located with ICLP-CP 2005 in Sitges
- WCB'06: co-located with CP 2006 in Nantes
- WCB'07: co-located with ICLP 2007 in Porto
- WCB'08: co-located with CPAIOR 2008 in Paris
- WCB'09: co-located with CP 2009 in Lisbon
- WCB'10: co-located with FLOC 2010 in Edinburgh
- WCB'11: co-located with CP 2011 in Perugia
- WCB'12: co-located with ICLP 2012 in Budapest
- WCB'13: co-located with CP 2013 in Uppsala

Details about last-year WCB'13 can be found at http://cp2013.a4cp.org/workshops/wcb

Paper Submission
----------------
The  topic of  interest are  all those  concerning  bioinformatics and
constraints  and related  (SAT/ASP/Logic  Programming/ILP) techniques,
such as:
- RNA prediction and motif search
- protein structure and functional prediction
- genetic linkage analysis and haplotype inference
- pedigree reconstruction and diagnosis
- genomic selection design
- gene regulatory network inference and analysis
- biochemical network simulation and visualization
- solvers for problems in biology
- metabolic pathway analysis
- DNA sequence assembly
- contig scaffolding
- multiple sequence alignment
- machine learning and big data
- ontologies
- constraint databases 
- logical interfaces to relational databases
- web services
- databases integration and federation
- RDF graphs and tools
 
Submitted papers can be:
- Full papers describing new research results
- Extended Abstracts concerning original (unpublished) results.
- Abstracts describing ongoing work.
- System descriptions (with demos at the workshop).
- Summaries of already accepted or recently published papers/results.
- Well-motivated proposals of bioinformatics problems for constraint
  based methods.

Submitted papers  should be 6-8 page  papers in LNCS  format. For each
contribution we plan to have (at least) 3 reviews.

Submissions are managed through EasyChair
https://www.easychair.org/account/signin.cgi?conf=wcb14

Important dates
---------------
- Paper Submission Dealine     June 30
- Notification to Authors      July 28
- Final Version                August 18
- Workshop Date                September 8

Invited Speaker
---------------
- Graham Kemp, Chalmers University, Sweden

Workshop Organizers
-------------------
- Nicos Angelopoulos, Imperial College, London, UK
- Simon de Givry, MIAT INRA, Toulouse, France

Program Committee
-----------------
- Pedro Barahona, Universidade Nova de Lisboa, Portugal
- Alexander Bockmayr, Freie Universitat Berlin, Germany
- Mats Carlsson, SICS AB, Uppsala, Sweden
- Agostino Dovier, Universita degli Studi di Udine, Italy 
- Francois Fages, INRIA Paris-Rocquencourt, France
- Arun Konagurthu, Monash University, Australia
- David Lesaint, University of Angers, France
- Ines Lynce, INESC-ID, Lisbon, Portugal
- Nigel Martin, Birkbeck College, UK
- Chris Mungall, Lawrence Berkeley National Laboratory, CA, USA
- Alessandro Dal Palu, Universita degli Studi di Parma, Italy 
- Enrico Pontelli, New Mexico State University, USA
- Sylvain Soliman, INRIA France
- Sebastian Will, University Leipzig, Germany
- Matthias Zytnicki, MIAT INRA, Toulouse, France

[Yap-users] LOPSTR 2014: Second Call for Papers

[Maurizio P. <mau...@IA...>]

[Apologies for multiple copies]

================== SECOND CALL FOR PAPERS ==================

                24th International Symposium on
       Logic-Based Program Synthesis and Transformation
                         LOPSTR 2014

           http://www.iasi.cnr.it/events/lopstr14/
  University of Kent, Canterbury, UK, September 10-11, 2014


DEADLINES
Abstract submission:                     May 30, 2014
Paper/Extended abstract submission:      June 6, 2014

============================================================


The aim of the LOPSTR series is to stimulate and promote international
research and collaboration on logic-based program development. LOPSTR
is open to contributions in logic-based program development in any
language paradigm. LOPSTR has a reputation for being a lively,
friendly forum for presenting and discussing work in progress. Formal
proceedings are produced only after the symposium so that authors can
incorporate this feedback in the published papers.

The 24th International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR 2014) will be held at the University of Kent,
Canterbury, United Kingdom; previous symposia were held in Madrid,
Leuven, Odense, Hagenberg, Coimbra, Valencia, Lyngby, Venice, London,
Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven,
Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester.
LOPSTR 2014 will be co-located with PPDP 2014 (International ACM SIGPLAN
Symposium on Principles and Practice of Declarative Programming).

Topics of interest cover all aspects of logic-based program
development, all stages of the software life cycle, and issues of both
programming-in-the-small and programming-in-the-large. Both full
papers and extended abstracts describing applications in these areas
are especially welcome. Contributions are welcome on all aspects of
logic-based program development, including, but not limited to:

    * synthesis
    * transformation
    * specialization
    * composition
    * optimization
    * inversion
    * specification
    * analysis and verification
    * testing and certification
    * program and model manipulation
    * transformational techniques in SE
    * applications and tools

Survey papers that present some aspects of the above topics from a new
perspective, and application papers that describe experience with
industrial applications are also welcome.

Papers must describe original work, be written and presented in
English, and must not substantially overlap with papers that have been
published or that are simultaneously submitted to a journal,
conference, or workshop with refereed proceedings. Work that already
appeared in unpublished or informally published workshop proceedings
may be submitted (please contact the PC co-chairs in case of questions).


Important Dates

 Abstract submission:                            May 30, 2014
 Paper/Extended abstract submission:             June 6, 2014
 Notification:                                   July 18, 2014
 Camera-ready (for electronic pre-proceedings):  August 25, 2014
 Symposium:                                      September 10-11, 2014


Submission Guidelines

Authors should submit an electronic copy of the paper (written in English)
in PDF, formatted in the Lecture Notes in Computer Science style.
Each submission must include on its first page the paper title; authors
and their affiliations; contact author's email; abstract; and three to
four keywords which will be used to assist the PC in selecting appropriate
reviewers for the paper. Page numbers should appear on the manuscript to
help the reviewers in writing their report. Submissions cannot exceed 15
pages including references but excluding well-marked appendices not intended
for publication. Reviewers are not required to read the appendices, and thus
papers should be intelligible without them.
Paper should be submitted via the Easychair submission website for LOPSTR 2014.
If electronic submission is impossible, please contact the program co-chairs
for information on how to submit hard copies.


Proceedings

The formal post-conference proceedings will be published by Springer in the
Lecture Notes in Computer Science series. Full papers can be directly accepted
for publication in the formal proceedings, or accepted only for presentation at
the symposium and inclusion in informal proceedings. After the symposium, all
authors of extended abstracts and full papers accepted only for presentation
will be invited to revise and/or extend their submissions in the light of the
feedback solicited at the symposium. Then, after another round of reviewing,
these revised papers may also be published in the formal proceedings.


Program Committee

Slim Abdennadher        German University of Cairo, Egypt
Étienne André          Université Paris 13, France
Martin Brain            University of Oxford, UK
Wei-Ngan Chin        National University of Singapore, Singapore
Marco Comini            University of Udine, Italy
Wlodzimierz Drabent     IPIPAN, Poland and Linköping University, Sweden
Fabio Fioravanti        University of Chieti-Pescara, Italy
Jürgen Giesl        RWTH Aachen University, Germany
Miguel Gómez-Zamalloa Complutense University of Madrid, Spain
Arnaud Gotlieb        SIMULA Research Laboratory, Norway
Gopal Gupta             University of Texas at Dallas, USA
Jacob Howe              City University London, UK
Zhenjiang Hu        National Institute of Informatics, Japan
Alexei Lisitsa        University of Liverpool, UK
Yanhong Annie Liu       Stony Brook University, USA
Jorge Navas        NASA, USA
Naoki Nishida        Nagoya University, Japan
Corneliu Popeea         Technische Universität München, Germany
Maurizio Proietti       IASI-CNR, Italy (Program Co-Chair)
Tom Schrijvers        Ghent University, Belgium
Hirohisa Seki        Nagoya Institute of Technology, Japan (Program Co-Chair)
Jon Sneyers        K.U. Leuven, Belgium
Fausto Spoto        University of Verona, Italy
Wim Vanhoof             University of Namur, Belgium
German Vidal            Universitat Politecnica de Valencia, Spain


Program Co-Chairs:

Maurizio Proietti, IASI-CNR, Italy (mau...@ia...)
Hirohisa Seki, Nagoya Institute of Technology, Japan (se...@ni...)


Symposium Co-Chairs

Olaf Chitil and Andy King
School of Computing
University of Kent
CT2 7NF Kent, UK


Organizing Committee

Emanuele De Angelis, University of Chieti-Pescara and IASI-CNR, Italy
Fabrizio Smith, IASI-CNR, Italy

============================================================

[Yap-users] Puzzle

[Andrew D. <the...@gm...>]

Hi, This program ('puzzle' which came from one these Prolog groups once) 
loops and grows in memory with yap 6.2.2 on Debian. Works fine gprolog 
and swipl.

[Yap-users] ANN: Logtalk 3.00.0 Beta 1 released

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

Hi,

Logtalk 3.00.0 Beta 1 was released today and its available at:

https://github.com/LogtalkDotOrg/logtalk3

Detailed release notes can be consulted here:

https://github.com/LogtalkDotOrg/logtalk3/blob/master/RELEASE_NOTES.md

Installers and general information on Logtalk are available at:

http://logtalk.org/

Logtalk is an open source object-oriented logic programming language that extends and leverages the Prolog language with a feature set suitable for programming in the large. Logtalk supports modern code encapsulation and code reuse mechanisms without compromising the declarative programming features of Prolog. Logtalk is implemented in highly portable code and can use most modern and standards compliant Prolog implementations as a back-end compiler. The Logtalk distribution features portable libraries and portable assertions, documenting, diagraming, and unit testing tools, plus extensive code editing and publishing support. It also includes extensive documentation and a large number of programming examples.

Despite the "beta" tag, this release is quite stable and it was extensively tested. Feedback is sought and most welcome on all aspects of Logtalk, including features, tools, documentation, portability, and licensing terms. Planned features for upcoming releases include extended portable libraries and a metrics tool. Support for entity (hierarchical) namespaces is also being considered.

Logtalk development and feature set benefit on a regular base from cooperation with academic partners, in particular those working on programming languages and tools research. Commercial contracts further help in funding continuous Logtalk development. Contact us regarding cooperation opportunities. For Logtalk commercial consulting and development services, see:

http://logtalk.pt/

Happy logtalking,

Paulo

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

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

[Yap-users] Call for papers --- Probabilistic logic programming workshop --- PLP 2014

[PLP w. <nic...@st...>]

                    PLP: Probabilistic Logic Programming
                    ------------------------------------

     A workshop of the 2014 International Conference on Logic Programming
                               17 July 2014
                              Vienna, Austria
                          http://stoics.org.uk/plp
           


Invited speaker:                James Cussens, University of York, UK
Deadline for submissions:       10th of May
Special issue:                  International Journal of Approximate Reasoning


Overview
-----
Probabilistic  logic programming (PLP)  approaches have  received much attention
in this  century. They address the need to reason about relational domains under
uncertainty arising in a variety of application domains, such as bioinformatics,
the semantic  web, robotics, and many more.  Developments  in  PLP  include  new
languages  that combine  logic programming  with probability  theory as  well as
algorithms that operate over programs in these formalisms.

PLP  is  part  of  a  wider  current  interest  in  probabilistic   programming.
By  promoting  probabilities  as  explicit  programming  constructs,  inference,
parameter  estimation  and  learning  algorithms  can be ran over programs which
represent highly structured probability spaces.Due to logic programming's strong
theoretical underpinnings, PLP   is  one   of  the  more  disciplined  areas  of
probabilistic  programming. It builds upon and  benefits from  the large body of
existing work in logic  programming, both in  semantics and  implementation, but
also presents new  challenges to  the  field. PLP  reasoning  often requires the
evaluation of large number of possible states before any answers can be produced
thus braking the sequential search model of traditional logic programs.

While  PLP has  already contributed  a number  of  formalisms,  systems and well 
understood  and established  results in: parameter estimation, tabling, marginal
probabilities and Bayesian learning,many questions remain open in this exciting,
expanding field in the intersection of AI, machine learning and statistics.

This  workshop  provides a  forum for  the  exchange of ideas,  presentation of 
results and preliminary work, in the following areas 

   * probabilistic logic programming formalisms

   * parameter estimation

   * statistical inference

   * implementations

   * structure learning

   * reasoning with uncertainty

   * constraint store approaches

   * stochastic and randomised algorithms

   * probabilistic knowledge representation and reasoning

   * constraints in statistical inference

   * applications, such as

   * * bioinformatics

   * * semantic web

   * * robotics

   * probabilistic graphical models

   * Bayesian learning

   * tabling for learning and stochastic inference

   * MCMC

   * stochastic search

   * labelled logic programs

   * integration of statistical software

The above list should be interpreted broadly and is by no means exhaustive.

Purpose
-----
The main aim of the workshop is to provide a  platform for publishing results in
this area with emphasis on the LP aspects of PLP.The collocation  with ICLP will
benefit both the main conference and the workshop. We hope that both (a) more LP
researchers will become interested in inference and learning with PLP and (b)PLP 
researchers will get important feedback on their work from logic programmers.

Submissions
-----
Submissions will be  managed via EasyChair. Contributions should be  prepared in
the LLNCS style. A mixture  of papers are sought including: new results, work in
progress  as  well as technical  summaries of recent  substantial contributions.
Papers presenting  new results should  be 6-12 pages in length. Work in progress
and technical summaries  can be shorter. The workshop  proceedings will  clearly
indicate the type of each paper.

Deadlines
-----
Submission:           May 10
Notification:         May 31
Camera ready:        June 16
Workshop:            July 17
Journal subm.:       Oct.  6

Publication
-----
Proceedings will  be made available electronically to attendees.  They will also
be for stored  permanently in the form  of a booklet  on the  Computing Research
Repository (http://arxiv.org/corr/home/).  The  proceedings  will  constitute of
clearly  marked sections  corresponding to  the different  types of  submissions accepted.
A special issue including extended versions of selected workshop papers
will be published in the International Journal of Approximate Reasoning.

Legacy
-----
We hope that PLP will become an  annual event  and that  in the future  PLP will
alternate its collocation between ICLP and ILP.

Invited speaker 
-----
James Cussens       (University of York, UK)

Programme committee
-----
Nicos Angelopoulos  (Imperial College, UK) [co-chair]
Elena Bellodi       (Universita di Ferrara, Italy)
Hendrik Blockeel    (Leiden University, The Netherlands)
Yoshitaka Kameya    (Meijo University, Japan) 
Angelika Kimmig     (KU Leuven, Belgium)   [co-chair]
Aline Paes          (Rio de Janeiro, Brazil)
Luc De Raedt        (KU Leuven, Belgium)
C. R. Ramakrishnan  (Stony Brook University, USA)
Fabrizio Riguzzi    (Universita di Ferrara, Italy)
Vitor Santos Costa  (Universidade do Porto, Portugal)
Taisuke Sato        (Tokyo Institute of Technology, Japan)
V. S. Subrahmanian  (University of Maryland, USA)
Terrance Swift      (New University of Lisboa, Portugal)
Herbert Wiklicky    (Imperial College, UK)

[Yap-users] ASPOCP 2014: Deadline extended (plus paper registration required)

[Marco M. <ma...@di...>]

[Deadline extended to April 8, plus paper registration requested]

[Apologize for multiple posting.]

===============================================================================
                               CALL FOR PAPERS
                                 ASPOCP 2014
     7th Workshop on Answer Set Programming and Other Computing
Paradigms
                    https://sites.google.com/site/aspocp2014
                              July 23rd, 2014
 
    Affiliated with the International Conference on Logic Programming
2014
                  (part of the Federated Logic Conference 2014)
                               Vienna, Austria
                              July 19-22, 2014

                Collocated with the Vienna Summer of Logic 2014
                               Vienna, Austria
                              July 12-24, 2014

===============================================================================

AIMS AND SCOPE
 Since its introduction in the late 1980s, answer set programming (ASP)
 has been widely applied to various knowledge-intensive tasks and
 combinatorial search problems. ASP was found to be closely related to
 SAT, which has led to a method of computing answer sets using SAT
 solvers and techniques adapted from SAT. While this has been the most
 studied relationship which is currently extended towards
 satisfiability modulo theories (SMT), the relationship of ASP to other
 computing paradigms, such as constraint satisfaction, quantified
 boolean formulas (QBF), first-order logic (FOL), or FO(ID) logic is
 also the subject of active research. New methods of computing answer
 sets are being developed based on the relation between ASP and other
 paradigms, such as the use of pseudo-Boolean solvers, QBF solvers, FOL
 theorem provers, and CLP systems.
 Furthermore, the practical applications of ASP also foster work on
 multi-paradigm problem-solving, and in particular language and solver
 integration. The most prominent examples in this area currently are the
 integration of ASP with description logics (in the realm of the
 Semantic Web), constraint satisfaction, and general means of external
 computation.  This workshop will  facilitate the discussion about
 crossing the boundaries of current ASP techniques in theory, solving,
 and applications, in combination with or inspired by other computing
 paradigms.


TOPICS
 Topics of interests include (but are not limited to):
 - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).
 - ASP and constraint programming.
 - ASP and other logic programming paradigms, e.g., FO(ID).
 - ASP and other nonmonotonic languages, e.g., action languages.
 - ASP and external means of computation.
 - ASP and probabilistic reasoning.
 - ASP and machine learning.
 - New methods of computing answer sets using algorithms or systems of
   other paradigms.
 - Language extensions to ASP.
 - ASP and multi-agent systems.
 - ASP and multi-context systems.
 - Modularity and ASP.
 - ASP and argumentation.
 - Multi-paradigm problem solving involving ASP.
 - Evaluation and comparison of ASP to other paradigms.
 - ASP and related paradigms in applications.
 - Hybridizing ASP with procedural approaches.
 - Enhanced grounding or beyond grounding.


SUBMISSIONS
 Papers must describe original research and should not exceed 15 pages
 in the Springer LNCS format <URL:http://www.springeronline.com/lncs/>.
 Paper submission will be handled electronically by means of the
 Easychair system. The submission page is available at
 https://www.easychair.org/conferences/?conf=aspocp14


IMPORTANT DATES
 Abstract submission deadline:		April 6, 2014 <-- NEW
 Paper submission deadline:             April 8, 2014 <-- EXTENDED
 Notification:               	 	May 1, 2014
 Camera-ready articles due:  	        May 20, 2014
 Workshop:             		        July 23, 2014


LOCATION 
 The workshop will be held in Vienna, Austria, collocated with
 the International Conference on Logic Programming (ICLP) 2014.


PROCEEDINGS
 Accepted papers will be made available online and published in the
 Computing Research Repository (CoRR) afterwards.

 A selection of extended and revised versions of accepted papers will
 appear in a special issue of the Journal of Logic and Computation
 (http://logcom.oxfordjournals.org/), provided that a sufficient
 amount of high quality papers is collected.

 Such papers will go through a second formal selection process to meet
 the high quality standard of the journal.


TIMELINE FOR THE SPECIAL ISSUE (PRELIMINARY)
 Expression of interest/invitation:		   Right after the workshop
 First submissions:				   Fall 2014
 Revision of manuscripts:		
 (for papers not already accepted or rejected)     Spring 2015
 Final notification/version of accepted papers 	   Summer 2015


WORKSHOP CO-CHAIRS
 Daniela Inclezan, Miami University, USA
 Marco Maratea, DIBRIS - University of Genova, Italy


PROGRAM COMMITTEE
 Marcello Balduccini, Drexler University, USA
 Gerhard Brewka, University of Leipzig, Germany 
 Pedro Cabalar, Corunna University, Spain
 Wolfgang Faber, University of Huddersfield, UK
 Cristina Feier, University of Oxford, UK
 Johannes Klaus	Fichte, Vienna University of Technology, Austria
 Michael Fink, Vienna University of Technology, Austria
 Gregory Gelfond, Arizona State University, USA
 Michael Gelfond, Texas Tech University, USA
 Enrico Giunchiglia, University of Genova, Italy
 Giovambattista Ianni, University of Calabria, Italy
 Tomi Janhunen, Aalto University, Finland
 Joohyung Lee, Arizona State University, USA
 Joao Leite, New University of Lisbon, Portugal
 Yuliya Lierler, University of Nebraska at Omaha, USA
 Vladimir Lifschitz, University of Texas at Austin, USA
 Alessandro Mosca, Free University of Bolzano, Italy
 Emilia Oikarinen, Aalto University, Finland
 Max Ostrowski, University of Potsdam, Germany
 Axel Polleres, Vienna University of Economics & Business, Austria
 Francesco Ricca, University of Calabria, Italy
 Guillermo R. Simari, Universidad Nacional del Sur, Argentina
 Evgenia Ternovska, Simon Fraser University, Canada
 Hans Tompits, Vienna University of Technology, Austria
 Miroslaw Truszczynski, University of Kentucky, USA
 Joost Vennekens, Catholic University of Leuven, Belgium
 Marina De Vos, University of Bath, UK
 Stefan Woltran, Vienna University of Technology, Austria
 Fangkai Yang, University of Texas at Austin, USA
 Jia-Huai You, University of Alberta, Canada

[Yap-users] CHR 2014: Extended Deadline

[Remy H. <re...@cl...>]

       CALL FOR PAPERS
      EXTENDED DEADLINE	



     Eleventh International Workshop on Constraint Handling Rules
                                CHR 2014
                http://vsl2014.at/pages/CHR-index.html
                                  Vienna (Austria), July 18th, 2014
                      (co-located with VSL 2014)
                  (affiliated to ICLP 2014 & RTA 2014)


Important dates

   Submission   : *April 14, 2014*
   Notification : *May 12, 2014*
   Camera-ready : *May 23, 2014*
   Workshop     : July 18th, 2014


Aims and Scope

  The CHR 2014 Workshop will be held on July 18th, 2014 in Vienna,
  Austria, at the occasion of the Vienna Summer of Logic 2014 (VSL)
  that will be the largest event in the history of logic. More
  information on the venue and the co-located conferences and
  workshops can be found on the VSL website (http://vsl2014.at/).
     The Constraint Handling Rules (CHR) language has become a major
  declarative specification formalism and implementation language for
  constraint reasoning algorithms and applications. Algorithms
  specified using inference rules, rewrite rules, sequents, proof
  rules, or logical axioms can often be directly written in CHR. Its
  clean semantics facilitates program design, analysis, and
  transformation. For more information, please visit the CHR website
  (http://dtai.cs.kuleuven.be/CHR/).

  The aim of the CHR workshop series is to stimulate and promote
  international research and collaboration on topics related to the
  Constraint Handling Rules language. The workshop is a lively,
  friendly forum for presenting and discussing new results,
  interesting applications, and work in progress. Previous Workshops
  on Constraint Handling Rules were organized in 2004 in Ulm
  (Germany), in 2005 in Sitges (Spain) at ICLP, in 2006 in Venice
  (Italy) at ICALP, in 2007 in Porto (Portugal) at ICLP, in 2008 in
  Hagenberg (Austria) at RTA, in 2009 in Pasadena (California, US) at
  ICLP, in 2010 in Edinburgh (Scotland, UK) at ICLP, in 2011 in Cairo
  (Egypt), at the 2nd CHR summer school, in 2012 in Budapest (Hungary)
  at ICLP. and in 2013 in Berlin (Germany), at the 3rd CHR summer
  school.

  The workshop calls for full papers and short papers describing
  ongoing work on any aspect of CHR and related approaches. The
  following topics are relevant (this list is non-exhaustive):

   - (Logical) Algorithms
   - Applications
   - Comparisons with Related Approaches
   - Constraint Solvers
   - Critical Assessment
   - Expressiveness and Complexity
   - Implementations and Optimization
   - Language Extensions (Types, Modules,...)
   - Program Analysis
   - Program Transformation and Generation
   - Programming Environments (Debugging)
   - Programming Pearls
   - Programming Tools
   - Retractable Constraints
   - Semantics
   - System Descriptions


Submission Information

   The two categories for submissions are:

   - full papers for describing technically sound, innovative ideas
      that can advance the state of the art of CHR

   - short papers, for ongoing work not yet ready for full
     publication and research project overviews.

   All papers must describe original, previously unpublished research,
   and must not simultaneously be submitted for publication
   elsewhere. They must be written in English. Full papers must not
   exceed 14 pages. The limit for short papers is 8 pages.

   All papers must be in the Springer LNCS format. General information
   about the Springer LNCS series and the LNCS authors' instructions
   are available at the Springer LNCS home page.

   Submissions must be made via the EasyChair submission system
   (http://www.easychair.org/conferences/?conf=chr2014)


Programme Committee

   - Slim Abdennadher (German University in Cairo)
   - Henning Christiansen (Roskilde University)
   - Gregory Duck (National University of Singapore)
   - Francois Fages (INRIA Rocquencourt)
   - Thom Fruehwirth (University of Ulm)
   - Remy Haemmerle (Universidad Politecnica de Madrid) - chair
   - Dragan Ivanovic (IMDEA Software Institute)
   - Maria Chiara Meo (Dipartimento di Scienze)
   - Jon Sneyers (K.U.Leuven) - chair
   - Peter J. Stuckey (University of Melbourne)
   - Martin Sulzmann (IT University of Copenhagen)
   - Andrea Triossi (University Ca'Foscari Venice)


Contact

   Contact: ch...@ea...

   Remy Haemmerle
   Universidad Politecnica de Madrid,
   Madrid Spain
   http://clip.dia.fi.upm.es/~remy

   Jon Sneyers
   KU Leuven
   Leuven, Belgium
   http://people.cs.kuleuven.be/~jon.sneyers/

[Yap-users] problog_kbest / problog_koptimal error

[Wiebe V. R. <Wie...@ku...>]

% CP-theory for size 4

1::a0 <-- a1.
0.5::a1 <-- true.
0.5::a0; 0.5::a1 <-- a2.
0.5::a2 <-- true.
0.33333::a0; 0.33333::a1; 0.33333::a2 <-- a3.
0.5::a3 <-- true.

[Yap-users] ASPOCP 2014: Last call for papers

[Marco M. <ma...@di...>]

[Apologize for multiple posting.]

===============================================================================
                               CALL FOR PAPERS
                                 ASPOCP 2014
     7th Workshop on Answer Set Programming and Other Computing
Paradigms
                    https://sites.google.com/site/aspocp2014
                              July 23rd, 2014
 
    Affiliated with the International Conference on Logic Programming
2014
                  (part of the Federated Logic Conference 2014)
                               Vienna, Austria
                              July 19-22, 2014

                Collocated with the Vienna Summer of Logic 2014
                               Vienna, Austria
                              July 12-24, 2014

===============================================================================

AIMS AND SCOPE
 Since its introduction in the late 1980s, answer set programming (ASP)
 has been widely applied to various knowledge-intensive tasks and
 combinatorial search problems. ASP was found to be closely related to
 SAT, which has led to a method of computing answer sets using SAT
 solvers and techniques adapted from SAT. While this has been the most
 studied relationship which is currently extended towards
 satisfiability modulo theories (SMT), the relationship of ASP to other
 computing paradigms, such as constraint satisfaction, quantified
 boolean formulas (QBF), first-order logic (FOL), or FO(ID) logic is
 also the subject of active research. New methods of computing answer
 sets are being developed based on the relation between ASP and other
 paradigms, such as the use of pseudo-Boolean solvers, QBF solvers, FOL
 theorem provers, and CLP systems.
 Furthermore, the practical applications of ASP also foster work on
 multi-paradigm problem-solving, and in particular language and solver
 integration. The most prominent examples in this area currently are the
 integration of ASP with description logics (in the realm of the
 Semantic Web), constraint satisfaction, and general means of external
 computation.  This workshop will  facilitate the discussion about
 crossing the boundaries of current ASP techniques in theory, solving,
 and applications, in combination with or inspired by other computing
 paradigms.


TOPICS
 Topics of interests include (but are not limited to):
 - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).
 - ASP and constraint programming.
 - ASP and other logic programming paradigms, e.g., FO(ID).
 - ASP and other nonmonotonic languages, e.g., action languages.
 - ASP and external means of computation.
 - ASP and probabilistic reasoning.
 - ASP and machine learning.
 - New methods of computing answer sets using algorithms or systems of
   other paradigms.
 - Language extensions to ASP.
 - ASP and multi-agent systems.
 - ASP and multi-context systems.
 - Modularity and ASP.
 - ASP and argumentation.
 - Multi-paradigm problem solving involving ASP.
 - Evaluation and comparison of ASP to other paradigms.
 - ASP and related paradigms in applications.
 - Hybridizing ASP with procedural approaches.
 - Enhanced grounding or beyond grounding.


SUBMISSIONS
 Papers must describe original research and should not exceed 15 pages
 in the Springer LNCS format <URL:http://www.springeronline.com/lncs/>.
 Paper submission will be handled electronically by means of the
 Easychair system. The submission page is available at
 https://www.easychair.org/conferences/?conf=aspocp14


IMPORTANT DATES
 Abstract and paper submission deadline:         April 1, 2014
 Notification:               	 		 May 1, 2014
 Camera-ready articles due:  	       		 May 20, 2014
 Workshop:             		       		 July 23, 2014


LOCATION 
 The workshop will be held in Vienna, Austria, collocated with
 the International Conference on Logic Programming (ICLP) 2014.


PROCEEDINGS
 Accepted papers will be made available online and published in the
 Computing Research Repository (CoRR) afterwards.

 A selection of extended and revised versions of accepted papers will
 appear in a special issue of the Journal of Logic and Computation
 (http://logcom.oxfordjournals.org/), provided that a sufficient
 amount of high quality papers is collected.

 Such papers will go through a second formal selection process to meet
 the high quality standard of the journal.


TIMELINE FOR THE SPECIAL ISSUE (PRELIMINARY)
 Expression of interest/invitation:		   Right after the workshop
 First submissions:				   Fall 2014
 Revision of manuscripts:		
 (for papers not already accepted or rejected)     Spring 2015
 Final notification/version of accepted papers 	   Summer 2015


WORKSHOP CO-CHAIRS
 Daniela Inclezan, Miami University, USA
 Marco Maratea, DIBRIS - University of Genova, Italy


PROGRAM COMMITTEE
 Marcello Balduccini, Drexler University, USA
 Gerhard Brewka, University of Leipzig, Germany 
 Pedro Cabalar, Corunna University, Spain
 Wolfgang Faber, University of Huddersfield, UK
 Cristina Feier, University of Oxford, UK
 Johannes Klaus	Fichte, Vienna University of Technology, Austria
 Michael Fink, Vienna University of Technology, Austria
 Gregory Gelfond, Arizona State University, USA
 Michael Gelfond, Texas Tech University, USA
 Enrico Giunchiglia, University of Genova, Italy
 Giovambattista Ianni, University of Calabria, Italy
 Tomi Janhunen, Aalto University, Finland
 Joohyung Lee, Arizona State University, USA
 Joao Leite, New University of Lisbon, Portugal
 Yuliya Lierler, University of Nebraska at Omaha, USA
 Vladimir Lifschitz, University of Texas at Austin, USA
 Alessandro Mosca, Free University of Bolzano, Italy
 Emilia Oikarinen, Aalto University, Finland
 Max Ostrowski, University of Potsdam, Germany
 Axel Polleres, Vienna University of Economics & Business, Austria
 Francesco Ricca, University of Calabria, Italy
 Guillermo R. Simari, Universidad Nacional del Sur, Argentina
 Evgenia Ternovska, Simon Fraser University, Canada
 Hans Tompits, Vienna University of Technology, Austria
 Miroslaw Truszczynski, University of Kentucky, USA
 Joost Vennekens, Catholic University of Leuven, Belgium
 Marina De Vos, University of Bath, UK
 Stefan Woltran, Vienna University of Technology, Austria
 Fangkai Yang, University of Texas at Austin, USA
 Jia-Huai You, University of Alberta, Canada