Menu
▾
▴
yap-users — General Information on Yap
You can subscribe to this list here.
| 2001 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(1) |
Nov
(3) |
Dec
(3) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2002 |
Jan
(8) |
Feb
(3) |
Mar
(9) |
Apr
(6) |
May
(13) |
Jun
(33) |
Jul
(11) |
Aug
(17) |
Sep
(31) |
Oct
(64) |
Nov
(19) |
Dec
(28) |
| 2003 |
Jan
(5) |
Feb
(4) |
Mar
(11) |
Apr
(11) |
May
(4) |
Jun
(15) |
Jul
(4) |
Aug
(16) |
Sep
(14) |
Oct
(1) |
Nov
(3) |
Dec
(1) |
| 2004 |
Jan
(8) |
Feb
(24) |
Mar
(16) |
Apr
(23) |
May
(11) |
Jun
(16) |
Jul
(15) |
Aug
(1) |
Sep
(9) |
Oct
(2) |
Nov
(20) |
Dec
(37) |
| 2005 |
Jan
(10) |
Feb
(1) |
Mar
|
Apr
(9) |
May
(8) |
Jun
(1) |
Jul
(6) |
Aug
(14) |
Sep
(3) |
Oct
(35) |
Nov
(10) |
Dec
(3) |
| 2006 |
Jan
(10) |
Feb
(11) |
Mar
(8) |
Apr
(6) |
May
(2) |
Jun
(2) |
Jul
(5) |
Aug
(6) |
Sep
(6) |
Oct
(10) |
Nov
(6) |
Dec
(2) |
| 2007 |
Jan
(26) |
Feb
(17) |
Mar
|
Apr
(6) |
May
(3) |
Jun
(4) |
Jul
(5) |
Aug
|
Sep
(8) |
Oct
(3) |
Nov
(16) |
Dec
(20) |
| 2008 |
Jan
(32) |
Feb
(4) |
Mar
(14) |
Apr
(7) |
May
(13) |
Jun
(13) |
Jul
(21) |
Aug
(8) |
Sep
(6) |
Oct
(7) |
Nov
(4) |
Dec
(7) |
| 2009 |
Jan
(49) |
Feb
(11) |
Mar
(12) |
Apr
(20) |
May
(7) |
Jun
(11) |
Jul
(12) |
Aug
(3) |
Sep
(5) |
Oct
(12) |
Nov
(36) |
Dec
(14) |
| 2010 |
Jan
(35) |
Feb
(27) |
Mar
(84) |
Apr
(32) |
May
(42) |
Jun
(25) |
Jul
(50) |
Aug
(30) |
Sep
(8) |
Oct
(30) |
Nov
(69) |
Dec
(140) |
| 2011 |
Jan
(16) |
Feb
(26) |
Mar
(33) |
Apr
(23) |
May
(6) |
Jun
(20) |
Jul
(45) |
Aug
(14) |
Sep
(4) |
Oct
(8) |
Nov
(5) |
Dec
(9) |
| 2012 |
Jan
(2) |
Feb
(5) |
Mar
(14) |
Apr
(11) |
May
(7) |
Jun
(37) |
Jul
(11) |
Aug
(9) |
Sep
(7) |
Oct
(6) |
Nov
(4) |
Dec
(6) |
| 2013 |
Jan
(52) |
Feb
(28) |
Mar
(21) |
Apr
(17) |
May
(7) |
Jun
(12) |
Jul
(5) |
Aug
(10) |
Sep
(29) |
Oct
(3) |
Nov
(30) |
Dec
(1) |
| 2014 |
Jan
(6) |
Feb
(3) |
Mar
(9) |
Apr
(6) |
May
(8) |
Jun
(11) |
Jul
(2) |
Aug
(1) |
Sep
(6) |
Oct
(2) |
Nov
|
Dec
(5) |
| 2015 |
Jan
(3) |
Feb
(9) |
Mar
(6) |
Apr
(4) |
May
(5) |
Jun
(1) |
Jul
(1) |
Aug
(1) |
Sep
|
Oct
(1) |
Nov
(3) |
Dec
(3) |
| 2016 |
Jan
|
Feb
(40) |
Mar
(6) |
Apr
|
May
(2) |
Jun
(2) |
Jul
(5) |
Aug
|
Sep
|
Oct
(1) |
Nov
|
Dec
|
| 2017 |
Jan
|
Feb
(4) |
Mar
(3) |
Apr
|
May
(2) |
Jun
|
Jul
(5) |
Aug
(1) |
Sep
(2) |
Oct
|
Nov
|
Dec
|
| 2018 |
Jan
|
Feb
(1) |
Mar
(1) |
Apr
(1) |
May
(2) |
Jun
(1) |
Jul
(2) |
Aug
(1) |
Sep
(2) |
Oct
|
Nov
|
Dec
|
| 2019 |
Jan
|
Feb
|
Mar
(1) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(1) |
Nov
(1) |
Dec
(1) |
| 2020 |
Jan
(1) |
Feb
|
Mar
|
Apr
(4) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(2) |
Nov
(2) |
Dec
(1) |
| 2021 |
Jan
|
Feb
(1) |
Mar
|
Apr
|
May
|
Jun
|
Jul
(1) |
Aug
|
Sep
(1) |
Oct
(2) |
Nov
|
Dec
(1) |
| 2022 |
Jan
(1) |
Feb
|
Mar
(1) |
Apr
(1) |
May
|
Jun
(1) |
Jul
(1) |
Aug
|
Sep
(1) |
Oct
(1) |
Nov
(1) |
Dec
(1) |
| 2023 |
Jan
|
Feb
|
Mar
|
Apr
(1) |
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
(1) |
| 2024 |
Jan
|
Feb
(1) |
Mar
(3) |
Apr
(1) |
May
(5) |
Jun
(4) |
Jul
(4) |
Aug
(2) |
Sep
(2) |
Oct
(1) |
Nov
(1) |
Dec
(1) |
| 2025 |
Jan
(1) |
Feb
(1) |
Mar
(1) |
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
|
From: Marco M. <ma...@di...> - 2015-02-04 14:14:16
|
[apologies for any cross-posting]
========================================================================
6th Answer Set Programming Competition 2015
(ASPCOMP 2015)
Call for Benchmark Problems
Aalto University and University of Calabria and University of Genoa
========================================================================
The 6th Answer Set Programming Competition (ASPCOMP 2015) is the main
event where ASP systems are evaluated.
The event is currently facing the benchmarks selection process.
== Call for Benchmark Problems ==
Participants will compete on a selected collection of declarative
specifications of benchmark problems, taken from a variety of domains as
well as real world applications, and instances thereof.
These include, but are not limited to:
- Deductive database tasks on large data-sets
- Sequential and Temporal Planning
- Classic and Applicative graph problems
- Puzzles and Combinatorics
- Scheduling, Timetabling, and other resource allocation problems
- Combinatorial Optimization Problems
- Ontology reasoning
- Automated Theorem Proving and Model Checking
- Constraint Programming problems
- Other AI problems
We encourage to provide help by devising new challenging benchmark
problems.
Based on observations from past events, we particularly encourage the
submission of problems:
* arising from applications of practical impact, and/or
* being ASP focused, i.e. whose encodings are non-tight.
Benchmark authors are expected to produce:
* a short problem description in natural language,
* a problem encoding in the ASPCore-2 language (cf.
https://www.mat.unical.it/aspcomp2013/ASPStandardization),
* an instance set (composed of a significant number of instances, e.g.
50)
and/or an instance generator,
* a solution checker (cf.
https://www.mat.unical.it/aspcomp2013/ProblemIOSpecification#checker).
About the instances, an indication about which instances, either
provided in an instance set, or generated with some given parameters
of the generator, is expected to be "hard", or "easy", is welcome.
Please submit benchmark problems by email: asp...@di....
All submitted benchmark problems will become part of the ASP suite
of benchmarks made available to the community, and a selection
will enter the 6th Answer Set Programming Competition. Organizers
reserve the right of this choice.
=== About the ASP Competition Series ===
Answer Set Programming is a well-established paradigm of declarative
programming with close relationship to other declarative modeling
paradigms and languages, such as SAT Modulo Theories, Constraint
Handling Rules, FO(.), PDDL, CASC, and many others.
Since the first informal editions (Dagstuhl 2002 and 2005), ASP
systems compare themselves in the nowadays customary ASP Competition:
the 6th ASP Competition will be run jointly among the Aalto University
(Finland), the University of Calabria (Italy) and the University of
Genoa (Italy), in Spring/Summer 2015. The event is the sequel to the
ASP Competition series, held at the University of Potsdam (Germany) in
2006-2007, at the University of Leuven (Belgium) in 2009, and at
University of Calabria (Italy) in 2011, jointly between the University
of Calabria (Italy) and the Vienna University of Technology (Austria)
in 2013, and by the same organization of this year in 2014. The
current competition takes place in cooperation with the 13th
International Conference on Logic Programming and Nonmonotonic
Reasoning (LPNMR 2015)
http://lpnmr2015.mat.unical.it/,
where the results will be announced.
== Important Dates ==
* Problem submission deadline: March 15th, 2015
== Further Information ==
For further information contact us by email:
asp...@di....
|
|
From: Luca P. <lp...@un...> - 2015-02-03 10:29:55
|
[apologies for any cross-posting] ****************************************************************** CALL FOR PAPERS The 9th International Conference on Web Reasoning and Rule Systems (RR 2015) Berlin, Germany, August 4-6, 2015 http://www.csw.inf.fu-berlin.de/RR2015/ ****************************************************************** The International Conference on Web Reasoning and Rule Systems (RR) is a major forum for discussion and dissemination of new results concerning Web Reasoning and Rule Systems. RR 2015 is colocated with the following events: - 11th Reasoning Web Summer School (RW 2015) Berlin, Germany, July 31 - August 4, 2015. http://www.csw.inf.fu-berlin.de/rw2015/ - The 25th International Conference on Automated Deduction (CADE 2015). Berlin, Germany, August 1 - August 7, 2015. http://conference.mi.fu-berlin.de/cade-25/home - The 9th International Web Rule Symposium (RuleML 2015). Berlin, Germany, August 3-5, 2015 http://2015.ruleml.org RR 2015 also hosts a doctoral consortium, which will provide PhD students with an opportunity to present and discuss their research directions, to be involved in discussions on the state-of-the-art research, and to establish fruitful collaborations. In particular, the doctoral consortium will include a mentoring lunch and a poster session, organized jointly with the 9th International Web Rule Symposium (RuleML 2015). Further details on the RR doctoral consortium will be communicated by means of a separate Call for Papers, as well as on the RR 2015 website. == TOPICS AND SUBMISSION INSTRUCTIONS == The scale and the heterogenous nature of web data poses many challenges, and turns basic tasks such as query answering and data transformations into complex reasoning problems. Rule-based systems have found many applications in this area. The RR conference welcomes original research from all areas of Web Reasoning and Rule Systems. Topics of particular interest are: - Rule-based languages for intelligent information access and for the semantic web - Ontology-based data access - Data management, and data interoperability for web data - Distributed agent-based systems for the web - Scalability and expressive power of logics for the semantic web - Reasoning with incomplete, inconsistenct and uncertain data - Non-monotonic, commonsense, and closed-world reasoning for web data - Constraint programming, inductive logic programming for web data - Streaming data and complex event processing - Rule-based approaches to machine learning, knowledge extraction and information retrieval - Rule-based approaches to natural language processing - System descriptions, applications and experiences There are two submission formats: - Full papers (up to 15 pages in LNCS style) - Technical Communications (up to 6 pages in LNCS style) Submitted full papers should present original and significant research results. They must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference/workshop with formal proceedings. Double submission to a workshop with informal proceedings is allowed, like for instance the DL 2014 workshop. Technical communications are intended for promising but possibly preliminary work, position papers, system descriptions, and applications descriptions (which may be accompanied by a demo). The conference proceedings will be published by Springer in the Lecture Notes in Computer Science series (LNCS), and all submissions must be prepared in Springer's LaTeX style llncs (http://www.springer.com/comp/lncs/Authors.html). Submissions are made via EasyChair: https://www.easychair.org/conferences/?conf=rr2015 == IMPORTANT DATES == - Title and Abstract submission: March 3, 2015 - Full papers submission: March 10, 2015 - Notification of acceptance: April 15, 2015 - Camera-ready submission: May 15, 2015 For each of these deadlines, a cut-off point of 23:59 AOE (anywhere on earth) applies. == BEST PAPER AND BEST STUDENT PAPER AWARDS == Awards for Best Paper and Best Student Paper will be presented to the corresponding author(s) at the conference. The best student paper will be selected among the ones mainly only by students (i.e., authors a PhD as of the paper submission deadline). To qualify for the Best Student Paper award, the authors must indicate their eligibility upon submission at easychair. The program committee reserves the right to not give out a Best Student Paper award, or to split the award among multiple submissions. == INVITED SPEAKERS == - Michael Genesereth (Stanford University) - Benny Kimelfeld (Technion & LogicBlox) - Lora Aroyo (Free University of Amsterdam) == ORGANIZATION == General Chair: - Wolfgang Faber (University of Huddersfield) Doctoral Consortium Chair: - Marco Montali (Free Universiy of Bozen-Bolzano) Local Organization Chair: - Adrian Paschke (Free University of Berlin) Sponsorship Chair: - Marco Maratea (University of Genova) Publicity Chair: - Luca Pulina (University of Sassari) Web Chair: - Ralph Schaefermeier (Free University of Berlin) Program Committee: - Balder ten Cate (LogicBlox, USA) - co-chair - Alessandra Mileo (DERI, Ireland) - co-chair - Darko Anicic (Siemens AG, Germany) - Marcelo Arenas (Pontificia Universidad Catolica de Chile, Chile) - Marcello Balduccini (Drexel University, USA) - Leopoldo Bertossi (Carleton University, Canada) - Meghyn Bienvenu (Universite Paris Sud, France) - Fernando Bobillo (University of Zaragoza, Spain) - Daniel Deutsch (Tel Aviv, Israel) - Agostino Dovier (Università degli Studi di Udine, Italy) - Thomas Eiter (TU Vienna, Austria) - Sergio Flesca (University of Calabria, Italy) - Paul Fodor (Stony Brook University, USA) - Andres Freitas (INSIGHT NUI Galway, Ireland) - Andre Hernich (Liverpool, UK) - Stijn Heymans (SRI, USA) - Aidan Hogan (National University of Ireland, Galway, Ireland) - Benny Kimelfeld (Technion, Israel & LogicBlox, Inc) - Roman Kontchakov (Birkbeck College, UK) - Markus Krötzsch (University of Oxford, UK) - Georg Lausen (Universitaet Freiburg, Germany) - Joohyung Lee (Arizona State University, USA) - Domenico Lembo (Sapienza Universita di Roma, Italy) - Carsten Lutz (Universität Bremen, Germany) - Thomas Meyer (CSIR Meraka Institute, South Africa) - Boris Motik (Oxford University, UK) - Marco Montali (Free University of Bozen-Bolzano, Italy) - Marie-Laure Mugnier (LIRMM/INRIA, Montpellier, France) - Matthias Nickels (NUI Galway, Ireland) - Magdalena Ortiz (TU Vienna, Austria) - Giorgio Orsi (University of Oxford, UK) - Jeff Z. Pan (University of Aberdeen) - Adrian Paschke (Freie Universität Berlin, Germany) - Axel Polleres (WU-Vienna, Austria) - Lucian Popa (IBM Almaden, USA) - Francesco Ricca (University of Calabria, Italy) - Riccardo Rosati (Sapienza Universita di Roma, Italy) - Sebastian Rudolph (TU Dresden, Germany) - Luciano Serafini (FBK Trento, Italy) - Evgeny Sherkhonov (University of Amsterdam, Netherlands) - Steffen Staab (University of Koblenz-Landau, Germany) - Umberto Straccia (ISTI-CNR, Pisa, Italy) -- Luca Pulina, Ph.D. Assistant Professor of Computer Science POLCOMING - Department of Political Science, Communication, Engineering and Information Technologies University of Sassari e-mail lp...@un... http://sites.google.com/site/lpulina -- Luca Pulina, Ph.D. Assistant Professor of Computer Science POLCOMING - Department of Political Science, Communication, Engineering and Information Technologies University of Sassari e-mail lp...@un... http://sites.google.com/site/lpulina |
|
From: Luca P. <lp...@un...> - 2015-02-03 09:51:16
|
[apologies for any cross-posting] ****************************************************************** CALL FOR PAPERS The 9th International Conference on Web Reasoning and Rule Systems (RR 2015) Berlin, Germany, August 4-6, 2015 http://www.csw.inf.fu-berlin.de/RR2015/ ****************************************************************** The International Conference on Web Reasoning and Rule Systems (RR) is a major forum for discussion and dissemination of new results concerning Web Reasoning and Rule Systems. RR 2015 is colocated with the following events: - 11th Reasoning Web Summer School (RW 2015) Berlin, Germany, July 31 - August 4, 2015. http://www.csw.inf.fu-berlin.de/rw2015/ - The 25th International Conference on Automated Deduction (CADE 2015). Berlin, Germany, August 1 - August 7, 2015. http://conference.mi.fu-berlin.de/cade-25/home - The 9th International Web Rule Symposium (RuleML 2015). Berlin, Germany, August 3-5, 2015 http://2015.ruleml.org RR 2015 also hosts a doctoral consortium, which will provide PhD students with an opportunity to present and discuss their research directions, to be involved in discussions on the state-of-the-art research, and to establish fruitful collaborations. In particular, the doctoral consortium will include a mentoring lunch and a poster session, organized jointly with the 9th International Web Rule Symposium (RuleML 2015). Further details on the RR doctoral consortium will be communicated by means of a separate Call for Papers, as well as on the RR 2015 website. == TOPICS AND SUBMISSION INSTRUCTIONS == The scale and the heterogenous nature of web data poses many challenges, and turns basic tasks such as query answering and data transformations into complex reasoning problems. Rule-based systems have found many applications in this area. The RR conference welcomes original research from all areas of Web Reasoning and Rule Systems. Topics of particular interest are: - Rule-based languages for intelligent information access and for the semantic web - Ontology-based data access - Data management, and data interoperability for web data - Distributed agent-based systems for the web - Scalability and expressive power of logics for the semantic web - Reasoning with incomplete, inconsistenct and uncertain data - Non-monotonic, commonsense, and closed-world reasoning for web data - Constraint programming, inductive logic programming for web data - Streaming data and complex event processing - Rule-based approaches to machine learning, knowledge extraction and information retrieval - Rule-based approaches to natural language processing - System descriptions, applications and experiences There are two submission formats: - Full papers (up to 15 pages in LNCS style) - Technical Communications (up to 6 pages in LNCS style) Submitted full papers should present original and significant research results. They must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference/workshop with formal proceedings. Double submission to a workshop with informal proceedings is allowed, like for instance the DL 2014 workshop. Technical communications are intended for promising but possibly preliminary work, position papers, system descriptions, and applications descriptions (which may be accompanied by a demo). The conference proceedings will be published by Springer in the Lecture Notes in Computer Science series (LNCS), and all submissions must be prepared in Springer's LaTeX style llncs (http://www.springer.com/comp/lncs/Authors.html). Submissions are made via EasyChair: https://www.easychair.org/conferences/?conf=rr2015 == IMPORTANT DATES == - Title and Abstract submission: March 3, 2015 - Full papers submission: March 10, 2015 - Notification of acceptance: April 15, 2015 - Camera-ready submission: May 15, 2015 For each of these deadlines, a cut-off point of 23:59 AOE (anywhere on earth) applies. == BEST PAPER AND BEST STUDENT PAPER AWARDS == Awards for Best Paper and Best Student Paper will be presented to the corresponding author(s) at the conference. The best student paper will be selected among the ones mainly only by students (i.e., authors a PhD as of the paper submission deadline). To qualify for the Best Student Paper award, the authors must indicate their eligibility upon submission at easychair. The program committee reserves the right to not give out a Best Student Paper award, or to split the award among multiple submissions. == INVITED SPEAKERS == - Michael Genesereth (Stanford University) - Benny Kimelfeld (Technion & LogicBlox) - Lora Aroyo (Free University of Amsterdam) == ORGANIZATION == General Chair: - Wolfgang Faber (University of Huddersfield) Doctoral Consortium Chair: - Marco Montali (Free Universiy of Bozen-Bolzano) Local Organization Chair: - Adrian Paschke (Free University of Berlin) Sponsorship Chair: - Marco Maratea (University of Genova) Publicity Chair: - Luca Pulina (University of Sassari) Web Chair: - Ralph Schaefermeier (Free University of Berlin) Program Committee: - Balder ten Cate (LogicBlox, USA) - co-chair - Alessandra Mileo (DERI, Ireland) - co-chair - Darko Anicic (Siemens AG, Germany) - Marcelo Arenas (Pontificia Universidad Catolica de Chile, Chile) - Marcello Balduccini (Drexel University, USA) - Leopoldo Bertossi (Carleton University, Canada) - Meghyn Bienvenu (Universite Paris Sud, France) - Fernando Bobillo (University of Zaragoza, Spain) - Daniel Deutsch (Tel Aviv, Israel) - Agostino Dovier (Università degli Studi di Udine, Italy) - Thomas Eiter (TU Vienna, Austria) - Sergio Flesca (University of Calabria, Italy) - Paul Fodor (Stony Brook University, USA) - Andres Freitas (INSIGHT NUI Galway, Ireland) - Andre Hernich (Liverpool, UK) - Stijn Heymans (SRI, USA) - Aidan Hogan (National University of Ireland, Galway, Ireland) - Benny Kimelfeld (Technion, Israel & LogicBlox, Inc) - Roman Kontchakov (Birkbeck College, UK) - Markus Krötzsch (University of Oxford, UK) - Georg Lausen (Universitaet Freiburg, Germany) - Joohyung Lee (Arizona State University, USA) - Domenico Lembo (Sapienza Universita di Roma, Italy) - Carsten Lutz (Universität Bremen, Germany) - Thomas Meyer (CSIR Meraka Institute, South Africa) - Boris Motik (Oxford University, UK) - Marco Montali (Free University of Bozen-Bolzano, Italy) - Marie-Laure Mugnier (LIRMM/INRIA, Montpellier, France) - Matthias Nickels (NUI Galway, Ireland) - Magdalena Ortiz (TU Vienna, Austria) - Giorgio Orsi (University of Oxford, UK) - Jeff Z. Pan (University of Aberdeen) - Adrian Paschke (Freie Universität Berlin, Germany) - Axel Polleres (WU-Vienna, Austria) - Lucian Popa (IBM Almaden, USA) - Francesco Ricca (University of Calabria, Italy) - Riccardo Rosati (Sapienza Universita di Roma, Italy) - Sebastian Rudolph (TU Dresden, Germany) - Luciano Serafini (FBK Trento, Italy) - Evgeny Sherkhonov (University of Amsterdam, Netherlands) - Steffen Staab (University of Koblenz-Landau, Germany) - Umberto Straccia (ISTI-CNR, Pisa, Italy) -- Luca Pulina, Ph.D. Assistant Professor of Computer Science POLCOMING - Department of Political Science, Communication, Engineering and Information Technologies University of Sassari e-mail lp...@un... http://sites.google.com/site/lpulina |
|
From: Ashmore, L. <Lil...@bc...> - 2015-02-01 19:59:21
|
?Hello! I'm desperately trying to compile my aleph.pl file with the Yap compiler on EITHER Ubuntu 14 LTS or Windows 8.1 Pro. I have not succeeded in either so far. I followed the instructions for installation for Ubuntu from the README as below, and it fails on the configure step (loads of errors). I tried to make it anyway, and it halts at yap.o. An executable is never created so I cannot ./yap, etc. To compile YAP just do: (1) mkdir arch (2) cd arch (3) ../configure (4) check the Makefile for any extensions or changes you want to make. (5) make (6) If the compilation succeeds, try ./yap (7) Happy? make install And for Windows 8.1, I downloaded an installer from here (http://www.dcc.fc.up.pt/~vsc/Yap/downloads.html), and it installed, but I have a folder with a bunch of .dlls and a /bin /doc /share folder with loads of stuff, but I don't know how to actually use anything to compile a aleph.pl script. When I execute "yap -s5000 -h20000 'filepath.pl' ", it errors because I have another "YAP" application called Yet Another Previewer, which the cmd.exe recognizes as "yap" which comes with the basic installation for MikTex (Latex for Windows). Any help for either OS would be really amazing. I really want to explore hypothesis generation for my research in graduate school. Thanks so much! Lilli Ashmore Baylor College of Medicine |
|
From: Jon S. <Jon...@CS...> - 2015-01-19 10:31:46
|
New Book Robert Kowalski LOGIC FOR PROBLEM SOLVING, REVISITED ISBN 9783837036299 Also available as E-Book http://books.google.de/books?id=6vh1BQAAQBAJ&hl=en Algorithm = Logic + Control Robert Kowalski revisits his classic text on Computational Logic in the light of subsequent developments, extending it by a substantial commentary of fifty pages. |
|
From: Luca P. <lp...@un...> - 2015-01-15 17:28:17
|
[apologies for any cross-posting] ****************************************************************** CALL FOR PAPERS The 9th International Conference on Web Reasoning and Rule Systems (RR 2015) Berlin, Germany, August 4-6, 2015 http://www.csw.inf.fu-berlin.de/RR2015/ ****************************************************************** The International Conference on Web Reasoning and Rule Systems (RR) is a major forum for discussion and dissemination of new results concerning Web Reasoning and Rule Systems. RR 2015 is colocated with the following events: - 11th Reasoning Web Summer School (RW 2015) Berlin, Germany, July 31 - August 4, 2015. http://www.csw.inf.fu-berlin.de/rw2015/ - The 25th International Conference on Automated Deduction (CADE 2015). Berlin, Germany, August 1 - August 7, 2015. http://conference.mi.fu-berlin.de/cade-25/home - The 9th International Web Rule Symposium (RuleML 2015). Berlin, Germany, August 3-5, 2015 http://2015.ruleml.org RR 2015 also hosts a doctoral consortium, which will provide PhD students with an opportunity to present and discuss their research directions, to be involved in discussions on the state-of-the-art research, and to establish fruitful collaborations. In particular, the doctoral consortium will include a mentoring lunch and a poster session, organized jointly with the 9th International Web Rule Symposium (RuleML 2015). Further details on the RR doctoral consortium will be communicated by means of a separate Call for Papers, as well as on the RR 2015 website. == TOPICS AND SUBMISSION INSTRUCTIONS == The scale and the heterogenous nature of web data poses many challenges, and turns basic tasks such as query answering and data transformations into complex reasoning problems. Rule-based systems have found many applications in this area. The RR conference welcomes original research from all areas of Web Reasoning and Rule Systems. Topics of particular interest are: - Rule-based languages for intelligent information access and for the semantic web - Ontology-based data access - Data management, and data interoperability for web data - Distributed agent-based systems for the web - Scalability and expressive power of logics for the semantic web - Reasoning with incomplete, inconsistenct and uncertain data - Non-monotonic, commonsense, and closed-world reasoning for web data - Constraint programming, inductive logic programming for web data - Streaming data and complex event processing - Rule-based approaches to machine learning, knowledge extraction and information retrieval - Rule-based approaches to natural language processing - System descriptions, applications and experiences There are two submission formats: - Full papers (up to 15 pages in LNCS style) - Technical Communications (up to 6 pages in LNCS style) Submitted full papers should present original and significant research results. They must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference/workshop with formal proceedings. Double submission to a workshop with informal proceedings is allowed, like for instance the DL 2014 workshop. Technical communications are intended for promising but possibly preliminary work, position papers, system descriptions, and applications descriptions (which may be accompanied by a demo). The conference proceedings will be published by Springer in the Lecture Notes in Computer Science series (LNCS), and all submissions must be prepared in Springer's LaTeX style llncs (http://www.springer.com/comp/lncs/Authors.html). Submissions are made via EasyChair: https://www.easychair.org/conferences/?conf=rr2015 == IMPORTANT DATES == - Title and Abstract submission: March 3, 2015 - Full papers submission: March 10, 2015 - Notification of acceptance: April 15, 2015 - Camera-ready submission: May 15, 2015 For each of these deadlines, a cut-off point of 23:59 AOE (anywhere on earth) applies. == BEST PAPER AND BEST STUDENT PAPER AWARDS == Awards for Best Paper and Best Student Paper will be presented to the corresponding author(s) at the conference. The best student paper will be selected among the ones mainly only by students (i.e., authors a PhD as of the paper submission deadline). To qualify for the Best Student Paper award, the authors must indicate their eligibility upon submission at easychair. The program committee reserves the right to not give out a Best Student Paper award, or to split the award among multiple submissions. == INVITED SPEAKERS == - Michael Genesereth (Stanford University) - Benny Kimelfeld (Technion & LogicBlox) - Lora Aroyo (Free University of Amsterdam) == ORGANIZATION == General Chair: - Wolfgang Faber (University of Huddersfield) Doctoral Consortium Chair: - Marco Montali (Free Universiy of Bozen-Bolzano) Local Organization Chair: - Adrian Paschke (Free University of Berlin) Sponsorship Chair: - Marco Maratea (University of Genova) Publicity Chair: - Luca Pulina (University of Sassari) Web Chair: - Ralph Schaefermeier (Free University of Berlin) Program Committee: - Balder ten Cate (LogicBlox, USA) - co-chair - Alessandra Mileo (DERI, Ireland) - co-chair - Darko Anicic (Siemens AG, Germany) - Marcelo Arenas (Pontificia Universidad Catolica de Chile, Chile) - Marcello Balduccini (Drexel University, USA) - Leopoldo Bertossi (Carleton University, Canada) - Meghyn Bienvenu (Universite Paris Sud, France) - Fernando Bobillo (University of Zaragoza, Spain) - Daniel Deutsch (Tel Aviv, Israel) - Agostino Dovier (Università degli Studi di Udine, Italy) - Thomas Eiter (TU Vienna, Austria) - Sergio Flesca (University of Calabria, Italy) - Paul Fodor (Stony Brook University, USA) - Andres Freitas (INSIGHT NUI Galway, Ireland) - Andre Hernich (Liverpool, UK) - Stijn Heymans (SRI, USA) - Aidan Hogan (National University of Ireland, Galway, Ireland) - Benny Kimelfeld (Technion, Israel & LogicBlox, Inc) - Roman Kontchakov (Birkbeck College, UK) - Markus Krötzsch (University of Oxford, UK) - Georg Lausen (Universitaet Freiburg, Germany) - Joohyung Lee (Arizona State University, USA) - Domenico Lembo (Sapienza Universita di Roma, Italy) - Carsten Lutz (Universität Bremen, Germany) - Thomas Meyer (CSIR Meraka Institute, South Africa) - Boris Motik (Oxford University, UK) - Marco Montali (Free University of Bozen-Bolzano, Italy) - Marie-Laure Mugnier (LIRMM/INRIA, Montpellier, France) - Matthias Nickels (NUI Galway, Ireland) - Magdalena Ortiz (TU Vienna, Austria) - Giorgio Orsi (University of Oxford, UK) - Jeff Z. Pan (University of Aberdeen) - Adrian Paschke (Freie Universität Berlin, Germany) - Axel Polleres (WU-Vienna, Austria) - Lucian Popa (IBM Almaden, USA) - Francesco Ricca (University of Calabria, Italy) - Riccardo Rosati (Sapienza Universita di Roma, Italy) - Sebastian Rudolph (TU Dresden, Germany) - Luciano Serafini (FBK Trento, Italy) - Evgeny Sherkhonov (University of Amsterdam, Netherlands) - Steffen Staab (University of Koblenz-Landau, Germany) - Umberto Straccia (ISTI-CNR, Pisa, Italy) -- Luca Pulina, Ph.D. Assistant Professor of Computer Science POLCOMING - Department of Political Science, Communication, Engineering and Information Technologies University of Sassari e-mail lp...@un... http://sites.google.com/site/lpulina |
|
From: Paulo M. <pm...@lo...> - 2015-01-07 01:50:49
|
Hi, The stable release of the third generation of Logtalk (3.x) is now 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. Highlights compared with the previous generation of Logtalk (2.x) include: - faster compiler and runtime - refined language semantics - stricter language syntax - improved compiler lint checker - new message forwarding and message delegation support - new structured message printing mechanism - new structured question asking mechanism - major improvements to reflection support - make functionality and support for absolute and relative source file paths - extended coinduction support - new Prolog conformance unit test suite - extended Logtalk unit test suites - new programming examples Also included in this release are new and improved developer tools: - new assertions and ports profiler tools - improved debugger with new trace options and support for source file line breakpoints - improved unit test framework with support for full code coverage, determinism tests, input/output tests, and new test dialects - improved diagrams tool with support for file loading and dependency diagrams, entity and predicate cross-reference diagrams, diagrams of Prolog module applications, and extended options including URL linking options to documentation and source code repositories - improved documenting tool with support for exporting Markdown text files, extended linking options, and more complete coverage of entity and predicate properties Supported Prolog compilers: - B-Prolog 7.8 or later versions - CxProlog 0.97.7 or later versions - ECLiPSe 6.1#143 or later versions - GNU Prolog 1.4.2 or later versions - Lean Prolog 3.8.8 or later versions (experimental) - Qu-Prolog 9.0 or later versions - Quintus Prolog 3.3~3.5 (experimental) - SICStus Prolog 4.1.0 or later versions - SWI Prolog 6.0.0 or later versions - XSB 3.5.0 or later versions - YAP 6.3.4 or later versions 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 (and Prolog) commercial consulting and development services, see: http://logtalk.pt/ Happy New Year, Paulo ----------------------------------------------------------------- Paulo Moura Logtalk developer Email: <mailto:pm...@lo...> Web: <http://logtalk.org/> ----------------------------------------------------------------- |
|
From: Vitor S. C. <vs...@gm...> - 2014-12-17 07:26:38
|
Hi Nikos 6.3 includes a port of the swi odbc module, and i expect that might work in 6.2. Yap also has myddas that includes mysql and odbc interfaces. From what i remember, myddas is read only. Good Luck! Vitor On Tuesday, December 16, 2014, Nikos Katzouris <nk...@ii...> wrote: > Hi all, > > Does anybody know if YAP offers a way to connect to a (preferably > postgresql) database and make sql queries? Something like SWI's odbc > module? > > Thanks a lot > > Nikos > > > ------------------------------------------------------------------------------ > Download BIRT iHub F-Type - The Free Enterprise-Grade BIRT Server > from Actuate! Instantly Supercharge Your Business Reports and Dashboards > with Interactivity, Sharing, Native Excel Exports, App Integration & more > Get technology previously reserved for billion-dollar corporations, FREE > > http://pubads.g.doubleclick.net/gampad/clk?id=164703151&iu=/4140/ostg.clktrk > _______________________________________________ > Yap-users mailing list > Yap...@li... <javascript:;> > https://lists.sourceforge.net/lists/listinfo/yap-users > |
|
From: Nikos K. <nk...@ii...> - 2014-12-16 11:38:04
|
Hi all, Does anybody know if YAP offers a way to connect to a (preferably postgresql) database and make sql queries? Something like SWI's odbc module? Thanks a lot Nikos |
|
From: Maurizio P. <mau...@IA...> - 2014-12-06 08:26:37
|
============================================================
25th International Symposium on
Logic-Based Program Synthesis and Transformation
LOPSTR 2015
http://alpha.diism.unisi.it/lopstr15/
University of Siena, Siena, IT, July 13-15, 2015
DEADLINES
Abstract submission: April 6, 2015
Paper/Extended abstract submission: April 13, 2015
============================================================
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 25th International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR 2015) will be held at the University of Siena,
Siena, Italy; previous symposia were held in Canterbury, 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 2015 will be co-located with PPDP 2015 (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 chair in case of questions).
Important Dates
Abstract submission: April 6, 2015
Paper/Extended abstract submission: April 13, 2015
Notification: May 25, 2015
Camera-ready (for electronic pre-proceedings): June 15, 2015
Symposium: July 13-15, 2015
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.
Papers should be submitted via the Easychair submission website for LOPSTR
2015, which you can access through the website of LOPSTR 2015.
Proceedings
The formal post-conference proceedings will be published by Springer in the
Lecture Notes in Computer Science series (to be confirmed).
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.
Special journal issue
After the symposium, a selection of the best papers will be invited to
a special
issue of a primary computer science journal. The submissions to the
special issue
must be substantial extensions of the proceedings versions and will
undergo the
usual journal reviewing process.
Program Committee
Slim Abdennadher German University of Cairo, Egypt
Maria Alpuente Universitat Politecnica de Valencia, Spain
Demis Ballis University of Udine, Italy
Olaf Chitil University of Kent, UK
Michael Codish Ben-Gurion University, Israel
Moreno Falaschi University of Siena, Italy (Program Chair)
Jerome Feret INRIA and ENS, France
Maurizio Gabbrielli University of Bologna, Italy
Jurgen Giesl RWTH Aachen University, Germany
Miguel Gomez-Zamalloa Complutense University of Madrid, Spain
Arnaud Gotlieb SIMULA Research Laboratory, Norway
Gopal Gupta University of Texas at Dallas, USA
Manuel Hermenegildo IMDEA, Spain
Viktor Kuncak EPFL Lausanne, Switzerland
Alexei Lisitsa University of Liverpool, UK
Narciso Marti-Oliet Universidad Complutense de Madrid, Spain
Jorge Navas NASA, USA
Kazuhiro Ogata JAIST, Japan
Carlos Olarte ECT, Universidade Federal do Rio Grande do Norte, Brasil
Catuscia Palamidessi INRIA and Ecole Polytechnique, France
Maurizio Proietti IASI-CNR, Italy
Albert Rubio Universitat Politecnica de Catalunya, Barcelona, Spain
Wim Vanhoof University of Namur, Belgium
Program and Symposium Chair:
Moreno Falaschi, Dept. of Information Engineering and Mathematics,
Univ. of Siena, Italy
(mor...@un...)
Organizing Committee
Monica Bianchini, Dept. of Information Engineering and Mathematics,
Univ. of Siena, Italy
Sara Brunetti, Dept. of Information Engineering and Mathematics, Univ.
of Siena, Italy
Simone Rinaldi, Dept. of Information Engineering and Mathematics,
Univ. of Siena, Italy
Elisa Tiezzi, Dept. of Information Engineering and Mathematics, Univ.
of Siena, Italy
|
|
From: Maurizio P. <mau...@IA...> - 2014-12-05 12:21:37
|
======================================================================
Call for papers
17th International Symposium on
Principles and Practice of Declarative Programming
PPDP 2015
Special Issue of Science of Computer Programming (SCP)
Siena, Italy, July 14-16, 2015
(co-located with LOPSTR 2015)
http://costa.ls.fi.upm.es/ppdp15
======================================================================
SUBMISSION DEADLINE: 20 MARCH, 2015
PPDP 2015 is a forum that brings together researchers from the
declarative programming communities, including those working in the
logic, constraint and functional programming paradigms, but also
embracing languages, database languages, and knowledge representation
languages. The goal is to stimulate research in the use of logical
formalisms and methods for specifying, performing, and analyzing
computations, including mechanisms for mobility, modularity,
concurrency, object-orientation, security, verification and static
analysis. Papers related to the use of declarative paradigms and tools
in industry and education are especially solicited. Topics of interest
include, but are not limited to
* Functional programming
* Logic programming
* Answer-set programming
* Functional-logic programming
* Declarative visual languages
* Constraint Handling Rules
* Parallel implementation and concurrency
* Monads, type classes and dependent type systems
* Declarative domain-specific languages
* Termination, resource analysis and the verification of declarative programs
* Transformation and partial evaluation of declarative languages
* Language extensions for security and tabulation
* Probabilistic modeling in a declarative language and modeling reactivity
* Memory management and the implementation of declarative systems
* Practical experiences and industrial application
This year the conference will be co-located with the 25th
International Symposium on Logic-Based Program Synthesis and
Transformation (LOPSTR 2015).
The conference will be held in Siena, Italy. Previous symposia were
held at Canterbury (UK), Madrid (Spain), Leuven (Belgium), Odense
(Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain),
Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy),
Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal
(Canada), and Paris (France). You might have a look at the contents of
past PPDP symposia.
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 chair in case of questions).
After the symposium, a selection of the best papers will be invited to
extend their submissions in the light of the feedback solicited at the
symposium. The papers are expected to include at least 30% extra
material over and above the PPDP version. Then, after another round of
reviewing, these revised papers will be published in a special issue
of SCP with a target publication date by Elsevier of 2016.
Important Dates
Abstract Submission: 14 March, 2015
Paper submission: 20 March, 2015
Notification: 14 May, 2015
Camera-ready: To be announced
Symposium: 14-16 July, 2015
Authors should submit an electronic copy of the full paper in
PDF. Papers should be submitted to the submission website for PPDP
2015. Each submission must include on its first page the paper title;
authors and their affiliations; abstract; and three to four
keywords. The keywords will be used to assist the program committee in
selecting appropriate reviewers for the paper. Papers should consist
of the equivalent of 12 pages under the ACM formatting
guidelines. These guidelines are available online, along with
formatting templates or style files. Submitted papers will be judged
on the basis of significance, relevance, correctness, originality, and
clarity. They should include a clear identification of what has been
accomplished and why it is significant. Authors who wish to provide
additional material to the reviewers beyond the 12-page limit can do
so in clearly marked appendices: reviewers are not required to read
such appendices.
Program Committee
Michael Adams, University of Utah, USA
Puri Arenas, Complutense University of Madrid, Spain
Amir Ben-Amram, Tel-Aviv Academic College, Israel
Ines Castro, Universidade do Porto, Portugal
Patrick Cousot, New York University, USA
Gregory Duck, National University of Singapore, Singapore
Fabio Fioravanti, University of Chieti-Pescara, Italy
Thom FrŸhwirth, University of Ulm, Germany
Roberto Giacobazzi, University of Verona, Italy
Michael Hanus, CAU Kiel, Germany
Andy King, University of Kent, UK
F. L—pez-Fraguas, Complutense University of Madrid, Spain
Ian Mackie, University of Sussex, UK
Dale Miller, INRIA and LIX/Ecole Polytechnique, France
Torsten Schaub, University of Potsdam, Germany
Tom Schrijvers KU Leuven, Belgium
Frank D. Valencia, CNRS and LIX, Ecole Polytechnique, France
German Vidal, Universitat Politecnica de Valencia, Spain
Marina Vos, University of Bath, UK
Nobuko Yoshida, Imperial College London, UK
Program Chair
Elvira Albert
Complutense University of Madrid
C/ Profesor Garcia Santesmases
E-28040 Madrid, Spain
Email: el...@si...
Symposium Chair
Moreno Falaschi
Department of information engineering and mathematics
University of Siena, Italy
Email: mor...@un...
|
|
From: nicos a. <nic...@st...> - 2014-12-04 11:23:38
|
Final Call for Papers International Journal of Approximate Reasoning (IJAR) Special Issue on Probabilistic Logic Programming (PLP) Deadline: 15th December 2014 Submissions: Authors should prepare their manuscript according to the Guide for Authors available from the online submission page of the (IJAR) at http://ees.elsevier.com/ija/. Authors must select "Special Issue: Probabilistic LP" when they reach the "Article Type" step in the submission process. All papers will be peer-reviewed following the IJAR reviewing procedures. Papers for the special issue are solicited in all areas of Probabilistic Logic Programming. Including but not restricted to: * 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 Further information: http://stoics.org.uk/plp/ijar/ Guest Editors Nicos Angelopoulos (Imperial College, UK) Angelika Kimmig (KU Leuven, BE) |
|
From: Nicos A. (I. C. London)
<nic...@ya...> - 2014-10-22 22:01:58
|
Call for Papers International Journal of Approximate Reasoning (IJAR) Special Issue on Probabilistic Logic Programming (PLP) Deadline: 15th December 2014 Submissions: Authors should prepare their manuscript according to the Guide for Authors available from the online submission page of the (IJAR) at http://ees.elsevier.com/ija/. Authors must select "Special Issue: Probabilistic LP" when they reach the "Article Type" step in the submission process. All papers will be peer-reviewed following the IJAR reviewing procedures. Papers for the special issue are solicited in all areas of Probabilistic Logic Programming. Including but not restricted to: * 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 Further information: http://stoics.org.uk/plp/ijar/ Guest Editors Nicos Angelopoulos (Imperial College, UK) Angelika Kimmig (KU Leuven, BE) |
|
From: Dengji Z. <d....@so...> - 2014-10-12 23:45:41
|
Dear all, I am trying to install Yap 6.2.2 on Mac OS X 10.9.5, the configuration failed to test readline: configure: error: --with-readline was given, but test for readline failed See `config.log' for more details. I have installed readline via both port and brew, and tried also specify --with-readline=/usr/local, none of them worked! I also followed the instruction from http://comments.gmane.org/gmane.comp.ai.prolog.yap.general/1754 Have any of you had the same problem? I really don't know what is the problem. Many thanks, Dengji |
|
From: David P. <dav...@fl...> - 2014-09-26 15:38:27
|
Can any one help? I can’t get mmapped arrays or array term extensions working anywhere! This is a problem I have found with multiple version of yap incuding 6.2.2 and 6.3.4 and older versions. Although mmap is verified and term extensions specified, I can’t get them to work although standard syntax versions of dynamic and static arrays, named and anonymous, work. It is a problem I’ve found compiling on multiple machines and with precompiled versions including - SunOS kurango 5.10 Generic_147147-26 sun4u sparc SUNW,Sun-Fire-V440 - SunOS apollo 5.10 Generic_147147-26 sun4u sparc SUNW,Sun-Fire-V490 - Linux c114.csem.flinders.edu.au<http://csem.flinders.edu.au> 2.6.32-431.23.3.el6.x86_64 #1 SMP Thu Jul 31 17:20:51 UTC 2014 x86_64 x86_64 x86_64 GNU/Linux - Darwin Davids-MacBook-Pro.local 13.4.0 Darwin Kernel Version 13.4.0: Sun Aug 17 19:50:11 PDT 2014; root:xnu-2422.115.4~1/RELEASE_X86_64 x86_64 - Windows-7 64-bit Relevant configuration information can be seen below (the SunOS and Linux configures) $ grep -i mmap config.* config.h:#define HAVE_MMAP 1 config.h:#define USE_MMAP (HAVE_MMAP & !USE_MALLOC & !USE_SYSTEM_MALLOC) config.h:#define USE_SHM (HAVE_SHMAT & !HAVE_MMAP & !USE_MALLOC & !USE_SYSTEM_MALLOC) config.h:#define USE_SBRK (HAVE_SBRK & !HAVE_MMAP & !HAVE_SHMAT & !USE_MALLOC & !USE_SYSTEM_MALLOC) config.log:configure:9080: checking for mmap config.log:| #define HAVE_MMAP 1 config.log:| #define HAVE_MMAP 1 config.log:ac_cv_func_mmap=yes config.log:#define HAVE_MMAP 1 $ grep YAP_EXT Makefile # Add this flag to YAP_EXTRAS if you need the extension: YAP_EXTRAS=-DCUT_C=1 -DTERM_EXTENSIONS=1 -DCOROUTINING=1 -DRATIONAL_TREES=1 -DDEPTH_LIMIT=1 -D_GNU_SOURCE -DENV_COPY=1 The problems and successess with arrays are shown below. The mmapped memory is actually created or mapped successfully, but just not returned as a static array. $ vi letters $ ls -l bad letters ls: bad: No such file or directory -rw-r--r-- 1 powers staff 27 27 Sep 00:11 letters $ cat letters abcdefghijklmnopqrstuvwxyz $ yap YAP 6.3.4 (i386-darwin12.2.1): Sun Jan 20 22:04:05 WET 2013 MYDDAS version MYDDAS-0.9.1 ?- array(dyn,26), update_array(dyn,1,a),array_element(dyn,1,A). A = a ?- array(dyn,26), update_array(dyn,1,a),array_element(dyn,1,A). A = a ?- array(dyn,26), update_array(dyn,1,a),array_element(dyn,1,A),X is dyn[1]. ERROR!! SYNTAX ERROR: array( dyn , 26 ) , update_array( dyn , 1 , a ) , array_element( dyn , 1 , A ) , X is dyn <==== HERE ====> [ 1 ]. |:array(Dyn,26),update_array(Dyn,1,a),array_element(Dyn,1,A). A = a, Dyn = {_A,a,_B,_C,_D,_E,_F,_G,_H,_I,_J,_K,_L,_M,_N,_O,_P,_Q,_R,_S,_T,_U,_V,_W,_X,_Y} ?- array(Dyn,26),update_array(Dyn,1,a),array_element(Dyn,1,A),X is Dyn[1]. ERROR!! SYNTAX ERROR: array( Dyn , 26 ) , update_array( Dyn , 1 , a ) , array_element( Dyn , 1 , A ) , X is Dyn <==== HERE ====> [ 1 ]. |:static_array(sta,26,char),update_array(sta,1,"a"),array_element(sta,1,A). A = 97 ?- A="a". A = [97] ?- array_element(sta,1,A). A = 97 ?- mmapped_array(let,26,char,letters). no ?- mmapped_array(bad,26,char,bad). no ?- $ ls -l bad letters -rw------- 1 powers staff 26 27 Sep 00:29 bad -rw-r--r-- 1 powers staff 27 27 Sep 00:28 letters $ Thanks in advance for any help or hints. David |
|
From: Gong Su <gon...@gm...> - 2014-09-18 19:04:28
|
Hi, restore from within yap-6.3 doesn't seem to work:
[root@localhost yap-6.3]# LD_LIBRARY_PATH=. ./yap
YAP 6.3.4 (x86_64-linux): Thu Sep 18 14:23:27 EDT 2014
?- assert(friend(a,b)).
true.
?- friend(X,b).
X = a.
?- save_program('test').
true.
?- halt.
% YAP execution halted
[root@localhost yap-6.3]# LD_LIBRARY_PATH=. ./yap
YAP 6.3.4 (x86_64-linux): Thu Sep 18 14:23:27 EDT 2014
?- restore('test').
false.
?- friend(X,b).
existence_error(procedure,friend/2)
ERROR!!
EXISTENCE ERROR- procedure friend/2 is undefined, called from context
prolog:$user_call/2
Goal was user:friend(_131110,b)
?-
Loading saved image on command line does work:
[root@localhost yap-6.3]# LD_LIBRARY_PATH=. ./yap test
YAP 6.3.4 (x86_64-linux): Thu Sep 18 14:23:27 EDT 2014
?- friend(X,b).
X = a.
?-
|
|
From: Gong Su <go...@ho...> - 2014-09-16 18:23:20
|
Hi Vitor, thank you very much for fixing the bug! I can now configure with --enable-threads and save_program works fine! The latest code has a slight hiccup in the build process (undefined symbol Yap_DebugPlWrite when creating yap binary). Because there is a call to Yap_DebugPlWrite in the function CopyTermToArena in file C/globals.c not surrounded by #ifdef DEBUG. Fixing that and all is fine. I also noticed there were quite a few warnings when compiling packages/jpl/src/c/jpl.c, mostly due to incompatible pointer type. I tried the FamilyMT example and it appears to work fine. So I hope the warnings are harmless but perhaps should be cleaned up eventually. Thank you again for the quick bug fix and the great effort in maintaining yap! On Tue, Sep 16, 2014 at 9:44 AM, Vitor Santos Costa <vs...@gm...> wrote: > Dear Gong Su > > Thanks! > > The first bug was called only once, maybe that's how come I didn't notice. > The second bug was not in qlyw.yap, it was a bug in a data-base update that > broke an invariant for qlyw. The bug didn't actually affect execution, > that's why it survived for so long. The updates are at: > > https://github.com/vscosta/yap-6.3.git > > Don't be worried about the number of commits, they are mostly moving > comments around :) > > Great report! > > Vitor > > On Fri, Sep 12, 2014 at 6:04 PM, Gong Su <go...@ho...> wrote: > >> Hi, I'm not sure whether this is the right email for reporting yap bugs. >> >> I'm trying to compile and run, on 64-bit Intel RedHat Linux, the latest >> version of yap-6.3 which I got from the git repository using >> >> git clone git://git.code.sf.net/p/yap/yap-6.3 >> >> I found a couple of bugs: >> >> 1. In file C/qlyw.c, function save_int, the local variable v is declared >> as UInt (8 bytes) instead of int (4 bytes). As a result, the save_bytes >> call will only save the first 4 bytes of v. On a little endian machine, >> this happens to be correct. But on a big endian machine, you will get all >> 0s. >> >> 2. When configure yap with the option --enable-threads, you cannot do >> save_program. save_program will result in a segmentation fault like the >> following: >> >> % >> % >> % YAP OOOPS: tried to access illegal address 0x18!!!!. >> % >> % >> % >> % PC: prolog:qsave_program/1 at clause 1 >> % Continuation: prolog:qsave_program/1 at clause 1 >> Active Choice-Points: >> prolog:$user_call(save_program(test),save_program(test)) >> prolog:$yes_no(save_program(test),?-) >> prolog:$catch(_131266,user:$Error(_131266),_1048524) >> prolog:[Segmentation fault >> >> I have tried to do some debugging and it appears that there are predicate >> structures with garbage FunctorOfPred pointers. I added an fprintf line in >> save_program function: >> >> fprintf(stderr, "%p %x %p\n", pp->FunctorOfPred, >> pp->FunctorOfPred->KindOfPE, pp->FunctorOfPred->NameOfFE); >> >> and here are a few lines (among many): >> >> 0x6a87c0 bb00 0x6a8790 >> 0x6a8640 bb00 0x6a8610 >> 0x6a84c0 6a84f0 (nil) >> 0x6a8370 6a83a0 0x726f5f >> 0x6a8220 bb00 0x6a8200 >> 0x6a80b0 bb00 0x6a8090 >> 0x6a7f40 bb00 0x6a7f20 >> 0x6a7db0 bb00 0x6a7d80 >> 0x6a7c10 bb00 0x6a7bf0 >> 0x6a7aa0 6a7ad0 0x70666564 >> 0x6a7950 6a7980 0x706665646e >> 0x6a7800 6a7830 0x6d6574737973 >> 0x6a76b0 6a76e0 0x6d657473 >> 0x6a7540 bb00 0x6a7520 >> 0x6a73d0 bb00 0x68b7d0 >> 0x695fa0 74c540 0x21 >> 0x6a7140 bb00 0x6a7110 >> 0x6a6fc0 bb00 0x6a6f90 >> 0x6a6e40 bb00 0x6a6e10 >> 0x6a6cc0 bb00 0x6a6c90 >> 0x6a6b40 bb00 0x6a6b10 >> 0x6a69c0 bb00 0x6a6990 >> >> >> >> >> ------------------------------------------------------------------------------ >> Want excitement? >> Manually upgrade your production database. >> When you want reliability, choose Perforce >> Perforce version control. Predictably reliable. >> >> http://pubads.g.doubleclick.net/gampad/clk?id=157508191&iu=/4140/ostg.clktrk >> _______________________________________________ >> Yap-users mailing list >> Yap...@li... >> https://lists.sourceforge.net/lists/listinfo/yap-users >> >> > |
|
From: Vitor S. C. <vs...@gm...> - 2014-09-16 13:45:07
|
Dear Gong Su Thanks! The first bug was called only once, maybe that's how come I didn't notice. The second bug was not in qlyw.yap, it was a bug in a data-base update that broke an invariant for qlyw. The bug didn't actually affect execution, that's why it survived for so long. The updates are at: https://github.com/vscosta/yap-6.3.git Don't be worried about the number of commits, they are mostly moving comments around :) Great report! Vitor On Fri, Sep 12, 2014 at 6:04 PM, Gong Su <go...@ho...> wrote: > Hi, I'm not sure whether this is the right email for reporting yap bugs. > > I'm trying to compile and run, on 64-bit Intel RedHat Linux, the latest > version of yap-6.3 which I got from the git repository using > > git clone git://git.code.sf.net/p/yap/yap-6.3 > > I found a couple of bugs: > > 1. In file C/qlyw.c, function save_int, the local variable v is declared > as UInt (8 bytes) instead of int (4 bytes). As a result, the save_bytes > call will only save the first 4 bytes of v. On a little endian machine, > this happens to be correct. But on a big endian machine, you will get all > 0s. > > 2. When configure yap with the option --enable-threads, you cannot do > save_program. save_program will result in a segmentation fault like the > following: > > % > % > % YAP OOOPS: tried to access illegal address 0x18!!!!. > % > % > % > % PC: prolog:qsave_program/1 at clause 1 > % Continuation: prolog:qsave_program/1 at clause 1 > Active Choice-Points: > prolog:$user_call(save_program(test),save_program(test)) > prolog:$yes_no(save_program(test),?-) > prolog:$catch(_131266,user:$Error(_131266),_1048524) > prolog:[Segmentation fault > > I have tried to do some debugging and it appears that there are predicate > structures with garbage FunctorOfPred pointers. I added an fprintf line in > save_program function: > > fprintf(stderr, "%p %x %p\n", pp->FunctorOfPred, > pp->FunctorOfPred->KindOfPE, pp->FunctorOfPred->NameOfFE); > > and here are a few lines (among many): > > 0x6a87c0 bb00 0x6a8790 > 0x6a8640 bb00 0x6a8610 > 0x6a84c0 6a84f0 (nil) > 0x6a8370 6a83a0 0x726f5f > 0x6a8220 bb00 0x6a8200 > 0x6a80b0 bb00 0x6a8090 > 0x6a7f40 bb00 0x6a7f20 > 0x6a7db0 bb00 0x6a7d80 > 0x6a7c10 bb00 0x6a7bf0 > 0x6a7aa0 6a7ad0 0x70666564 > 0x6a7950 6a7980 0x706665646e > 0x6a7800 6a7830 0x6d6574737973 > 0x6a76b0 6a76e0 0x6d657473 > 0x6a7540 bb00 0x6a7520 > 0x6a73d0 bb00 0x68b7d0 > 0x695fa0 74c540 0x21 > 0x6a7140 bb00 0x6a7110 > 0x6a6fc0 bb00 0x6a6f90 > 0x6a6e40 bb00 0x6a6e10 > 0x6a6cc0 bb00 0x6a6c90 > 0x6a6b40 bb00 0x6a6b10 > 0x6a69c0 bb00 0x6a6990 > > > > > ------------------------------------------------------------------------------ > Want excitement? > Manually upgrade your production database. > When you want reliability, choose Perforce > Perforce version control. Predictably reliable. > > http://pubads.g.doubleclick.net/gampad/clk?id=157508191&iu=/4140/ostg.clktrk > _______________________________________________ > Yap-users mailing list > Yap...@li... > https://lists.sourceforge.net/lists/listinfo/yap-users > > |
|
From: Gong Su <go...@ho...> - 2014-09-12 23:04:20
|
Hi, I'm not sure whether this is the right email for reporting yap bugs. I'm trying to compile and run, on 64-bit Intel RedHat Linux, the latest version of yap-6.3 which I got from the git repository using git clone git://git.code.sf.net/p/yap/yap-6.3 I found a couple of bugs: 1. In file C/qlyw.c, function save_int, the local variable v is declared as UInt (8 bytes) instead of int (4 bytes). As a result, the save_bytes call will only save the first 4 bytes of v. On a little endian machine, this happens to be correct. But on a big endian machine, you will get all 0s. 2. When configure yap with the option --enable-threads, you cannot do save_program. save_program will result in a segmentation fault like the following: % % % YAP OOOPS: tried to access illegal address 0x18!!!!. % % % % PC: prolog:qsave_program/1 at clause 1 % Continuation: prolog:qsave_program/1 at clause 1 Active Choice-Points: prolog:$user_call(save_program(test),save_program(test)) prolog:$yes_no(save_program(test),?-) prolog:$catch(_131266,user:$Error(_131266),_1048524) prolog:[Segmentation fault I have tried to do some debugging and it appears that there are predicate structures with garbage FunctorOfPred pointers. I added an fprintf line in save_program function: fprintf(stderr, "%p %x %p\n", pp->FunctorOfPred, pp->FunctorOfPred->KindOfPE, pp->FunctorOfPred->NameOfFE); and here are a few lines (among many): 0x6a87c0 bb00 0x6a8790 0x6a8640 bb00 0x6a8610 0x6a84c0 6a84f0 (nil) 0x6a8370 6a83a0 0x726f5f 0x6a8220 bb00 0x6a8200 0x6a80b0 bb00 0x6a8090 0x6a7f40 bb00 0x6a7f20 0x6a7db0 bb00 0x6a7d80 0x6a7c10 bb00 0x6a7bf0 0x6a7aa0 6a7ad0 0x70666564 0x6a7950 6a7980 0x706665646e 0x6a7800 6a7830 0x6d6574737973 0x6a76b0 6a76e0 0x6d657473 0x6a7540 bb00 0x6a7520 0x6a73d0 bb00 0x68b7d0 0x695fa0 74c540 0x21 0x6a7140 bb00 0x6a7110 0x6a6fc0 bb00 0x6a6f90 0x6a6e40 bb00 0x6a6e10 0x6a6cc0 bb00 0x6a6c90 0x6a6b40 bb00 0x6a6b10 0x6a69c0 bb00 0x6a6990 |
|
From: Paulo M. <pm...@lo...> - 2014-09-03 09:22:23
|
[apologies in case of multiple receptions] Hi, Logtalk 3.00.0 Release Candidate 1 is now available for downloading at: http://logtalk.org/ Logtalk is an object-oriented logic programming language that extends and leverages the Prolog language with a feature set suitable for programming in the large. Written in highly portable code, it can use most modern Prolog implementations as a back-end compiler. As a multi-paradigm language, it includes support for both prototypes and classes, protocols (interfaces), categories (components), event-driven programming, and high-level multi-threading programming. Its distribution includes full documentation, portable libraries, a comprehensive set of portable developer tools, and a large number of programming examples to help get you started. Logtalk can also be used as a highly portable layer on top of Prolog, as a Prolog library used together other libraries, and as a porting tool. It subsumes Prolog modules by both being able to compile modules as objects and by providing a portable implementation of the de facto common core Prolog module features. Developer tool highlights include a unit testing framework supporting full code coverage at the clause level and determinism tests; a sophisticated diagramming tool able to illustrate library, entity, and predicate relations; a documenting tool capable of of generating API documentation in e.g. HTML and PDF; and a port profiler tool for performance analysis of actual predicate execution. This is a near final release of the third generation of Logtalk. Only documentation and bug fixes are expected before the final, stable, release, which is expected later this month. Interested parties are invited to test their applications, specially if migrating from Logtalk 2.x. This release fixes long standing meta-predicate execution context issues inherited from Logtalk 2.x, improves meta-predicate semantics by ensuring that meta-arguments are always called with the caller full execution context, refines and improves multifile predicate semantics, adds a new token to the structured message printing mechanism, features a new port profiler tool, improves the debugger and diagrams tools, fixes all known bugs, includes documentation and unit test updates, and SWI-Prolog, XSB, and YAP compatibility improvements. For details and a complete list of changes, please consult the release notes at: https://github.com/LogtalkDotOrg/logtalk3/blob/master/RELEASE_NOTES.md The new port profiler tool is described at: http://forums.logtalk.org/viewtopic.php?f=21&t=240 Happy logtalking! Paulo ----------------------------------------------------------------- Paulo Moura Logtalk developer Email: <mailto:pm...@lo...> Web: <http://logtalk.org/> ----------------------------------------------------------------- |
|
From: Davide N. <dav...@cs...> - 2014-08-04 09:33:28
|
Dear all,
I have problems with tabling with any version (6.2.3 and 6.3.3), in some
cases abolish_all_tables crashes yap. (not always, for some specific
programs)
I also have problem with this simple blocksworld program when I run, for
example, the query goal(2,S). it crashes
if I do a trace I get strange numbers that should not be there e.g.:
% trace
?- goal(2,S).
(1) call:goal(2,_131661) ?
(2) call:on(5,4,2,_131661) ?
(3) call:on(5,4,_131847,_131843) ?
? (3) exit:on(5,4,0,[]) ?
(4) call:*3826* is 1+1 ?
(4) fail:3826 is 1+1 ?
(5) call:3826 is 1+1 ?
(5) fail:3826 is 1+1 ?
at (4) the goal is NextT is T+1, but NextT should be a variable (not
grounded), instead I get the number *3826* that comes from nowhere.
the problem seems related to tabling.
any idea?
thanks!
Davide
results without tracing:
YAP 6.3.3 (x86_64-linux): Mon Jul 28 17:40:18 CEST 2014
MYDDAS version MYDDAS-0.9.1
?- goal(2,S).
%
%
% YAP OOOPS: tried to access illegal address 0x80!!!!.
%
%
%
% PC: meta-call
% Continuation: user:on/4 at clause 6
% 1175KB of Global Stack (0x7fa92b951018--0x7fa92ba76db0)
% 537KB of Local Stack (0x7fa92bb22be8--0x7fa92bba9010)
% 163KB of Trail (0x7fa92bba9018--0x7fa92bbd1fd8)
% Performed 0 garbage collections
% All Active Calls and
% Goals With Alternatives Open (Global In Use--Local In Use)
%
% meta-call (1036KB--26KB)
% user:on/4 at clause 6
% user:on/4 at clause 6
% meta-call (1036KB--25KB)
% meta-call (1036KB--25KB)
% user:movesucceed/6 at clause 1
% user:clear/3 at clause 4
% meta-call (1036KB--24KB)
% user:clear/3 at clause 3
% meta-call (1036KB--24KB)
% user:movesucceed/6 at clause 1
% user:on/4 at clause 7
% meta-call (1035KB--23KB)
% user:on/4 at clause 6
% meta-call (1035KB--22KB)
% user:clear/3 (1035KB--22KB)
% meta-call (1035KB--22KB)
% user:clear/3 (1035KB--22KB)
% user:movesucceed/6 at clause 1
% meta-call (1032KB--12KB)
% user:on/4 at clause
6
% user:on/4 at clause
6
% meta-call
(1032KB--12KB)
% user:clear/3
(1032KB--11KB)
% meta-call (1032KB--11KB)
% user:movesucceed/6 at clause 1
% meta-call (1029KB--3KB)
% user:clear/3 at clause 3
% user:movesucceed/6 at clause 1
% user:clear/3 at clause 4
% meta-call (1028KB--2KB)
% user:clear/3 at clause 3
% user:clear/3 (1028KB--1KB)
% user:movesucceed/6 at clause 1
% user:on/4 at clause 7
% meta-call (1028KB--1KB)
% user:on/4 at clause 6
% user:goal/2 at clause 1
% prolog:$query/2 at clause 3
% prolog:$command/4 at clause 2
% prolog:$enter_top_level/0 at clause 5
% prolog:$catch/3 (1027KB--0KB)
% prolog:$system_catch/4 at clause 1
% meta-call
% meta-call
% meta-call
% meta-call
Exiting ....
Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm
|
|
From: Paulo M. <pm...@lo...> - 2014-07-31 14:15:38
|
Hi, Logtalk 3.00.0 Beta 9, released today (http://forums.logtalk.org/viewtopic.php?f=21&t=239), includes an improved diagrams tool that supports generating entity and file diagrams for Prolog module applications. The diagrams tool generates DOT files that can be easily converted into e.g. SVG for web publishing or PDF files for printing. Some simple examples: 1. csv module entity and cross-referencing diagrams http://logtalk.org/diagrams/csv_entity_diagram.pdf http://logtalk.org/diagrams/csv_xref_diagram.pdf Generated using: ?- {diagrams(loader)}, use_module(library(csv)), entity_diagram::files(csv, [csv,record,pure_input,debug,option,error], [node_type_captions(true),layout(top_to_bottom)]). ?- {diagrams(loader)}, use_module(library(csv)), xref_diagram::files(csv, [csv,record,pure_input,debug,option,error], [node_type_captions(true),layout(top_to_bottom)]). $ dot -Tpdf csv_entity_diagram.dot > csv_entity_diagram.pdf $ dot -Tpdf csv_xref_diagram.dot > csv_xref_diagram.pdf 2. ansi_term module file load and cross-referencing diagrams http://logtalk.org/diagrams/ansi_term_file_load_diagram.pdf http://logtalk.org/diagrams/ansi_term_module_xref_diagram.pdf Generated using: ?- {diagrams(loader)}, use_module(library(ansi_term)), file_load_diagram::files(ansi_term, [ansi_term], [omit_path_prefixes(['/Users/pmoura/'])]). ?- {diagrams(loader)}, use_module(library(ansi_term)), xref_diagram::entity(ansi_term). $ dot -Tpdf ansi_term_file_load_diagram.dot > ansi_term_file_load_diagram.pdf $ dot -Tpdf ansi_term_module_xref_diagram.dot > ansi_term_module_xref_diagram.pdf 3. pengines module cross-referencing diagram http://logtalk.org/diagrams/pengines_module_xref_diagram.pdf Generated using: ?- {diagrams(loader)}, use_module(library(pengines)), xref_diagram::entity(pengines, [omit_path_prefixes(['/Users/pmoura/']), layout(left_to_right), title('pengines library by Torbjörn Lager and Jan Wielemaker')]). $ dot -Tpdf pengines_module_xref_diagram.dot > pengines_module_xref_diagram.pdf When using SVG as the final output format, it's possible to add URLs to the diagram elements. The following Logtalk example illustrates how to use this feature to link to both documentation and source code repository files: http://logtalk.org/library/tools_inheritance_diagram.svg This diagram was generated using the query: ?- diagrams::rlibrary(tools, [title('Logtalk development tools'), url_prefixes('https://github.com/LogtalkDotOrg/logtalk3/tree/master/', 'http://logtalk.org/library/'), omit_path_prefixes(['/Users/pmoura/logtalk/', '/opt/local/share/logtalk/'])]). Methods are provided for generating diagrams for modules, files, and directories. The generated diagrams support a large set of customization options, including title, date, layout direction, captions, and exclusion lists. For more information on the tool see: https://github.com/LogtalkDotOrg/logtalk3/blob/master/tools/diagrams/NOTES.md http://logtalk.org/library/diagrams_tool.html Hope you find the tool useful. Your feedback is most appreciated. Cheers, Paulo ----------------------------------------------------------------- Paulo Moura Logtalk developer Email: <mailto:pm...@lo...> Web: <http://logtalk.org/> ----------------------------------------------------------------- |
|
From: Nicos A. (I. C. London)
<nic...@ya...> - 2014-07-15 10:42:57
|
International Journal of Approximate Reasoning Special issue on the 1st Probabilistic Logic Programming workshop (PLP, http://stoics.org.uk/plp/ijar). Call for additional contributions. Deadline: Oct 6th, 2014 The 1st PLP workshop is held on the 17th of July 2014, in Vienna, Austria as part of the International Conference on Logic Programming. Additional contributions to the special issue on all topics of the workshop are sought. Topics include but not limited to: ------ * 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 Editors ----- Nicos Angelopoulos (Imperial College, UK) Angelika Kimmig (KU Leuven, Belgium) |
|
From: muupan m. <mu...@gm...> - 2014-06-27 22:17:37
|
Hello, I'm using YAP 6.2.2 from a C++ program that dynamically switches among different saved states by repeatedly calling YAP_FastInit(). Now I'm trying 6.3.3, but I found that from the commit [af7510] repeated calls of YAP_Init() are ignored. Is there any alternative way to the same in the latest YAP? Muupan |
|
From: Thom F. <tho...@un...> - 2014-06-23 10:47:56
|
Are you logically experienced? New books for you: Tsang - Foundations of Constraint Satisfaction http://books.google.com/books?id=UFmRAwAAQBAJ&dq=isbn:9783735723666 ISBN 9783735723666 Wielemaker - SWI Prolog Reference Manual http://www.amazon.de/SWI-Prolog-Reference-Manual-7-1/dp/3735738036/ ISBN 9783735738035 Carlsson - SICStus Prolog User's Manual http://www.amazon.de/SICStus-Prolog-Users-Manual-4-3/dp/3735737447/ ISBN 9783735737441 Frühwirth/Raiser - Constraint Handling Rules: Compilation, Execution, and Analysis http://www.informatik.uni-ulm.de/pm/fileadmin/pm/home/fruehwirth/chr-thesis-book.html ISBN 9783839115916 Upcoming: Kowalski revisits Logic for Problem Solving Best Regards, Thom Fruehwirth, University of Ulm This is a one-time posting only. If you want to receive more information on such books, join the newsletter of [logical-books]. -- [logical-books] Information about high-quality scientific books and textbooks published by researchers for researchers and students in Computer Science and other academic fields. --- To subscribe, send email to log...@go... Visit this group at https://groups.google.com/d/forum/logical-books |
30 messages has been excluded from this view by a project administrator.
