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: Roelof W. <r.w...@ho...> - 2014-03-11 13:50:43
|
Hello, I installed Yap on a Windows 7 machine. But I wonder which directory do I have to use to save my own files which contains my own clauses ? Roelof |
|
From: Roelof W. <r.w...@ho...> - 2014-03-11 07:56:58
|
Hello, I like to try yap on my frugalware machine. Now I wonder can I use for example gedit as IDE and then use yap to make the queries. And to learn prolog. Can I follow the Adventure in Prolog from Amzi. Roelof |
|
From: Marco M. <ma...@di...> - 2014-03-05 15:57:57
|
[Apologize for multiple posting.]
[More information about the planned JLC special issue is added]
===============================================================================
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
|
|
From: Vitor S. C. <vs...@gm...> - 2014-03-03 14:52:51
|
Hi Sergio checking for g++... no checking for c++... no Looks like you don' t have g++ installed. This means gecode, minisat and clpbn-bp will not be able to compile. I' ll try to improve support for this case, so that yap will not try and will give awarnning. About odbc, it is not a real problem, you just don' t install the package. The message is written for a swi package and is maybe too dramatic for yap. It will work if you install unixodbc-dev. The WARNING: unrecognized options: -enable-coroutining, --enable-clpbn-bp coorutining is now in all versions, and has been for a while. clpbn-bp I' ll check. Thanks! Vitor On Mon, Mar 3, 2014 at 11:55 AM, Sergio Castro <ser...@ya...> wrote: > Thanks for the quick reply Vitor, > > In fact I am not trying to use something else than gcc as the compiler. > I just upgraded gcc to 4.8 since I thought that may be the problem (but I > already had problems before the upgrade). > > Below the output of the configure command. > I also see that there is this error, probably unrelated to my problem, but > anyway please tell me if you know how to fix it: > > ERROR: Cannot find odbc library or the header sql.h > WARNING: ODBC interface will not be built > > > Output follows: > --- > parallels@ubuntu:~/prologengines/yaptmp/yap-6.3/ARCH$ ../configure > --prefix=/usr/local --with-java --enable-threads --enable-pthread-locking > --enable-depth-limit --enable-coroutining --enable-clpbn-bp=no > --enable-tabling --with-gmp=/usr/local > configure: WARNING: unrecognized options: --enable-coroutining, > --enable-clpbn-bp > checking for gcc... gcc > checking whether the C compiler works... yes > checking for C compiler default output file name... a.out > checking for suffix of executables... > checking whether we are cross compiling... no > checking for suffix of object files... o > checking whether we are using the GNU C compiler... yes > checking whether gcc accepts -g... yes > checking for gcc option to accept ISO C89... none needed > checking how to run the C preprocessor... gcc -E > checking for g++... no > checking for c++... no > checking for gpp... gpp > checking whether we are using the GNU C++ compiler... no > checking whether gpp accepts -g... no > checking for gawk... no > checking for mawk... mawk > checking build system type... x86_64-unknown-linux-gnu > checking host system type... x86_64-unknown-linux-gnu > checking target system type... x86_64-unknown-linux-gnu > checking for a sed that does not truncate output... /bin/sed > checking Major version... 6 > checking Minor version... 3 > checking Point version... 4 > checking whether CXX supports -std-c++0x... no > checking whether ln -s works... yes > checking for a BSD-compatible install... /usr/bin/install -c > checking for ranlib... ranlib > checking for ar... ar > checking for install-info... /usr/sbin/install-info > checking for sh... /bin/bash > checking for indent... no > checking for sin in -lm... yes > checking for socket in -lsocket... no > checking for getsockname in -lxnet... no > checking for main in -lstdc++... no > checking for main in -lnsl... yes > checking for main in -lcrypt... yes > checking for main in -lnss_files... yes > checking for main in -lnss_dns... yes > checking for main in -lresolv... yes > checking for main in -lncurses... yes > checking for main in -lreadline... yes > checking for main in -lgmp... yes > checking for Judy1Set in -lJudy... no > libJudy not found, UDI will only work with one Index at a time > checking for pthread_create in -lpthread... yes > checking for grep that handles long lines and -e... /bin/grep > checking for egrep... /bin/grep -E > checking for ANSI C header files... yes > checking for sys/types.h... yes > checking for sys/stat.h... yes > checking for stdlib.h... yes > checking for string.h... yes > checking for memory.h... yes > checking for strings.h... yes > checking for inttypes.h... yes > checking for stdint.h... yes > checking for unistd.h... yes > checking pthread.h usability... yes > checking pthread.h presence... yes > checking for pthread.h... yes > checking for pthread_mutexattr_setkind_np... yes > checking for pthread_mutexattr_settype... yes > checking whether ld supports --enable-new-dtags... yes > checking for sys/wait.h that is POSIX.1 compatible... yes > checking for restartable system calls... yes > checking for dlopen in -ldl... yes > checking for ANSI C header files... (cached) yes > checking for sys/wait.h that is POSIX.1 compatible... (cached) yes > checking arpa/inet.h usability... yes > checking arpa/inet.h presence... yes > checking for arpa/inet.h... yes > checking alloca.h usability... yes > checking alloca.h presence... yes > checking for alloca.h... yes > checking crtdbg.h usability... no > checking crtdbg.h presence... no > checking for crtdbg.h... no > checking crypt.h usability... yes > checking crypt.h presence... yes > checking for crypt.h... yes > checking ctype.h usability... yes > checking ctype.h presence... yes > checking for ctype.h... yes > checking direct.h usability... no > checking direct.h presence... no > checking for direct.h... no > checking dirent.h usability... yes > checking dirent.h presence... yes > checking for dirent.h... yes > checking dlfcn.h usability... yes > checking dlfcn.h presence... yes > checking for dlfcn.h... yes > checking errno.h usability... yes > checking errno.h presence... yes > checking for errno.h... yes > checking execinfo.h usability... yes > checking execinfo.h presence... yes > checking for execinfo.h... yes > checking fcntl.h usability... yes > checking fcntl.h presence... yes > checking for fcntl.h... yes > checking fenv.h usability... yes > checking fenv.h presence... yes > checking for fenv.h... yes > checking float.h usability... yes > checking float.h presence... yes > checking for float.h... yes > checking fpu_control.h usability... yes > checking fpu_control.h presence... yes > checking for fpu_control.h... yes > checking ieeefp.h usability... no > checking ieeefp.h presence... no > checking for ieeefp.h... no > checking io.h usability... no > checking io.h presence... no > checking for io.h... no > checking limits.h usability... yes > checking limits.h presence... yes > checking for limits.h... yes > checking locale.h usability... yes > checking locale.h presence... yes > checking for locale.h... yes > checking malloc.h usability... yes > checking malloc.h presence... yes > checking for malloc.h... yes > checking math.h usability... yes > checking math.h presence... yes > checking for math.h... yes > checking for memory.h... (cached) yes > checking netdb.h usability... yes > checking netdb.h presence... yes > checking for netdb.h... yes > checking netinet/in.h usability... yes > checking netinet/in.h presence... yes > checking for netinet/in.h... yes > checking netinet/tcp.h usability... yes > checking netinet/tcp.h presence... yes > checking for netinet/tcp.h... yes > checking pwd.h usability... yes > checking pwd.h presence... yes > checking for pwd.h... yes > checking regex.h usability... yes > checking regex.h presence... yes > checking for regex.h... yes > checking shlobj.h usability... no > checking shlobj.h presence... no > checking for shlobj.h... no > checking siginfo.h usability... no > checking siginfo.h presence... no > checking for siginfo.h... no > checking signal.h usability... yes > checking signal.h presence... yes > checking for signal.h... yes > checking stdarg.h usability... yes > checking stdarg.h presence... yes > checking for stdarg.h... yes > checking for stdint.h... (cached) yes > checking for string.h... (cached) yes > checking stropts.h usability... yes > checking stropts.h presence... yes > checking for stropts.h... yes > checking sys/conf.h usability... no > checking sys/conf.h presence... no > checking for sys/conf.h... no > checking sys/dir.h usability... yes > checking sys/dir.h presence... yes > checking for sys/dir.h... yes > checking sys/file.h usability... yes > checking sys/file.h presence... yes > checking for sys/file.h... yes > checking sys/mman.h usability... yes > checking sys/mman.h presence... yes > checking for sys/mman.h... yes > checking sys/ndir.h usability... no > checking sys/ndir.h presence... no > checking for sys/ndir.h... no > checking sys/param.h usability... yes > checking sys/param.h presence... yes > checking for sys/param.h... yes > checking sys/resource.h usability... yes > checking sys/resource.h presence... yes > checking for sys/resource.h... yes > checking sys/select.h usability... yes > checking sys/select.h presence... yes > checking for sys/select.h... yes > checking sys/shm.h usability... yes > checking sys/shm.h presence... yes > checking for sys/shm.h... yes > checking sys/socket.h usability... yes > checking sys/socket.h presence... yes > checking for sys/socket.h... yes > checking for sys/stat.h... (cached) yes > checking sys/time.h usability... yes > checking sys/time.h presence... yes > checking for sys/time.h... yes > checking sys/times.h usability... yes > checking sys/times.h presence... yes > checking for sys/times.h... yes > checking for sys/types.h... (cached) yes > checking sys/ucontext.h usability... yes > checking sys/ucontext.h presence... yes > checking for sys/ucontext.h... yes > checking sys/un.h usability... yes > checking sys/un.h presence... yes > checking for sys/un.h... yes > checking for sys/wait.h... (cached) yes > checking time.h usability... yes > checking time.h presence... yes > checking for time.h... yes > checking for unistd.h... (cached) yes > checking utime.h usability... yes > checking utime.h presence... yes > checking for utime.h... yes > checking wctype.h usability... yes > checking wctype.h presence... yes > checking for wctype.h... yes > checking winsock.h usability... no > checking winsock.h presence... no > checking for winsock.h... no > checking winsock2.h usability... no > checking winsock2.h presence... no > checking for winsock2.h... no > checking zlib.h usability... yes > checking zlib.h presence... yes > checking for zlib.h... yes > checking zutil.h usability... no > checking zutil.h presence... no > checking for zutil.h... no > checking mach-o/dyld.h usability... no > checking mach-o/dyld.h presence... no > checking for mach-o/dyld.h... no > checking LibLoaderAPI.h usability... no > checking LibLoaderAPI.h presence... no > checking for LibLoaderAPI.h... no > checking gmp.h usability... yes > checking gmp.h presence... yes > checking for gmp.h... yes > checking Judy.h usability... no > checking Judy.h presence... no > checking for Judy.h... no > checking readline/readline.h usability... yes > checking readline/readline.h presence... yes > checking for readline/readline.h... yes > checking readline/history.h usability... yes > checking readline/history.h presence... yes > checking for readline/history.h... yes > checking for rl_completion_matches... yes > checking for rl_clear_pending_input... yes > checking for rl_cleanup_after_signal... yes > checking for rl_event_hook... yes > checking for rl_filename_completion_function... yes > checking for rl_free_line_state... yes > checking for rl_insert_close... yes > checking for rl_set_prompt... yes > checking for rl_state_initialized... no > no > checking for inline... inline > checking whether struct tm is in sys/time.h or time.h... time.h > checking size of int *... 8 > checking size of short int... 2 > checking size of int... 4 > checking size of long int... 8 > checking size of long long int... 8 > checking size of float... 4 > checking size of double... 8 > checking size of void *... 8 > checking for type of malloc... void * > checking for gcc inline... yes > checking for gcc threaded code... yes > checking for IEEE floats... yes > checking for sigsetjmp... yes > checking for sigsegv... yes > checking for sigprof... yes > checking for siginfo... yes > checking "variable timezone in tzset"... yes > checking for struct tm.tm_gmtoff... yes > checking union wait... yes > checking environ... yes > checking return type of signal handlers... void > checking for _NSGetEnviron... no > checking for _chsize_s... no > checking for access... yes > checking for acosh... yes > checking for alloca... no > checking for asinh... yes > checking for atanh... yes > checking for chdir... yes > checking for clock... yes > checking for clock_gettime... yes > checking for ctime... yes > checking for dlopen... yes > checking for dup2... yes > checking for erf... yes > checking for feclearexcept... yes > checking for fesettrapenable... no > checking for fgetpos... yes > checking for finite... yes > checking for fpclass... no > checking for ftime... yes > checking for ftruncate... yes > checking for getcwd... yes > checking for getenv... yes > checking for getexecname... no > checking for gethostbyname... yes > checking for gethostent... yes > checking for gethostid... yes > checking for gethostname... yes > checking for gethrtime... no > checking for getpagesize... yes > checking for getpid... yes > checking for getpwnam... yes > checking for getrlimit... yes > checking for getrusage... yes > checking for gettimeofday... yes > checking for getwd... yes > checking for isatty... yes > checking for isnan... yes > checking for isfinite... no > checking for isinf... yes > checking for kill... yes > checking for labs... yes > checking for link... yes > checking for lgamma... yes > checking for localeconv... yes > checking for localtime... yes > checking for lstat... yes > checking for mallinfo... yes > checking for mbscoll... no > checking for mbscasecoll... no > checking for mbsnrtowcs... yes > checking for memcpy... yes > checking for memmove... yes > checking for mkstemp... yes > checking for mktemp... yes > checking for nanosleep... yes > checking for mktime... yes > checking for opendir... yes > checking for putenv... yes > checking for rand... yes > checking for random... yes > checking for readlink... yes > checking for regexec... yes > checking for rename... yes > checking for rint... yes > checking for sbrk... yes > checking for select... yes > checking for setbuf... yes > checking for setlinebuf... yes > checking for setitimer... yes > checking for setlocale... yes > checking for setsid... yes > checking for setlinebuf... (cached) yes > checking for sigaction... yes > checking for siggetmask... yes > checking for siginterrupt... yes > checking for signal... yes > checking for sigprocmask... yes > checking for socket... yes > checking for srand... yes > checking for srandom... yes > checking for stat... yes > checking for strchr... yes > checking for strerror... yes > checking for stricmp... no > checking for strlwr... no > checking for strncat... yes > checking for strncpy... yes > checking for strtod... yes > checking for time... yes > checking for times... yes > checking for tmpnam... yes > checking for usleep... yes > checking for utime... yes > checking for vsnprintf... yes > checking for wcsdup... yes > checking for regexec... (cached) yes > checking for NSLinkModule... no > checking for alarm... yes > checking for mmap... yes > checking for popen... yes > checking for shmat... yes > checking for sleep... yes > checking for system... yes > checking for ttyname... yes > checking for waitpid... yes > checking for fetestexcept... yes > checking for snprintf... yes > checking for mpz_xor... yes > checking if fflush(NULL) clobbers input pipes... no > no > checking for pthread_create in -lpthread... (cached) yes > checking for socklen_t... yes > checking for ssize_t... yes > checking "variable timezone in tzset"... yes > checking for struct tm.tm_gmtoff... (cached) yes > checking _XOPEN_SOURCE... yes > checking for library containing mysql_init... no > checking for library containing SQLAllocHandle... no > checking for library containing SQLAllocHandle... (cached) no > checking mysql/mysql.h usability... no > checking mysql/mysql.h presence... no > checking for mysql/mysql.h... no > checking for socket... (cached) yes > checking for gethostent... (cached) yes > checking for uuid_create in -lossp-uuid... no > checking for uuid_create in -luuid... no > configure: WARNING: Cannot find libossp-uuid or libuuid -- dropping uuid.pl > checking for crypt in -lcrypt... yes > checking for crypt... yes > checking for syslog... yes > checking "Configuring MIME libraries"... checking for > x86_64-unknown-linux-gnu-gcc... gcc > checking whether the C compiler works... yes > checking for C compiler default output file name... a.out > checking for suffix of executables... > checking whether we are cross compiling... yes > checking for suffix of object files... o > checking whether we are using the GNU C compiler... yes > checking whether gcc accepts -g... yes > checking for gcc option to accept ISO C89... none needed > checking build system type... x86_64-unknown-linux-gnu > checking host system type... x86_64-unknown-linux-gnu > checking for x86_64-unknown-linux-gnu-ar... no > checking for ar... ar > configure: WARNING: using cross tools not prefixed with host triplet > checking for x86_64-unknown-linux-gnu-ranlib... no > checking for ranlib... ranlib > checking how to run the C preprocessor... gcc -E > checking for grep that handles long lines and -e... /bin/grep > checking for egrep... /bin/grep -E > checking for ANSI C header files... yes > checking for sys/types.h... yes > checking for sys/stat.h... yes > checking for stdlib.h... yes > checking for string.h... yes > checking for memory.h... yes > checking for strings.h... yes > checking for inttypes.h... yes > checking for stdint.h... yes > checking for unistd.h... yes > checking minix/config.h usability... no > checking minix/config.h presence... no > checking for minix/config.h... no > checking whether it is safe to define __EXTENSIONS__... yes > checking for ANSI C header files... (cached) yes > checking for an ANSI C-conforming const... yes > checking for size_t... yes > checking whether struct tm is in sys/time.h or time.h... time.h > checking for strcasecmp... yes > checking for strncasecmp... yes > checking how to calculate alternate timezone... daylight > configure: creating ./config.status > config.status: creating Makefile > config.status: creating config.h > checking for x86_64-unknown-linux-gnu-gcc... gcc > checking whether the C compiler works... yes > checking for C compiler default output file name... a.out > checking for suffix of executables... > checking whether we are cross compiling... yes > checking for suffix of object files... o > checking whether we are using the GNU C compiler... yes > checking whether gcc accepts -g... yes > checking for gcc option to accept ISO C89... none needed > checking build system type... x86_64-unknown-linux-gnu > checking host system type... x86_64-unknown-linux-gnu > checking for x86_64-unknown-linux-gnu-ar... no > checking for ar... ar > configure: WARNING: using cross tools not prefixed with host triplet > checking for x86_64-unknown-linux-gnu-ranlib... no > checking for ranlib... ranlib > checking how to run the C preprocessor... gcc -E > checking for grep that handles long lines and -e... /bin/grep > checking for egrep... /bin/grep -E > checking for ANSI C header files... yes > checking for sys/types.h... yes > checking for sys/stat.h... yes > checking for stdlib.h... yes > checking for string.h... yes > checking for memory.h... yes > checking for strings.h... yes > checking for inttypes.h... yes > checking for stdint.h... yes > checking for unistd.h... yes > checking minix/config.h usability... no > checking minix/config.h presence... no > checking for minix/config.h... no > checking whether it is safe to define __EXTENSIONS__... yes > checking for ANSI C header files... (cached) yes > checking for unistd.h... (cached) yes > checking sys/wait.h usability... yes > checking sys/wait.h presence... yes > checking for sys/wait.h... yes > checking for strings.h... (cached) yes > checking for missing gethostname prototype... no > checking for an ANSI C-conforming const... yes > checking for off_t... yes > checking for size_t... yes > checking for pid_t... yes > checking for strncasecmp... yes > checking for strcasecmp... yes > configure: creating ./config.status > config.status: creating Makefile > config.status: creating rfc2045charset.h > config.status: creating config.h > checking h_errno... yes > checking for malloc.h... (cached) yes > checking for alloca.h... (cached) yes > checking for unistd.h... (cached) yes > checking for sys/time.h... (cached) yes > checking for fcntl.h... (cached) yes > checking for utime.h... (cached) yes > checking for execinfo.h... (cached) yes > checking for sys/resource.h... (cached) yes > checking for crypt.h... (cached) yes > checking syslog.h usability... yes > checking syslog.h presence... yes > checking for syslog.h... yes > checking for sys/types.h... (cached) yes > checking for sys/wait.h... (cached) yes > checking for sys/stat.h... (cached) yes > checking for netinet/tcp.h... (cached) yes > checking crt_externs.h usability... no > checking crt_externs.h presence... no > checking for crt_externs.h... no > checking size of long... 8 > checking size of long long... 8 > checking for setsid... (cached) yes > checking for strerror... (cached) yes > checking for utime... (cached) yes > checking for getrlimit... (cached) yes > checking for strcasestr... yes > checking for vfork... yes > checking for _NSGetEnviron... (cached) no > checking for pipe2... yes > checking for socklen_t... (cached) yes > checking for ssize_t... (cached) yes > checking _XOPEN_SOURCE... yes > checking archive.h usability... yes > checking archive.h presence... yes > checking for archive.h... yes > checking for archive_read_new in -larchive... yes > checking for archive_read_support_compression_bzip2... no > checking for archive_read_support_compression_compress... no > checking for archive_read_support_compression_gzip... no > checking for archive_read_support_compression_lzma... no > checking for archive_read_support_compression_none... no > checking for archive_read_support_compression_xz... no > checking for archive_read_support_format_ar... no > checking for archive_read_support_format_cpio... no > checking for archive_read_support_format_empty... no > checking for archive_read_support_format_iso9660... no > checking for archive_read_support_format_mtree... no > checking for archive_read_support_format_raw... no > checking for archive_read_support_format_tar... no > checking for archive_read_support_format_zip... no > checking for SQLAllocEnv in -lodbc... no > checking for SQLAllocEnv in -liodbc... no > checking whether byte ordering is bigendian... no > checking for malloc.h... (cached) yes > checking for time.h... (cached) yes > checking for sql.h... no > checking for localtime... (cached) yes > checking for mktime... (cached) yes > checking for gmtime... yes > checking for timegm... yes > checking for long long... yes > checking size of long... (cached) 8 > checking size of SQLWCHAR... 0 > checking size of wchar_t... 4 > checking for SQLLEN... no > checking for SQLULEN... no > ERROR: Cannot find odbc library or the header sql.h > WARNING: ODBC interface will not be built > checking for zlib.h... (cached) yes > checking for zutil.h... (cached) no > checking for zlibVersion in -lz... yes > configure: checking Java configuration... > checking for jikes... no > checking for javac... /usr/lib/jvm/default-java/bin/javac > checking if /usr/lib/jvm/default-java/bin/javac works... yes > checking for kaffe... no > checking for java... /usr/lib/jvm/default-java/bin/java > checking for uudecode... no > configure: WARNING: I have to compile Test.class from scratch > checking if /usr/lib/jvm/default-java/bin/java works... yes > checking for jar... /usr/lib/jvm/default-java/bin/jar > checking for javadoc... /usr/lib/jvm/default-java/bin/javadoc > _JTOPDIR="/usr/lib/jvm/default-java" > Trying /usr/lib/jvm/default-java/jre/lib/amd64/server > checking wchar.h usability... yes > checking wchar.h presence... yes > checking for wchar.h... yes > checking size of wchar_t... (cached) 4 > checking size of void*... 8 > checking size of long... (cached) 8 > checking size of long long... (cached) 8 > configure: creating ./config.status > config.status: creating packages/raptor/Makefile > config.status: creating config.h > config.status: creating YapTermConfig.h > config.status: creating packages/raptor/raptor_config.h > config.status: executing exe commands > chmod: cannot access 'packages/ltx2htm/latex2html': No such file or > directory > configure: WARNING: unrecognized options: --enable-coroutining, > --enable-clpbn-bp > checking gecode/support/config.hpp usability... no > checking gecode/support/config.hpp presence... no > checking for gecode/support/config.hpp... no > checking if dynamic arrays are supported... yes > configure: creating ./config.status > config.status: creating packages/raptor/Makefile > config.status: creating packages/cplint/Makefile > config.status: creating packages/cplint/approx/simplecuddLPADs/Makefile > config.status: creating packages/cplint/slipcase/Makefile > config.status: creating packages/cuda/Makefile > config.status: creating Makefile > config.status: creating library/Makefile > config.status: creating library/lammpi/Makefile > config.status: creating library/matrix/Makefile > config.status: creating library/mpi/Makefile > config.status: creating library/random/Makefile > config.status: creating library/regex/Makefile > config.status: creating library/rltree/Makefile > config.status: creating library/system/Makefile > config.status: creating library/tries/Makefile > config.status: creating packages/Makefile.defs > config.status: creating packages/Dialect.defs > config.status: creating packages/meld/Makefile > config.status: creating packages/xml/Makefile > config.status: creating packages/ProbLog/Makefile > config.status: creating swi/library/Makefile > config.status: creating swi/library/clp/Makefile > config.status: creating packages/chr/Makefile > config.status: creating packages/clib/Makefile > config.status: creating packages/clpqr/Makefile > config.status: creating packages/http/Makefile > config.status: creating packages/jpl/Makefile > config.status: creating packages/jpl/src/java/Makefile > config.status: creating packages/ltx2htm/Makefile > config.status: creating packages/ltx2htm/latex2html > config.status: creating packages/pldoc/Makefile > config.status: creating packages/pldoc/server/man_server.pl > config.status: creating packages/plunit/Makefile > config.status: creating packages/R/Makefile > config.status: creating packages/RDF/Makefile > config.status: creating packages/semweb/Makefile > config.status: creating packages/sgml/Makefile > config.status: creating packages/zlib/Makefile > config.status: creating packages/archive/Makefile > config.status: creating packages/odbc/Makefile > config.status: creating packages/swi-minisat2/Makefile > config.status: creating packages/swi-minisat2/C/Makefile > config.status: creating packages/myddas/Makefile > config.status: creating packages/CLPBN/Makefile > config.status: creating packages/CLPBN/horus/Makefile > config.status: creating packages/prism/src/c/Makefile > config.status: creating packages/prism/src/prolog/Makefile > config.status: creating packages/yap-lbfgs/Makefile > config.status: creating config.h > config.status: creating YapTermConfig.h > config.status: YapTermConfig.h is unchanged > config.status: creating packages/raptor/raptor_config.h > config.status: packages/raptor/raptor_config.h is unchanged > config.status: executing exe commands > configure: WARNING: unrecognized options: --enable-coroutining, > --enable-clpbn-bp > parallels@ubuntu:~/prologengines/yaptmp/yap-6.3/ARCH$ > > > > Le Lundi 3 mars 2014 0h54, Vitor Santos Costa <vs...@gm...> a écrit : > > Hi Sergio > > It seems to be using gpp instead of C++. Can you send me the output of > configure log? > > > Why do you need a different compiler than the default gcc? Also, > ubuntu shoud have gmp-dev by default, I think. > > I am finishing some work on win32, I wanted to look into jpl bugs next. > > Thanks! > > Vitor > > > > On Sun, Mar 2, 2014 at 11:46 PM, Sergio Castro <ser...@ya...> wrote: >> Hello, >> >> I am having problems installing the latest YAP development version (the >> one >> available here: git://git.code.sf.net/p/yap/yap-6.3) from sources in >> Ubuntu >> 13.04. >> >> Just in case, after many failed attempts I installed the last gcc version >> and configured it as the default compiler >> (according to the instructions I found here >> >> http://askubuntu.com/questions/271388/how-to-install-gcc-4-8-in-ubuntu-12-04-from-the-terminal): >> >> sudo add-apt-repository ppa:ubuntu-toolchain-r/test >> sudo apt-get update >> sudo apt-get install gcc-4.8 >> sudo update-alternatives --install /usr/bin/gcc gcc /usr/bin/gcc-4.8 50 >> >> >> Then I am executing this command: >> >> ../configure --prefix=/usr/local --with-java --enable-threads >> --enable-pthread-locking --enable-depth-limit --enable-coroutining >> --enable-clpbn-bp=no --enable-tabling --with-gmp=/usr/local && make && >> sudo >> make install >> >> >> The last lines of the output containing the error are shown below: >> >> >> ... >> ============== packages/swi-minisat2/C >> make[1]: Entering directory >> `/home/parallels/yaptmp/yap-6.3/ARCH/packages/swi-minisat2/C' >> gpp -c -shared -fPIC -O3 -fomit-frame-pointer -Wall -DHAVE_CONFIG_H >> -D_YAP_NOT_INSTALLED_=1 -I../../../../packages/swi-minisat2/C -I../../.. >> -I../../../../packages/swi-minisat2/C/../../../os >> -I../../../../packages/swi-minisat2/C/../../../include >> -I/usr/local/include -I/usr/local/include >> ../../../../packages/swi-minisat2/C/Solver.C -o Solver.o >> Usage : gpp [-{o|O} outfile] [-I/include/path] [-Dname=val ...] [-z] [-x] >> [-m] >> [-n] [-C | -T | -H | -X | -P | -U ... [-M ...]] [+c<n> str1 >> str2] >> [+s<n> str1 str2 c] [long options] [infile] >> >> default: #define x y macro(arg,...) >> -C : maximum cpp compatibility (includes -n, +c, +s, ...) >> -T : TeX-like \define{x}{y} \macro{arg}{...} >> -H : HTML-like <#define x|y> <#macro arg|...> >> -X : XHTML-like <#define x|y/> <#macro arg|.../> >> -P : prolog compatible cpp-like mode >> -U : user-defined syntax (specified in 9 following args; see manual) >> -M : user-defined syntax for meta-macros (specified in 7 following args) >> >> -o : output to outfile >> -O : output to outfile and stdout >> -z : line terminator is CR-LF (MS-DOS style) >> -x : enable #exec built-in macro >> -m : enable automatic mode switching upon including .h/.c files >> -n : send LF characters serving as macro terminators to output >> +c : use next 2 args as comment start and comment end sequences >> +s : use next 3 args as string start, end and quote character >> >> Long options: >> --include file : process file before infile >> --nostdinc : don't search standard directories for files to include >> --nocurinc : don't search the current directory for files to include >> --curdirinclast : search the current directory last >> --warninglevel n : set warning level >> --includemarker formatstring : keep track of #include directives in >> output >> >> --version : display version information and exit >> -h, --help : display this message and exit >> >> make[1]: *** [Solver.o] Error 1 >> make[1]: Leaving directory >> `/home/parallels/yaptmp/yap-6.3/ARCH/packages/swi-minisat2/C' >> make: *** [all] Error 1 >> --- >> >> >> Thanks for any help, >> >> Sergio > > |
|
From: Vitor S. C. <vs...@gm...> - 2014-03-02 23:54:54
|
Hi Sergio It seems to be using gpp instead of C++. Can you send me the output of configure log? Why do you need a different compiler than the default gcc? Also, ubuntu shoud have gmp-dev by default, I think. I am finishing some work on win32, I wanted to look into jpl bugs next. Thanks! Vitor On Sun, Mar 2, 2014 at 11:46 PM, Sergio Castro <ser...@ya...> wrote: > Hello, > > I am having problems installing the latest YAP development version (the one > available here: git://git.code.sf.net/p/yap/yap-6.3) from sources in Ubuntu > 13.04. > > Just in case, after many failed attempts I installed the last gcc version > and configured it as the default compiler > (according to the instructions I found here > http://askubuntu.com/questions/271388/how-to-install-gcc-4-8-in-ubuntu-12-04-from-the-terminal): > > sudo add-apt-repository ppa:ubuntu-toolchain-r/test > sudo apt-get update > sudo apt-get install gcc-4.8 > sudo update-alternatives --install /usr/bin/gcc gcc /usr/bin/gcc-4.8 50 > > > Then I am executing this command: > > ../configure --prefix=/usr/local --with-java --enable-threads > --enable-pthread-locking --enable-depth-limit --enable-coroutining > --enable-clpbn-bp=no --enable-tabling --with-gmp=/usr/local && make && sudo > make install > > > The last lines of the output containing the error are shown below: > > > ... > ============== packages/swi-minisat2/C > make[1]: Entering directory > `/home/parallels/yaptmp/yap-6.3/ARCH/packages/swi-minisat2/C' > gpp -c -shared -fPIC -O3 -fomit-frame-pointer -Wall -DHAVE_CONFIG_H > -D_YAP_NOT_INSTALLED_=1 -I../../../../packages/swi-minisat2/C -I../../.. > -I../../../../packages/swi-minisat2/C/../../../os > -I../../../../packages/swi-minisat2/C/../../../include > -I/usr/local/include -I/usr/local/include > ../../../../packages/swi-minisat2/C/Solver.C -o Solver.o > Usage : gpp [-{o|O} outfile] [-I/include/path] [-Dname=val ...] [-z] [-x] > [-m] > [-n] [-C | -T | -H | -X | -P | -U ... [-M ...]] [+c<n> str1 > str2] > [+s<n> str1 str2 c] [long options] [infile] > > default: #define x y macro(arg,...) > -C : maximum cpp compatibility (includes -n, +c, +s, ...) > -T : TeX-like \define{x}{y} \macro{arg}{...} > -H : HTML-like <#define x|y> <#macro arg|...> > -X : XHTML-like <#define x|y/> <#macro arg|.../> > -P : prolog compatible cpp-like mode > -U : user-defined syntax (specified in 9 following args; see manual) > -M : user-defined syntax for meta-macros (specified in 7 following args) > > -o : output to outfile > -O : output to outfile and stdout > -z : line terminator is CR-LF (MS-DOS style) > -x : enable #exec built-in macro > -m : enable automatic mode switching upon including .h/.c files > -n : send LF characters serving as macro terminators to output > +c : use next 2 args as comment start and comment end sequences > +s : use next 3 args as string start, end and quote character > > Long options: > --include file : process file before infile > --nostdinc : don't search standard directories for files to include > --nocurinc : don't search the current directory for files to include > --curdirinclast : search the current directory last > --warninglevel n : set warning level > --includemarker formatstring : keep track of #include directives in output > > --version : display version information and exit > -h, --help : display this message and exit > > make[1]: *** [Solver.o] Error 1 > make[1]: Leaving directory > `/home/parallels/yaptmp/yap-6.3/ARCH/packages/swi-minisat2/C' > make: *** [all] Error 1 > --- > > > Thanks for any help, > > Sergio |
|
From: Sergio C. <ser...@ya...> - 2014-03-02 23:46:42
|
Hello, I am having problems installing the latest YAP development version (the one available here: git://git.code.sf.net/p/yap/yap-6.3) from sources in Ubuntu 13.04. Just in case, after many failed attempts I installed the last gcc version and configured it as the default compiler (according to the instructions I found here http://askubuntu.com/questions/271388/how-to-install-gcc-4-8-in-ubuntu-12-04-from-the-terminal): sudo add-apt-repository ppa:ubuntu-toolchain-r/test sudo apt-get update sudo apt-get install gcc-4.8 sudo update-alternatives --install /usr/bin/gcc gcc /usr/bin/gcc-4.8 50 Then I am executing this command: ../configure --prefix=/usr/local --with-java --enable-threads --enable-pthread-locking --enable-depth-limit --enable-coroutining --enable-clpbn-bp=no --enable-tabling --with-gmp=/usr/local && make && sudo make install The last lines of the output containing the error are shown below: ... ============== packages/swi-minisat2/C make[1]: Entering directory `/home/parallels/yaptmp/yap-6.3/ARCH/packages/swi-minisat2/C' gpp -c -shared -fPIC -O3 -fomit-frame-pointer -Wall -DHAVE_CONFIG_H -D_YAP_NOT_INSTALLED_=1 -I../../../../packages/swi-minisat2/C -I../../.. -I../../../../packages/swi-minisat2/C/../../../os -I../../../../packages/swi-minisat2/C/../../../include -I/usr/local/include -I/usr/local/include ../../../../packages/swi-minisat2/C/Solver.C -o Solver.o Usage : gpp [-{o|O} outfile] [-I/include/path] [-Dname=val ...] [-z] [-x] [-m] [-n] [-C | -T | -H | -X | -P | -U ... [-M ...]] [+c<n> str1 str2] [+s<n> str1 str2 c] [long options] [infile] default: #define x y macro(arg,...) -C : maximum cpp compatibility (includes -n, +c, +s, ...) -T : TeX-like \define{x}{y} \macro{arg}{...} -H : HTML-like <#define x|y> <#macro arg|...> -X : XHTML-like <#define x|y/> <#macro arg|.../> -P : prolog compatible cpp-like mode -U : user-defined syntax (specified in 9 following args; see manual) -M : user-defined syntax for meta-macros (specified in 7 following args) -o : output to outfile -O : output to outfile and stdout -z : line terminator is CR-LF (MS-DOS style) -x : enable #exec built-in macro -m : enable automatic mode switching upon including .h/.c files -n : send LF characters serving as macro terminators to output +c : use next 2 args as comment start and comment end sequences +s : use next 3 args as string start, end and quote character Long options: --include file : process file before infile --nostdinc : don't search standard directories for files to include --nocurinc : don't search the current directory for files to include --curdirinclast : search the current directory last --warninglevel n : set warning level --includemarker formatstring : keep track of #include directives in output --version : display version information and exit -h, --help : display this message and exit make[1]: *** [Solver.o] Error 1 make[1]: Leaving directory `/home/parallels/yaptmp/yap-6.3/ARCH/packages/swi-minisat2/C' make: *** [all] Error 1 --- Thanks for any help, Sergio |
|
From: Sergio C. <ser...@ya...> - 2014-03-02 13:31:04
|
Hello Vitor,
I have just upgraded to Maverick so I recompiled the latest YAP development version (6.3.4) with:
CC=gcc-mp-4.8 CXX=g++-mp-4.8 ../configure --prefix=/opt/local --with-java --enable-threads --enable-pthread-locking --enable-depth-limit --enable-coroutining --enable-clpbn-bp=no --enable-tabling --with-gmp=/opt/local && make && sudo make install
JPL seems to be broken in this version, I tried with the following simple test:
import jpl.JPL;
import jpl.Query;
public class HelloWorld {
publicstaticString yapJplPath= "/opt/local/lib/Yap";
publicstaticString swiJplPath= "/opt/local/lib/swipl/lib/x86_64-darwin13.1.0";
publicstaticvoidsetup() {
JPL.setNativeLibraryDir(yapJplPath);
//JPL.setNativeLibraryDir(swiJplPath);
}
public static void main(String[] args) {
setup();
new Query("writeln('hello_world')").oneSolution();
new Query("flush_output").oneSolution();
System.out.println("Done!");
}
}
That works fine in SWI but in YAP it freezes in the first query :(
Thanks in advance for your help!
Sergio |
|
From: Giuseppe L. <g.l...@gm...> - 2014-02-17 09:45:18
|
Hi, i have a segmentation fault error on my YAP 6.2.2. It's run on Linux 32bit system and when i can execute Yap with trace option, Yap show me into the console this error stack: % % % YAP OOOPS: tried to access illegal address 0xc05ee320!!!!. % % 59567KB of Code Space (0x10000000--0x13a2bdb0) % % PC: prolog:$portray/1 at clause 1 % Continuation: meta-call % 15343KB of Global Stack (0x143aa000--0x152a5c8c) % 4KB of Local Stack (0x15335f04--0x15337000) % 0KB of Trail (0x15337004--0x153371b0) % Performed 41678 garbage collections % All Active Calls and % Goals With Alternatives Open (Global In Use--Local In Use) % % meta-call % meta-call % prolog:write_term/3 at clause 1 % prolog:$trace/5 at clause 1 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (525KB--3KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (524KB--3KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (524KB--3KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (524KB--3KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (523KB--2KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (523KB--2KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (523KB--2KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (523KB--1KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (523KB--1KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (523KB--1KB) % prolog:$system_catch/4 at clause 1 % user:process_folds/2 at clause 2 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (523KB--0KB) % prolog:$system_catch/4 at clause 1 % user:my_knn/0 at clause 1 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (516KB--0KB) % prolog:$system_catch/4 at clause 1 % prolog:$loop_spy2/5 at clause 1 % prolog:$catch/3 (512KB--0KB) % prolog:$system_catch/4 at clause 1 % prolog:$do_yes_no/2 at clause 2 % prolog:$yes_no/2 at clause 1 % prolog:$command/4 at clause 2 % prolog:$enter_top_level/0 at clause 5 % prolog:$catch/3 (512KB--0KB) % prolog:$system_catch/4 at clause 1 % meta-call Exiting .... Someone can help me, Please?? Thanks a lot. Giuseppe |
|
From: Marco M. <ma...@di...> - 2014-02-04 14:17:07
|
[Apologize for multiple posting.]
===============================================================================
CALL FOR PAPERS
ASPOCP 2014
7th Workshop on Answer Set Programming and Other Computing Paradigms
https://sites.google.com/site/aspocp14
July 23rd, 2014
Affiliated with the International Conference on Logic Programming
(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
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.
LOCATION
The workshop will be held in Vienna, Austria, collocated with
the International Conference on Logic Programming (ICLP) 2014.
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
|
|
From: Tom S. <tom...@ug...> - 2014-02-01 13:48:07
|
CALL FOR PAPERS
EXTENDED DEADLINE
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
CONFERENCE SCOPE
Since the first conference held in Marseilles in 1982, ICLP has been
the premier international conference for presenting research in logic
programming. Contributions are sought in all areas of logic
programming including but not restricted to:
Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning,
Knowledge Representation.
Implementation: Compilation, Virtual Machines, Parallelism.
Environments: Program Analysis, Transformation, Validation,
Verification, Debugging, Profiling, Testing.
Language Issues: Concurrency, Objects, Coordination, Mobility, Higher
Order, Types, Modes, Assertions, Programming Techniques.
Related Paradigms: Inductive and Coinductive Logic Programming, Constraint
Logic Programming, Answer-Set Programming, SAT-Checking
Applications: Databases, Data Integration and Federation, Software
Engineering, Natural Language Processing, Web and Semantic Web,
Agents, Artificial Intelligence, Bioinformatics.
In addition to the presentations of accepted papers, the technical
program will include invited talks, advanced tutorials, the doctoral
consortium, and several workshops.
SUBMISSION DETAILS
The four broad categories for submissions are as follows. Regular
papers, including: (1) technical papers for describing technically
sound, innovative ideas that can advance the state of logic
programming; (2) application papers, where the emphasis will be on
their impact on the application domain; (3) system and tool papers,
where the emphasis will be on the novelty, practicality, usability and
availability of the systems and tools described. Technical commu-
nications (4) aimed at describing recent developments, new projects,
and other materials that are not ready for publication as standard
papers. All papers and technical communications will be presented
during the conference.
All submissions must describe original, previously unpublished
research, and must not simultaneously be submitted for publication
elsewhere. They must be written in English. Technical papers,
application papers, and system and tool papers must not exceed 12
pages plus bibliography: however a new condensed TPLP format may be
used and the papers may include appendices beyond 12 pages. The limit
for technical communications is 10 pages. Submissions must be made in
the condensed TPLP format via the Easychair submission system, available at
http://www.easychair.org/conferences/?conf=iclp2014
IMPORTANT DATES
Paper registration (abstract): *February 7, 2014*
Submission deadline: *February 14, 2014*
Notification to authors: March 18, 2014
Revision deadline (when needed): April 18, 2014
Camera-ready copy due: May 15, 2014
Conference: July 19-22, 2014
PAPER PUBLICATION
All accepted papers will be published in the journal Theory and
Practice of Logic Programming (TPLP), Cambridge University Press
(CUP), in one or more special issues. In order to ensure the quality
of the final version, papers may be subject to more than one round of
refereeing (within the decision period). Accepted technical
communications will be published in the on-line abstract of the
special issue(s). The program committee may also recommend standard
papers to be published as technical communications.
At the time of the conference CUP will make the web page for this(ese)
TPLP issue(s) available including volume and issue numbers, table of
contents, page numbers, and the papers themselves. All registered
attendants at the conference will get a password for on-line access to
this web page during the conference and indefinitely from then on
("lifetime access"), which can be used to read papers on line,
download them, or print them for personal use. Attendants will also
receive all the papers in a memory stick at the conference.
ICLP 2014 ORGANIZATION
General Chair:
Manuel Carro Technical University of Madrid
Program Co-chairs:
Michael Leuschel University of Düsseldorf
Tom Schrijvers Ghent University
Workshop Chair:
Haifeng Guo University of Nebraska at Omaha
Doctoral Consortium:
Martin Gebser University of Potsdam
Jael Kriener Kent University
PROGRAM COMMITTEE
Elvira Albert Complutense University of Madrid
Sergio Antoy Portland State University
Marcello Balduccini Drexel University
Francois Bry University of Munich
Mats Carlsson SICS
Iliano Cervesato Carnegie Mellon University - Qatar Campus
Kaustuv Chaudhuri INRIA
Michael Codish Ben-Gurion University
Danny De Schreye KU Leuven
Marc Denecker KU Leuven
Esra Erdem Sabanci University
Samir Genaim Universidad Complutense de Madrid
Gopal Gupta University of Texas at Dallas
Michael Hanus CAU Kiel
Remy Haemmerle Universidad Politecnica de Madrid
Ethan Jackson Microsoft
Gerda Janssen KU Leuven
Michael Kifer State University of New York at Stony Brook
Andy King University of Kent
Guenter Kniesel University of Bonn
Yanhong Annie Liu State University of New York at Stony Brook
Michael Maher University of New South Wales
Rainer Manthey University of Bonn
Fred Mesnard Universite de la Reunion
Jose Morales IMDEA Software Research Institute
Alberto Pettorossi Universita di Roma Tor Vergata
Gianfranco Rossi Universita di Parma
Vitor Santos Costa Universidade do Porto
Peter Schachte University of Melbourne
Torsten Schaub University of Potsdam
Hirohisa Seki Nagoya Institute of Technology
Peter Stuckey University of Melbourne
Paul Tarau University of North Texas
Michael Thielscher University of New South Wales
Hans Tompits Vienna University of Technology
Francesca Toni Imperial College London
German Vidal Universitat Politecnica de Valencia
Jan Wielemaker University of Amsterdam
Stefan Woltran Vienna University of Technology
Neng-Fa Zhou City University of New York
SPONSOR
The conference is sponsored by the Association for Logic Programming
(ALP).
FINANCIAL ASSISTANCE
The Association for Logic Programming has funds to assist financially
disadvantaged participants and, specially, students in order to be
able to attend the conference.
WORKSHOPS
The ICLP 2014 program will include several workshops, held before and
after the main conference. They are perhaps the best places for the
presentation of preliminary work, undeveloped novel ideas, and new
open problems to a wide and interested audience with opportunities for
intensive discussions and project collaboration.
DOCTORAL CONSORTIUM
The 9th Doctoral Consortium (DC) on Logic Programming provides
research students with the opportunity to present and discuss their
research directions, and to obtain feedback from both peers and
world-renown experts in the field. Accepted participants will receive
partial financial support to attend the event and the main conference.
The best paper and presentation from the DC will be given the
opportunity to present in a special session of the main ICLP
conference.
CONFERENCE VENUE
The venue will be the Vienna University of Technology (TU Wien).
Vienna University of Technology 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.
|
|
From: Ahmad H. <ahm...@ya...> - 2014-01-26 16:50:38
|
hi, I want to try to port YAP to iPhone for commercial use. I'm not sure of your license allow this. can you please advice? Regards, Ahmad Hawwash |
|
From: He-chien T. <dep...@gm...> - 2014-01-25 06:59:22
|
I saw configure options include --enable-condor, but I can't find the usage in the manual. How to apply condor for yap? |
|
From: Vitor S. C. <vs...@dc...> - 2014-01-24 12:45:24
|
Dear Ahmad I think the license allows for that. I definitely am very happy that you are planning to do that :) Vitor On 01/23/2014 04:49 PM, Ahmad Hawwash wrote: > hi, > I want to try to port YAP to iPhone for commercial use. > I'm not sure of your license allow this. > can you please advice? > > Regards, > Ahmad Hawwash > > > > ------------------------------------------------------------------------------ > CenturyLink Cloud: The Leader in Enterprise Cloud Services. > Learn Why More Businesses Are Choosing CenturyLink Cloud For > Critical Workloads, Development Environments & Everything In Between. > Get a Quote or Start a Free Trial Today. > http://pubads.g.doubleclick.net/gampad/clk?id=119420431&iu=/4140/ostg.clktrk > > > _______________________________________________ > Yap-users mailing list > Yap...@li... > https://lists.sourceforge.net/lists/listinfo/yap-users |
|
From: Ahmad H. <ahm...@ya...> - 2014-01-23 16:49:09
|
hi, I want to try to port YAP to iPhone for commercial use. I'm not sure of your license allow this. can you please advice? Regards, Ahmad Hawwash |
|
From: Remy H. <re...@cl...> - 2014-01-16 12:33:20
|
Apologies for multiple copies.
Please forward to interested colleagues.
=========================================================================
Call for Papers
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 : March 31, 2014
Notification : April 28, 2014
Camera-ready : May 19, 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/
|
|
From: Nicos A. <nic...@st...> - 2014-01-15 23:52:03
|
PLP: Probabilistic Logic Programming
------------------------------------
A workshop of the 2014 International Conference on Logic Programming
17th July 2014
Vienna, Austria
http://stoics.org.uk/plp
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
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. Depending on the depth and breadth of submissions we hope to approach
relevant journals for a special issue based on extended versions of original
papers (AMAI Journal, TPLP).
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)
|
|
From: Nikos K. <nk...@ii...> - 2013-12-19 20:36:38
|
Hello all, Unfortunately, I have to test a ProbLog application on Windows (this was not my choice). So I downloaded the windows installer (with tabling enabled) from the YAP web site and installed YAP. The problem is that when I run the application I get WARNING: Can't find file: problogbdd, please place file in Problog path: "path to 'share' folder of my YAP installation" and the application hangs. A second issue I have with this installation is with JPL: Although I can see the libjpl.dll in the bin folder of the installation and I correctly set the java library path (via a VM argument in eclipse) to point to this folder, I get an "unsatisfied link-no jpl in library path" error. Has anyone experienced similar problems on Windows? The test machine runs 32-bit Windows 7 Thank you for your time Nikos |
|
From: Vitor S. C. <vs...@gm...> - 2013-11-22 10:47:42
|
It's weird, what happens when you write Point*10?
On Thu, Nov 21, 2013 at 11:18 PM, Paulo Moura <pm...@lo...> wrote:
>
> On 21/11/2013, at 22:56, Paulo Moura <pm...@lo...> wrote:
>
>>
>> On 21/11/2013, at 22:54, Vitor Santos Costa <vs...@dc...> wrote:
>>
>>>
>>> On 21 Nov 2013, at 22:34, Paulo Moura <pm...@lo...> wrote:
>>>
>>>>
>>>> On 21/11/2013, at 22:13, Vitor Santos Costa <vs...@dc...> wrote:
>>>>
>>>>> Thanks Paulo
>>>>>
>>>>> It should be fixed now.
>>>>
>>>> I just compiled it successfully using clang.
>>>>
>>>>> One major change in the latest YAP is in slot or handle allocation (term_t handles in SWI). The allocation has been moved out from the emulator to the functions that call user-code, which makes things much simpler. The other advantage is that the abstract machine doesn’t have to know what those things are.
>>>>>
>>>>> The bug was caused by forgetting to release slots at the end of a call.
>>>>
>>>> But now floats are broken. For example:
>>>>
>>>> $ yap
>>>> YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 22:10:36 WET
>>>> ?- [user].
>>>> % consulting user_input...
>>>> | circle('#1', 1.23, blue).
>>>> | circle('#2', 3.71, yellow).
>>>> | circle('#3', 0.39, green).
>>>> | circle('#4', 5.74, black).
>>>> | circle('#5', 8.32, cyan).
>>>> | % consulted user_input in module user, 1 msec 0 bytes
>>>> true.
>>>> ?- listing(circle/3).
>>>> circle('#1',1.0,blue).
>>>> circle('#2',3.0,yellow).
>>>> circle('#3',0.0,green).
>>>> circle('#4',5.0,black).
>>>> circle('#5',8.0,cyan).
>>>> true.
>>>>
>>>
>>> That’s weird, I get.Do you preload anything, it looks like a possible flag problem.
>>
>> No (as you can see above). Maybe related to using the MacOS X default C compiler?
>
> Not related to clang. Compiling with gcc 4.7 gives the same results.
>
>>> ?- [user].
>>> % consulting user_input...
>>> | circle('#1', 1.23, blue).
>>> | circle('#2', 3.71, yellow).
>>> | circle('#3', 0.39, green).
>>> | circle('#4', 5.74, black).
>>> | circle('#5', 8.32, cyan).
>>> | % consulted user_input in module user, 1 msec 0 bytes
>>> true.
>>> ?- listing(circle).
>>> circle('#1',1.23,blue).
>>> circle('#2',3.71,yellow).
>>> circle('#3',0.39,green).
>>> circle('#4',5.74,black).
>>> circle('#5',8.32,cyan).
>>> true.
>>>
>>>> Also, variables such as _Year now are being reported as singletons. Not a bug per se but a change of behavior. Let me know if by accident or intentional.
>>>>
>>>
>>> That was a bug, I just sent a patch. Right now this is in read_term, but I’ll change th style checker to use this new code.
>>
>> I will recompile and retest.
>
> No more false singletons :-) Cheers,
>
> Paulo
>
>
> -----------------------------------------------------------------
> Paulo Moura
> Logtalk developer
>
> Email: <mailto:pm...@lo...>
> Web: <http://logtalk.org/>
> -----------------------------------------------------------------
>
>
>
>
>
> ------------------------------------------------------------------------------
> Shape the Mobile Experience: Free Subscription
> Software experts and developers: Be at the forefront of tech innovation.
> Intel(R) Software Adrenaline delivers strategic insight and game-changing
> conversations that shape the rapidly evolving mobile landscape. Sign up now.
> http://pubads.g.doubleclick.net/gampad/clk?id=63431311&iu=/4140/ostg.clktrk
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
|
|
From: Jean-Noel V. <jea...@un...> - 2013-11-21 23:43:23
|
> Le 21 nov. 2013 à 23:14, Vitor Santos Costa <vs...@dc...> a écrit : > > >> On 21 Nov 2013, at 17:42, Jean-Noël Vittaut <jea...@un...> wrote: >> >> Hi Vitor, >> >> thanks for your answer. I tried it and it seems to solve the problem on Lion. But I might switch back to system malloc because I just found out that using dlmalloc is not compatible with launching several Yap instances in my version of the Yap Library. It's a pity, it was definitely faster with dlmalloc for the kind of tasks I give to Yap. > > Is it a thread problem? > > Vitor Actually, I've ported the Yap library into a one class C++ library so I can use several instances of it and even launch them in threads. It fulfil my needs more than using the threads inside just one C original Yap library. But I experienced the same problem with the original library, so I asked. Jean-Noël |
|
From: Paulo M. <pm...@lo...> - 2013-11-21 23:33:20
|
On 21/11/2013, at 23:18, Paulo Moura <pm...@lo...> wrote:
>
> On 21/11/2013, at 22:56, Paulo Moura <pm...@lo...> wrote:
>
>>
>> On 21/11/2013, at 22:54, Vitor Santos Costa <vs...@dc...> wrote:
>>
>>>
>>> On 21 Nov 2013, at 22:34, Paulo Moura <pm...@lo...> wrote:
>>>
>>>>
>>>> On 21/11/2013, at 22:13, Vitor Santos Costa <vs...@dc...> wrote:
>>>>
>>>>> Thanks Paulo
>>>>>
>>>>> It should be fixed now.
>>>>
>>>> I just compiled it successfully using clang.
>>>>
>>>>> One major change in the latest YAP is in slot or handle allocation (term_t handles in SWI). The allocation has been moved out from the emulator to the functions that call user-code, which makes things much simpler. The other advantage is that the abstract machine doesn’t have to know what those things are.
>>>>>
>>>>> The bug was caused by forgetting to release slots at the end of a call.
>>>>
>>>> But now floats are broken. For example:
>>>>
>>>> $ yap
>>>> YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 22:10:36 WET
>>>> ?- [user].
>>>> % consulting user_input...
>>>> | circle('#1', 1.23, blue).
>>>> | circle('#2', 3.71, yellow).
>>>> | circle('#3', 0.39, green).
>>>> | circle('#4', 5.74, black).
>>>> | circle('#5', 8.32, cyan).
>>>> | % consulted user_input in module user, 1 msec 0 bytes
>>>> true.
>>>> ?- listing(circle/3).
>>>> circle('#1',1.0,blue).
>>>> circle('#2',3.0,yellow).
>>>> circle('#3',0.0,green).
>>>> circle('#4',5.0,black).
>>>> circle('#5',8.0,cyan).
>>>> true.
>>>>
>>>
>>> That’s weird, I get.Do you preload anything, it looks like a possible flag problem.
>>
>> No (as you can see above). Maybe related to using the MacOS X default C compiler?
>
> Not related to clang. Compiling with gcc 4.7 gives the same results.
The bug seems to be in the term reader:
$ yap
YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 23:12:26 WET
?- read(T).
|:1.37.
T = 1.0.
Cheers,
Paulo
-----------------------------------------------------------------
Paulo Moura
Logtalk developer
Email: <mailto:pm...@lo...>
Web: <http://logtalk.org/>
-----------------------------------------------------------------
|
|
From: Paulo M. <pm...@lo...> - 2013-11-21 23:18:16
|
On 21/11/2013, at 22:56, Paulo Moura <pm...@lo...> wrote:
>
> On 21/11/2013, at 22:54, Vitor Santos Costa <vs...@dc...> wrote:
>
>>
>> On 21 Nov 2013, at 22:34, Paulo Moura <pm...@lo...> wrote:
>>
>>>
>>> On 21/11/2013, at 22:13, Vitor Santos Costa <vs...@dc...> wrote:
>>>
>>>> Thanks Paulo
>>>>
>>>> It should be fixed now.
>>>
>>> I just compiled it successfully using clang.
>>>
>>>> One major change in the latest YAP is in slot or handle allocation (term_t handles in SWI). The allocation has been moved out from the emulator to the functions that call user-code, which makes things much simpler. The other advantage is that the abstract machine doesn’t have to know what those things are.
>>>>
>>>> The bug was caused by forgetting to release slots at the end of a call.
>>>
>>> But now floats are broken. For example:
>>>
>>> $ yap
>>> YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 22:10:36 WET
>>> ?- [user].
>>> % consulting user_input...
>>> | circle('#1', 1.23, blue).
>>> | circle('#2', 3.71, yellow).
>>> | circle('#3', 0.39, green).
>>> | circle('#4', 5.74, black).
>>> | circle('#5', 8.32, cyan).
>>> | % consulted user_input in module user, 1 msec 0 bytes
>>> true.
>>> ?- listing(circle/3).
>>> circle('#1',1.0,blue).
>>> circle('#2',3.0,yellow).
>>> circle('#3',0.0,green).
>>> circle('#4',5.0,black).
>>> circle('#5',8.0,cyan).
>>> true.
>>>
>>
>> That’s weird, I get.Do you preload anything, it looks like a possible flag problem.
>
> No (as you can see above). Maybe related to using the MacOS X default C compiler?
Not related to clang. Compiling with gcc 4.7 gives the same results.
>> ?- [user].
>> % consulting user_input...
>> | circle('#1', 1.23, blue).
>> | circle('#2', 3.71, yellow).
>> | circle('#3', 0.39, green).
>> | circle('#4', 5.74, black).
>> | circle('#5', 8.32, cyan).
>> | % consulted user_input in module user, 1 msec 0 bytes
>> true.
>> ?- listing(circle).
>> circle('#1',1.23,blue).
>> circle('#2',3.71,yellow).
>> circle('#3',0.39,green).
>> circle('#4',5.74,black).
>> circle('#5',8.32,cyan).
>> true.
>>
>>> Also, variables such as _Year now are being reported as singletons. Not a bug per se but a change of behavior. Let me know if by accident or intentional.
>>>
>>
>> That was a bug, I just sent a patch. Right now this is in read_term, but I’ll change th style checker to use this new code.
>
> I will recompile and retest.
No more false singletons :-) Cheers,
Paulo
-----------------------------------------------------------------
Paulo Moura
Logtalk developer
Email: <mailto:pm...@lo...>
Web: <http://logtalk.org/>
-----------------------------------------------------------------
|
|
From: Paulo M. <pm...@lo...> - 2013-11-21 22:57:00
|
On 21/11/2013, at 22:54, Vitor Santos Costa <vs...@dc...> wrote:
>
> On 21 Nov 2013, at 22:34, Paulo Moura <pm...@lo...> wrote:
>
>>
>> On 21/11/2013, at 22:13, Vitor Santos Costa <vs...@dc...> wrote:
>>
>>> Thanks Paulo
>>>
>>> It should be fixed now.
>>
>> I just compiled it successfully using clang.
>>
>>> One major change in the latest YAP is in slot or handle allocation (term_t handles in SWI). The allocation has been moved out from the emulator to the functions that call user-code, which makes things much simpler. The other advantage is that the abstract machine doesn’t have to know what those things are.
>>>
>>> The bug was caused by forgetting to release slots at the end of a call.
>>
>> But now floats are broken. For example:
>>
>> $ yap
>> YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 22:10:36 WET
>> ?- [user].
>> % consulting user_input...
>> | circle('#1', 1.23, blue).
>> | circle('#2', 3.71, yellow).
>> | circle('#3', 0.39, green).
>> | circle('#4', 5.74, black).
>> | circle('#5', 8.32, cyan).
>> | % consulted user_input in module user, 1 msec 0 bytes
>> true.
>> ?- listing(circle/3).
>> circle('#1',1.0,blue).
>> circle('#2',3.0,yellow).
>> circle('#3',0.0,green).
>> circle('#4',5.0,black).
>> circle('#5',8.0,cyan).
>> true.
>>
>
> That’s weird, I get.Do you preload anything, it looks like a possible flag problem.
No (as you can see above). Maybe related to using the MacOS X default C compiler?
> ?- [user].
> % consulting user_input...
> | circle('#1', 1.23, blue).
> | circle('#2', 3.71, yellow).
> | circle('#3', 0.39, green).
> | circle('#4', 5.74, black).
> | circle('#5', 8.32, cyan).
> | % consulted user_input in module user, 1 msec 0 bytes
> true.
> ?- listing(circle).
> circle('#1',1.23,blue).
> circle('#2',3.71,yellow).
> circle('#3',0.39,green).
> circle('#4',5.74,black).
> circle('#5',8.32,cyan).
> true.
>
>> Also, variables such as _Year now are being reported as singletons. Not a bug per se but a change of behavior. Let me know if by accident or intentional.
>>
>
> That was a bug, I just sent a patch. Right now this is in read_term, but I’ll change th style checker to use this new code.
I will recompile and retest.
Cheers,
Paulo
-----------------------------------------------------------------
Paulo Moura
Logtalk developer
Email: <mailto:pm...@lo...>
Web: <http://logtalk.org/>
-----------------------------------------------------------------
|
|
From: Vitor S. C. <vs...@dc...> - 2013-11-21 22:54:13
|
On 21 Nov 2013, at 22:34, Paulo Moura <pm...@lo...> wrote:
>
> On 21/11/2013, at 22:13, Vitor Santos Costa <vs...@dc...> wrote:
>
>> Thanks Paulo
>>
>> It should be fixed now.
>
> I just compiled it successfully using clang.
>
>> One major change in the latest YAP is in slot or handle allocation (term_t handles in SWI). The allocation has been moved out from the emulator to the functions that call user-code, which makes things much simpler. The other advantage is that the abstract machine doesn’t have to know what those things are.
>>
>> The bug was caused by forgetting to release slots at the end of a call.
>
> But now floats are broken. For example:
>
> $ yap
> YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 22:10:36 WET
> ?- [user].
> % consulting user_input...
> | circle('#1', 1.23, blue).
> | circle('#2', 3.71, yellow).
> | circle('#3', 0.39, green).
> | circle('#4', 5.74, black).
> | circle('#5', 8.32, cyan).
> | % consulted user_input in module user, 1 msec 0 bytes
> true.
> ?- listing(circle/3).
> circle('#1',1.0,blue).
> circle('#2',3.0,yellow).
> circle('#3',0.0,green).
> circle('#4',5.0,black).
> circle('#5',8.0,cyan).
> true.
>
That’s weird, I get.Do you preload anything, it looks like a possible flag problem.
?- [user].
% consulting user_input...
| circle('#1', 1.23, blue).
| circle('#2', 3.71, yellow).
| circle('#3', 0.39, green).
| circle('#4', 5.74, black).
| circle('#5', 8.32, cyan).
| % consulted user_input in module user, 1 msec 0 bytes
true.
?- listing(circle).
circle('#1',1.23,blue).
circle('#2',3.71,yellow).
circle('#3',0.39,green).
circle('#4',5.74,black).
circle('#5',8.32,cyan).
true.
> Also, variables such as _Year now are being reported as singletons. Not a bug per se but a change of behavior. Let me know if by accident or intentional.
>
That was a bug, I just sent a patch. Right now this is in read_term, but I’ll change th style checker to use this new code.
Thanks!
Vitor
> Cheers,
>
> Paulo
>
>> On 21 Nov 2013, at 15:43, Paulo Moura <pm...@lo...> wrote:
>>
>>>
>>> On 21/11/2013, at 14:14, Paulo Moura <pm...@lo...> wrote:
>>>
>>>>
>>>> On 21/11/2013, at 11:48, Vitor Santos Costa <vs...@gm...> wrote:
>>>>
>>>>> Hi Jean-Noel
>>>>>
>>>>> Give it a try.
>>>>>
>>>>> It may have been because weirdness of mmap in Snow Leopard. mmap would
>>>>> claim to have allocated memory as requested, but then would crash when
>>>>> trying to access it. Paulo, do you remember that?
>>>>
>>>> Vaguely. Too long ago :-)
>>>>
>>>>> 6.3 does not use dlmalloc because of fragmentation trouble for longer runs.
>>>>
>>>> Btw, the latest git verison builds fine on MacOS 10.9.
>>>
>>> But it bombs on startup :(
>>>
>>> $ yaplgt
>>>
>>> YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 12:11:42 WET
>>> -4551853894178701049
>>> Segmentation fault: 11
>>>
>>> Cheers,
>>>
>>> Paulo
>
> -----------------------------------------------------------------
> Paulo Moura
> Logtalk developer
>
> Email: <mailto:pm...@lo...>
> Web: <http://logtalk.org/>
> -----------------------------------------------------------------
>
>
>
>
>
> ------------------------------------------------------------------------------
> Shape the Mobile Experience: Free Subscription
> Software experts and developers: Be at the forefront of tech innovation.
> Intel(R) Software Adrenaline delivers strategic insight and game-changing
> conversations that shape the rapidly evolving mobile landscape. Sign up now.
> http://pubads.g.doubleclick.net/gampad/clk?id=63431311&iu=/4140/ostg.clktrk
> _______________________________________________
> Yap-users mailing list
> Yap...@li...
> https://lists.sourceforge.net/lists/listinfo/yap-users
|
|
From: Paulo M. <pm...@lo...> - 2013-11-21 22:34:44
|
On 21/11/2013, at 22:13, Vitor Santos Costa <vs...@dc...> wrote:
> Thanks Paulo
>
> It should be fixed now.
I just compiled it successfully using clang.
> One major change in the latest YAP is in slot or handle allocation (term_t handles in SWI). The allocation has been moved out from the emulator to the functions that call user-code, which makes things much simpler. The other advantage is that the abstract machine doesn’t have to know what those things are.
>
> The bug was caused by forgetting to release slots at the end of a call.
But now floats are broken. For example:
$ yap
YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 22:10:36 WET
?- [user].
% consulting user_input...
| circle('#1', 1.23, blue).
| circle('#2', 3.71, yellow).
| circle('#3', 0.39, green).
| circle('#4', 5.74, black).
| circle('#5', 8.32, cyan).
| % consulted user_input in module user, 1 msec 0 bytes
true.
?- listing(circle/3).
circle('#1',1.0,blue).
circle('#2',3.0,yellow).
circle('#3',0.0,green).
circle('#4',5.0,black).
circle('#5',8.0,cyan).
true.
Also, variables such as _Year now are being reported as singletons. Not a bug per se but a change of behavior. Let me know if by accident or intentional.
Cheers,
Paulo
> On 21 Nov 2013, at 15:43, Paulo Moura <pm...@lo...> wrote:
>
>>
>> On 21/11/2013, at 14:14, Paulo Moura <pm...@lo...> wrote:
>>
>>>
>>> On 21/11/2013, at 11:48, Vitor Santos Costa <vs...@gm...> wrote:
>>>
>>>> Hi Jean-Noel
>>>>
>>>> Give it a try.
>>>>
>>>> It may have been because weirdness of mmap in Snow Leopard. mmap would
>>>> claim to have allocated memory as requested, but then would crash when
>>>> trying to access it. Paulo, do you remember that?
>>>
>>> Vaguely. Too long ago :-)
>>>
>>>> 6.3 does not use dlmalloc because of fragmentation trouble for longer runs.
>>>
>>> Btw, the latest git verison builds fine on MacOS 10.9.
>>
>> But it bombs on startup :(
>>
>> $ yaplgt
>>
>> YAP 6.3.4 (i386-darwin13.0.0): Qui 21 Nov 2013 12:11:42 WET
>> -4551853894178701049
>> Segmentation fault: 11
>>
>> Cheers,
>>
>> Paulo
-----------------------------------------------------------------
Paulo Moura
Logtalk developer
Email: <mailto:pm...@lo...>
Web: <http://logtalk.org/>
-----------------------------------------------------------------
|
|
From: Vitor S. C. <vs...@dc...> - 2013-11-21 22:30:10
|
On 21 Nov 2013, at 17:42, Jean-Noël Vittaut <jea...@un...> wrote: > Hi Vitor, > > thanks for your answer. I tried it and it seems to solve the problem on Lion. But I might switch back to system malloc because I just found out that using dlmalloc is not compatible with launching several Yap instances in my version of the Yap Library. It's a pity, it was definitely faster with dlmalloc for the kind of tasks I give to Yap. > Is it a thread problem? Vitor > Jean-Noël > > Le 21 nov. 2013 à 12:48, Vitor Santos Costa a écrit : > >> Hi Jean-Noel >> >> Give it a try. >> >> It may have been because weirdness of mmap in Snow Leopard. mmap would >> claim to have allocated memory as requested, but then would crash when >> trying to access it. Paulo, do you remember that? >> >> 6.3 does not use dlmalloc because of fragmentation trouble for longer runs. >> >> Vitor >> >> >> >> On Wed, Nov 20, 2013 at 4:58 PM, Jean-Noël Vittaut >> <jea...@un...> wrote: >>> Hi everyone, >>> >>> I've been working on a reentrant version of the Yap 6.2.2 library that I use in my General Game Player. >>> My settings are "with tabling" and "using dlmalloc". >>> During my tests, I found out that at some point, Yap was doing a mmap in a call of Yap_ExtendWorkSpace. This extension of the heap resulted in moving some memory parts allocated by malloc and a crash. >>> >>> … >>> >>> Thanks for your help >>> >>> Jean-Noël Vittaut >>> Paris 8 University |
30 messages has been excluded from this view by a project administrator.
