Nabble - SWI Prolog

Re: SW-Prolog Version 5.6.58 and Debian (lenny)

2008-10-11T11:25:17Z

Hi Valerio,

(I'm the maintainer of swi-prolog in Debian.)

> The file test.pl contains the clause ":- use_module(library(clpq))."
> Is this expected ? :)

This is expected.

Debian's packaging of SWI Prolog is modular - the minimal working SWI
functionality (essentially the "install-lite" target) is contained in the
"swi-prolog" package, and the various other SWI packages such as odbc, clib,
etc. are in seperate "swi-prolog-odbc" "swi-prolog-clib", etc. packages.

These other packages were added when requested. However, as nobody requested
the clpqr package yet, it does not yet exist. I suggest you file a wishlist
bug against the Debian swi-prolog package. Please see:

http://www.debian.org/Bugs/Reporting

for more details. Please also note the advice on that page regarding sending
bugs upstream.

Regards,

--
,''`.
: :' : Chris Lamb
`. `'` lamby@...
`-

signature.asc (204 bytes) Download Attachment

Re: tail recursion?

2008-10-10T12:02:34Z

> % length of a list as a unary integer
> len([],0).
> len([H|T],s(N)):- len(T,N).
>
> % length of a list as an accumulated unary integer
> len([],N,N).
> len([H|T],A,N):- len(T,s(A),N).

Both programs are tail-recursive, and both are subject to
tail-recursion optimization (or last-call optimiziation). Moreover,
they use the same amount of heap. The second could be (a small
constant factor) more efficient, because the s(A) term is in a
"construct" position, while the s(N) term in the first version is in a
position that could a priori be constructing or unifying, so it needs
a test to decide on that. It might be impossible to measure the
constant, and it might go either way depending on the Prolog system,
for other reasons.

> is it correct to say the the second program is more efficient
> since it "doesn't use a stack"?

Neither uses stack - it should be easy to check that with statistics.

> the second program builds the stack in its accumulator argument, and
> that this is less costly than using the call stack for this purpose

That is true, but that's not a difference between the two versions of len.

> the benefits of tail recursion are greater in the case of normal,
> decimal representation of integers, where you really don't need a
> stack thanks to the efficiency of decimal representation.

Maybe you want to compare rather the following two versions:

len([],0).
len([_|T],L) :- len(T,L1), L is L1 + 1.

and

len([],N,N).
len([_|T],A,N) :- A1 is A + 1, len(T,A1,N).

In this case, the first consumes stack, while the latter does not.
Neither consumes heap.

Think a bit about this, experiment (use statistics) and if you have
further questions, please ask: we're here to help !

Cheers

Bart Demoen
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

tail recursion?

2008-10-10T10:58:50Z

Dear All,

is the following program tail recursive:

% length of a list as a unary integer
len([],0).
len([H|T],s(N)):- len(T,N).

The reason that I hesitate is the term s(N) in the head.
Is the call stack replaced by a linked list of s-records?

The following program should be tail recursive:

% length of a list as an accumulated unary integer
len([],N,N).
len([H|T],A,N):- len(T,s(A),N).

When explaining the difference between the two programs,
is it correct to say the the second program is more efficient
since it "doesn't use a stack"? Isn't it more correct to say
that the second program builds the stack in its accumulator
argument, and that this is less costly than using the call stack
for this purpose? Of course, the benefits of tail recursion are
greater in the case of normal, decimal representation of integers,
where you really don't need a stack thanks to the efficiency
of decimal representation. But actually "stacks encoded in
accumulator arguments" are frequently encountered, for example,
when reversing a list.

Any remark or comment is highly appreciated,

Marc Bezem.

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

SPARQL licensing

2008-10-10T08:22:52Z

Hi all,
Sorry for this stupid question but I'm confused and need help!

I want to use SWI-Prolog for a commercial client and that's what I undestand:
- no licensing problem because the interpreter is LPGL and the base libraries have an 'exception' to the GPL that allows for commercial use (if not modified)
- the semweb and rdf libraries carry the 'exception' (by the way it seems like pretty nice stuff)
- the SPARQL development was switched to the ClioPatria project that is GPL (problem ahead!) and not officially published.

If I get it right, do you know of a SPARQL library that would go on top of the rdf/semweb libraries and carry a licence compatible with the rest of SWI-Prolog.

Best regards
Jacques

SW-Prolog Version 5.6.58 and Debian (lenny)

2008-10-10T02:59:59Z

Hello to everyone,

I have made a fresh new (apt-get) install of SWI Prolog

under Debian (lenny). Version 5.6.58.

And I get the following error:

$ swipl

Welcome to SWI-Prolog (Multi-threaded, 32 bits, Version 5.6.58) Copyright (c) 1990-2008 University of Amsterdam. SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software, and you are welcome to redistribute it under certain conditions. Please visit http://www.swi-prolog.org for details. For help, use ?- help(Topic). or ?- apropos(Word). ?- use_module(library(clpq)). ERROR: source_sink `library(clpq)' does not exist ?- [test].

ERROR: /home/valerio/test.pl:1: source_sink `library(clpq)' does not exist Warning: /home/valerio/test.pl:1: Goal (directive) failed: user:use_module(library(clpq)) % test compiled 0.01 sec, 1,584 bytes true.

The file test.pl contains the clause ":- use_module(library(clpq))."

Is this expected ? :)

Can anyone help me?

Thank you

Valerio

XPCE questions for the list

2008-10-09T05:21:03Z

I have two questions for the list:

1) I have created a refinement of bitmap class that has a popup recogniser associated with it. A side effect of the popup behavior is that the image on the bitmap is changed to reflect the popup selection. This works fine as long as I use it by itself in a dialog. But if I use it as a member of a menu (choice), then the images do not render properly. Any ideas? A test jig is attached.

2) The second question has to do with XPCE and it associated tool set (PCEDraw, dialog editor, etc.) --What is to become of it? It does not appear to be maintained very well. Both the Linux and Windows variants are pretty buggy these days and have been for some time. XPCE seems to work well enough (except as noted) as long as you hand-write your dialogs. But that's not the way these sorts of things are done these days. I spoke briefly with Jan about it. He believes that it needs a major "facelift", but has no resources to do it, and that it will be maintained at a "basic level" for the foreseeable future.

Regards,
Jeff R.

**************
New MapQuest Local shows what's happening at your destination. Dining, Movies, Events, News & more. Try it out!
(http://local.mapquest.com/?ncid=emlcntnew00000001)

fancyMenu.zip (3K) Download Attachment

Special Journal Issue IEEE TKDE: Call for Contributions

2008-10-09T05:04:39Z

Dear Colleagues,

Please consider to participate in RuleML-2008
(http://2008.ruleml.org/) which will be in about 3 weeks in Orlando,
Florida, collocated with the world largest Business Rules Forum.

We have a very interesting program with renowned speakers, a
prestigious rules Challenge, a special session + panel about Rule
standards, etc.

We are also editing a special issue of IEEE TKDE. Please consider to
contribute to this issue and forward the open call for contributions
(below) to your interested colleagues.

Thanks,

Adrian

[ our apologies should you receive this message more than one time ]

===========================================================================
CALL FOR Contributions

Rule Representation, Interchange and Reasoning in Distributed,
Heterogeneous Environments

Special Issue of IEEE Transactions on Knowledge and Data Engineering

Guest Editors: N. Bassiliades, G. Governatori, A. Paschke, J.
Dix
===========================================================================

In recent years rule based technologies have enjoyed remarkable
adoption in two areas: (1) Business Rule Processing and (2)
Web-Centered Reasoning. The first trend is caused by the software
development life cycle, which needs to be accelerated at reduced cost.
The second trend is related to the Semantic Web and Service-oriented
technologies, which aim to turn the Web into a huge repository of
cross-referenced, machine-understandable data and processes. For both
trends, rules can be used to extract, derive, transform, and integrate
information in a platform-independent manner.
While early rule engines and environments were complex, expensive to
maintain, and not very user friendly, the current generation of rule
technology provides enhanced usability, scalability and performance,
and is less costly. A general advantage of using rules is that they
are usually represented in a platform independent manner, often using
XML. This fits well into today's distributed, heterogeneous Web-based
system environments.
Rules represented in standardized Web formats can be discovered,
interchanged and invoked at runtime within and across Web systems, and
can be interpreted and executed on any platform.

This special issue solicits state-of-the-art approaches, solutions and
applications in the area of Rule Representation, Reasoning and
Interchange in the context of distributed, (partially) open,
heterogeneous environments, such as the Semantic Web, Intelligent
Multi-Agent Systems, Event-Driven Architectures and Service-Oriented
Computing. We strongly advise that solicited contributions should
clearly identify the target class of applications they enable.

=======
Topics
=======

Original contributions, not currently under review or accepted by
another journal, are solicited in relevant areas including (but not
limited to) the
following:

- Rule Representation and Languages
* Rule languages for exchanging and processing information through the
web
* Representation and meta-annotation of rules and rule sets for
publication and interchange
* Event-driven/action rule languages and models
* Rule-based event processing languages and rule-based complex event
processing
* Modeling of executable rule specifications and tool support
* Natural-language processing of rules
* Graphical processing, modeling and rendering of rules
* Rules in web 2.0, web 3.0, semantic web technologies and web
intelligence research

- Reasoning and Rule Engines
* Execution models, rule engines, and environments
* Rule-based (multi-valued) reasoning with and representing uncertain
and fuzzy information
* Rule-based reasoning with non-monotonic negation, modalities, deontic,
temporal, priority, scoped or other rule qualifications
* Rule-based default reasoning with default logic, defeasible logic, and
answer set programming
* Compilation vs. interpretation approaches of rules
* Hybrid rule systems

- Rule Interchange and Integration
* Interchange and refactoring of rule bases in heterogeneous execution
environments
* Rule-based agility and its role in middleware
* Communication between rule based systems using interchange formats and
processing / communication middleware
* Information integration of external data and domain knowledge into rules
* Homogeneous and heterogeneous integration of rules and ontologies
* Extraction and reengineering of platform-independent, interchangeable
rules and rule models from existing platform-specific resources
* Rule interchange standards and related industry interchange formats
* Incorporation of rule technology into distributed enterprise
application architectures
* Interoperation between different rule formats and ontological domain
conceptualization
* Translation of interchangeable and domain-independent rule formats and
rule models into executable technical rule specifications

- Rule Engineering and Repositories
* Verification and validation of interchanged rule bases in
heterogeneous execution environments
* Practical solutions tackling the real-world software engineering
requirements of rule-based systems in open, distributed environments
* Collaborative authoring, modeling and engineering of rule
specifications and rule repositories
* Management and maintenance of distributed rule bases and rule
repositories during their lifecycle

- Web Rule Applications
* Applications and integration of rules in web standards
* Applications of rules in the semantic web and pragmatic web
* Applications based on (semantic) web rule standardization or
standards-proposing efforts
* Applications of rules in e.g. legal reasoning, compliance rules,
security, government, security, risk management, trust and proof
reasoning, etc.
* E-contracting and automated negotiations with rule-based declarative
strategies
* Specification, execution and management of rule-based policies and
electronic contracts
* Rule-based software agents and (web) services
* Theoretical and/or empirical evaluation of rule-based system
performance and scalability

=======================
Submission Guidelines
=======================

Prospective authors should prepare manuscripts according to the Information
for Authors as published in recent issues of the journal or at
http://www.computer.org/tkde/. Note that mandatory over-length page charges
and color charges will apply.
Manuscripts should be submitted through the online IEEE manuscript
submission system at https://mc.manuscriptcentral.com/cs-ieee.
Updated information of this call can be found at
http://lpis.csd.auth.gr/publications/tkde-si/.

=======================
Schedule
=======================

Deadline for paper submission: March 1, 2009
Completion of first review: June 19, 2009
Minor/Major revision due: August 21, 2009
Final decision notification: November 6, 2009
Publication materials due: December 4, 2009
Publication date (tentative): July 2010

=======================
Guest Editors
=======================

Nick Bassiliades, Aristotle University of Thessaloniki, Greece
nbassili AT csd.auth.gr

Guido Governatori, NICTA, Australia
guido.governatori AT nicta.com.au

Adrian Paschke, Free University Berlin, Corporate Semantic Web, Germany
paschke AT inf.fu-berlin.de

Jurgen Dix, Clausthal University of Technology, Germany
dix AT tu-clausthal.de

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: Tail call optimisation

2008-10-09T03:23:14Z

Hello,

On Wed, Oct 8, 2008 at 12:23 AM, Jan Wielemaker <J.Wielemaker@...> wrote:

> On Tuesday 07 October 2008 03:27:19 pm Nicolas Pelletier wrote:
>>
>> I am using SWI 5.6.61 on Linux and am wondering, out of curiosity, how
>> I can verify that the compilation of a predicate leads to a tail call
>> optimized blurb of code. Is there already such a thing in SWI ?
>
> Runtime, yes. You can use the graphical debugger to inspect
> choicepoints. If there is no choicepoint since the entrance of the
> current predicate at the moment you are about to make the last call, it
> will do last call optimization. Note that in the current implementation
> LCO (as it is abbreviated) saves space, but no time (it is even a bit
> slower). This will be improved in 5.7.x.

Ok, thank you for pointing this out. I did not know the graphical
debugger could show this.

> The other way out is to run the goal with lots of data and a small local
> stack. If it runs out of local stack, LCO didn't do its job :-)

Of course, yes :-) I was just looking for another way to do this...

> More tricks: ask prolog_current_frame(X). on an LCO loop this should
> remain the same frame.

Aha, that is nice to know !

> Note that LCO is never activated in debug mode!

Yes, of course.

Thank you for these tips.

Regards,

--
Nicolas
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Is there a way to make SWI-Prolog Valgrind-clean?

2008-10-08T23:34:28Z

Here is what I observe (note that I simply typed Control-D at the prompt):

$ export VALGRIND=yes
$ valgrind --tool=memcheck -q --trace-children=yes --leak-check=yes --num-callers=100 --leak-resolution=high --suppressions=/home/roberto/ppl/ppl/tests/valgrind_suppressions /usr/local/bin/pl
Welcome to SWI-Prolog (Multi-threaded, 32 bits, Version 5.6.61)
Copyright (c) 1990-2008 University of Amsterdam.
SWI-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software,
and you are welcome to redistribute it under certain conditions.
Please visit http://www.swi-prolog.org for details.

For help, use ?- help(Topic). or ?- apropos(Word).

?-
% halt
==6515==
==6515== 24 bytes in 1 blocks are definitely lost in loss record 16 of 61
==6515== at 0x40054E5: malloc (vg_replace_malloc.c:149)
==6515== by 0x806904F: SinitStreams (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80E6B69: PL_initialise (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8050D91: main (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515==
==6515==
==6515== 24 bytes in 1 blocks are definitely lost in loss record 17 of 61
==6515== at 0x40054E5: malloc (vg_replace_malloc.c:149)
==6515== by 0x806901D: SinitStreams (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80E6B69: PL_initialise (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8050D91: main (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515==
==6515==
==6515== 24 bytes in 1 blocks are definitely lost in loss record 18 of 61
==6515== at 0x40054E5: malloc (vg_replace_malloc.c:149)
==6515== by 0x8068FE3: SinitStreams (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80E6B69: PL_initialise (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8050D91: main (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515==
==6515==
==6515== 1,024 bytes in 1 blocks are definitely lost in loss record 49 of 61
==6515== at 0x40054E5: malloc (vg_replace_malloc.c:149)
==6515== by 0x805546F: PL_malloc (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8057A4B: codeToAtom (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80B8DD2: simple_term (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80B71AA: complex_term (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80BB6A7: read_term (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80BC8AF: read_clause (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80BCAEA: pl_read_clause_va (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8064063: PL_next_solution (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80AA604: callProlog (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80DA15B: pl_with_mutex (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x805A9F1: callForeign (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8061D6C: PL_next_solution (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80AA233: prologToplevel (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80E705F: PL_initialise (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8050D91: main (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515==
==6515==
==6515== 2,596 (44 direct, 2,552 indirect) bytes in 1 blocks are definitely lost in loss record 54 of 61
==6515== at 0x40054E5: malloc (vg_replace_malloc.c:149)
==6515== by 0x805546F: PL_malloc (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80D8546: allocSimpleMutex (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8098B66: _lookupModule (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80991A8: lookupModule (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8055736: PL_predicate (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x80E5702: PL_cleanup (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8054A41: PL_halt (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
==6515== by 0x8050DB6: main (in /usr/local/lib/pl-5.6.61/bin/i686-linux/pl)
$

Is there a way to configure/compile/execute SWI-Prolog so that it deallocates all
memory before exiting?
All the best,

Roberto

--
Prof. Roberto Bagnara
Computer Science Group
Department of Mathematics, University of Parma, Italy
http://www.cs.unipr.it/~bagnara/
mailto:bagnara@...
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: SWI-Prolog web interface

2008-10-08T10:54:24Z

Thank you very much.

Please, can you tell me how the prolog rule would look like in that case?

rule_open_www:- ?

Belen

Michiel Hildebrand wrote:

On 8 okt 2008, at 18:45, BelenT wrote:

>
> I am developing a web interface using SWI-Prolog, I need a link to
> open in a
> new window (in html it would be target="_blank").

I don't know exactly what you mean, but I assume you use the
html_write module.
In that case you can do:

a([href('http://example.com'), target('_blank')], 'example link')

Michiel

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@iai.uni-bonn.de
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: SWI-Prolog web interface

2008-10-08T10:32:50Z

On 8 okt 2008, at 18:45, BelenT wrote:

>
> I am developing a web interface using SWI-Prolog, I need a link to
> open in a
> new window (in html it would be target="_blank").

I don't know exactly what you mean, but I assume you use the
html_write module.
In that case you can do:

a([href('http://example.com'), target('_blank')], 'example link')

Michiel

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

SWI-Prolog web interface

2008-10-08T09:45:03Z

I am developing a web interface using SWI-Prolog, I need a link to open in a new window (in html it would be target="_blank"). I have read the documentation several times, but I am unable to find out how to do this.
Any help will be appreciated.
Thanks in advance,

Belen T.

Re: Compile JPL on Mac

2008-10-08T07:50:33Z

Hold on, a

./configure --prefix=/usr/local --with-world

did it for me and compiled everything including JPL.
So no need to do it separately.

Mit freundlichen Grüßen / Best Regards

Michael Igler
Dipl. Inform. (Univ.)

Universität Bayreuth
Fakultät für Mathematik, Physik und Informatik
Lehrstuhl für Angewandte Informatik IV

AI 0.25
D-95440 Bayreuth

Fon : +49 921 - 55 7625
Fax : +49 921 - 55 7622
Email : michael.igler@...
Internet : http://www.ai4.uni-bayreuth.de

Am 08.10.2008 um 15:58 schrieb Michael Igler:

> I want to compile JPL on my Mac having the following problem:
>
> plld -embed-shared -o libjpl.dylib src/c/jpl.o -Wl,-framework,JavaVM
> ld: in /opt/local/lib/libxml2.2.dylib, file is not of required
> architecture
>
> The libxml has no PPC code inside (checked it with nm -arch...) and
> plld wants to build for both, INTEL and PPC.
>
> So I want alter the Makefile to force plld with -ld-options* to use
> only something like -arch i386?
> Has anyone a workaround?
>
>
>
>
> Mit freundlichen Grüßen / Best Regards
>
> Michael Igler
> Dipl. Inform. (Univ.)
>
> Universität Bayreuth
> Fakultät für Mathematik, Physik und Informatik
> Lehrstuhl für Angewandte Informatik IV
>
> AI 0.25
> D-95440 Bayreuth
>
> Fon : +49 921 - 55 7625
> Fax : +49 921 - 55 7622
> Email : michael.igler@...
> Internet : http://www.ai4.uni-bayreuth.de
>
>
>

smime.p7s (3K) Download Attachment

Re: Compile JPL on Mac

2008-10-08T07:50:08Z

Michael,

On Wednesday 08 October 2008 03:58:40 pm Michael Igler wrote:
> I want to compile JPL on my Mac having the following problem:
>
> plld -embed-shared -o libjpl.dylib src/c/jpl.o -Wl,-framework,JavaVM
> ld: in /opt/local/lib/libxml2.2.dylib, file is not of required
> architecture
>
> The libxml has no PPC code inside (checked it with nm -arch...) and
> plld wants to build for both, INTEL and PPC.

plld wants to build for whatever architecture Prolog was build. I know
this type of problems only from people using an intel mac that installed
the ppc binaries and want to compile some extra for it.

On the other hand, JPL is already in all binary distributions ...

> So I want alter the Makefile to force plld with -ld-options* to use
> only something like -arch i386?

Unlikely to work

> Has anyone a workaround?

Get the full source and follow README.MacOSX?

Cheers --- Jan

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Compile JPL on Mac

2008-10-08T06:58:40Z

I want to compile JPL on my Mac having the following problem:

plld -embed-shared -o libjpl.dylib src/c/jpl.o -Wl,-framework,JavaVM
ld: in /opt/local/lib/libxml2.2.dylib, file is not of required
architecture

The libxml has no PPC code inside (checked it with nm -arch...) and
plld wants to build for both, INTEL and PPC.

So I want alter the Makefile to force plld with -ld-options* to use
only something like -arch i386?
Has anyone a workaround?

Mit freundlichen Grüßen / Best Regards

Michael Igler
Dipl. Inform. (Univ.)

Universität Bayreuth
Fakultät für Mathematik, Physik und Informatik
Lehrstuhl für Angewandte Informatik IV

AI 0.25
D-95440 Bayreuth

Fon : +49 921 - 55 7625
Fax : +49 921 - 55 7622
Email : michael.igler@...
Internet : http://www.ai4.uni-bayreuth.de

smime.p7s (3K) Download Attachment

Re: Tail call optimisation

2008-10-07T10:11:11Z

Pablo,

On Tuesday 07 October 2008 17:47:02 Pablo López wrote:
> I wonder whether inserting a call to deterministic/1 just
> before the last call can make the trick as well.
> What do you think?

No. deterministic/1 finds choicepoints since *entering* the clause. I.e.
it misses the choicepoint left by an alternative clause that prevents
LCO. Anyway, it is hackers corner ...

A somewhat more portable way of finding (non-)determinism was once
told to me by Ulrich Neumerkel:

call_cleanup(Goal, Det=true),
( Det == true
-> <Goal succeeded without choice>
; <Goal succeeded with choice>
)

Cheers --- Jan

> Cheers,
>
> --Pablo
>
> On Tuesday 07 October 2008 05:23:21 pm Jan Wielemaker wrote:
> > On Tuesday 07 October 2008 03:27:19 pm Nicolas Pelletier wrote:
> > > Hello,
> > >
> > > I am using SWI 5.6.61 on Linux and am wondering, out of curiosity, how
> > > I can verify that the compilation of a predicate leads to a tail call
> > > optimized blurb of code. Is there already such a thing in SWI ?
> >
> > Runtime, yes. You can use the graphical debugger to inspect
> > choicepoints. If there is no choicepoint since the entrance of the
> > current predicate at the moment you are about to make the last call, it
> > will do last call optimization. Note that in the current implementation
> > LCO (as it is abbreviated) saves space, but no time (it is even a bit
> > slower). This will be improved in 5.7.x.
> >
> > The other way out is to run the goal with lots of data and a small local
> > stack. If it runs out of local stack, LCO didn't do its job :-)
> >
> > More tricks: ask prolog_current_frame(X). on an LCO loop this should
> > remain the same frame.
> >
> > Note that LCO is never activated in debug mode!
> >
> > Cheers --- Jan
> >
> > _______________________________________________
> > SWI-Prolog mailing list
> > SWI-Prolog@...
> > https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog
>
> _______________________________________________
> SWI-Prolog mailing list
> SWI-Prolog@...
> https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: Tail call optimisation

2008-10-07T08:47:02Z

Jan,

I wonder whether inserting a call to deterministic/1 just
before the last call can make the trick as well.
What do you think?

Cheers,

--Pablo

On Tuesday 07 October 2008 05:23:21 pm Jan Wielemaker wrote:

> On Tuesday 07 October 2008 03:27:19 pm Nicolas Pelletier wrote:
> > Hello,
> >
> > I am using SWI 5.6.61 on Linux and am wondering, out of curiosity, how
> > I can verify that the compilation of a predicate leads to a tail call
> > optimized blurb of code. Is there already such a thing in SWI ?
>
> Runtime, yes. You can use the graphical debugger to inspect
> choicepoints. If there is no choicepoint since the entrance of the
> current predicate at the moment you are about to make the last call, it
> will do last call optimization. Note that in the current implementation
> LCO (as it is abbreviated) saves space, but no time (it is even a bit
> slower). This will be improved in 5.7.x.
>
> The other way out is to run the goal with lots of data and a small local
> stack. If it runs out of local stack, LCO didn't do its job :-)
>
> More tricks: ask prolog_current_frame(X). on an LCO loop this should
> remain the same frame.
>
> Note that LCO is never activated in debug mode!
>
> Cheers --- Jan
>
> _______________________________________________
> SWI-Prolog mailing list
> SWI-Prolog@...
> https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: Tail call optimisation

2008-10-07T08:23:21Z

On Tuesday 07 October 2008 03:27:19 pm Nicolas Pelletier wrote:
> Hello,
>
> I am using SWI 5.6.61 on Linux and am wondering, out of curiosity, how
> I can verify that the compilation of a predicate leads to a tail call
> optimized blurb of code. Is there already such a thing in SWI ?

Runtime, yes. You can use the graphical debugger to inspect
choicepoints. If there is no choicepoint since the entrance of the
current predicate at the moment you are about to make the last call, it
will do last call optimization. Note that in the current implementation
LCO (as it is abbreviated) saves space, but no time (it is even a bit
slower). This will be improved in 5.7.x.

The other way out is to run the goal with lots of data and a small local
stack. If it runs out of local stack, LCO didn't do its job :-)

More tricks: ask prolog_current_frame(X). on an LCO loop this should
remain the same frame.

Note that LCO is never activated in debug mode!

Cheers --- Jan

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: Inconsistent display of variable bindings in visual debugger

2008-10-07T07:02:31Z

Hi Gunter,

On Tuesday 07 October 2008 02:22:21 pm Günter Kniesel wrote:

> I just noted that the visual debugger displays different names for
> the same internal variable in its "normal" binding view and in the "detail
> binding view" that appears when double-klicking one of the bindings.
> For instance, in the attached screenshot, _G4968, which appears in
> both arguments, changes to two different names in the detail view
> of each argument. The screenshot shows that in the detail view for
> the first argument, _G4968 is displayed as _G1486.
>
> This behaviour can be quite confusing. Worse, it might lead to errors.
> When using the detail view to access large values and to assemble
> a test call that exposes a problem, the consistency of variables
> shared among the bindings will be lost. For instance, replacement
> of _G4968 by two different variables, say A and C, leads to
>
> Arg1 = calls(a2,A), Arg2 = (f=B, C=D, ...), testcall(Arg1,Arg2).
> ^ ^
> instead of
>
> Arg1 = calls(a2,A), Arg2 = (f=B, A=D, ...), testcall(Arg1,Arg2).
> ^ ^
> Is this possibly a result of a recent change? I am pretty sure
> that I used to cut and paste large values from detail views in
> order to create test cases for identified bugs. Or did it only
> work by accident because the different bindings didn't share any
> variables?

Variables written as _G<N> are unnamed variables for which Prolog writes
the offset in the stack. Unfortunately, if a garbage collect happens,
these addresses change. AFAIK this has always been the case. The only
way `around' would be to disable GC. Ideal might be to copy the whole
goal term and numbervars it, but unfortunately these terms can be really
big. Another trick might be to redisplay all bindings if a GC happens.

> Could this be changed (back) in a future release?

Afraid. For now I leave it as an `excercise for the user' ...

Cheers --- Jan

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Tail call optimisation

2008-10-07T06:27:19Z

Hello,

I am using SWI 5.6.61 on Linux and am wondering, out of curiosity, how
I can verify that the compilation of a predicate leads to a tail call
optimized blurb of code. Is there already such a thing in SWI ?

Regards,

--
Nicolas
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Inconsistent display of variable bindings in visual debugger

2008-10-07T05:22:21Z

I just noted that the visual debugger displays different names for
the same internal variable in its "normal" binding view and in the "detail
binding view" that appears when double-klicking one of the bindings.
For instance, in the attached screenshot, _G4968, which appears in
both arguments, changes to two different names in the detail view
of each argument. The screenshot shows that in the detail view for
the first argument, _G4968 is displayed as _G1486.

This behaviour can be quite confusing. Worse, it might lead to errors.
When using the detail view to access large values and to assemble
a test call that exposes a problem, the consistency of variables
shared among the bindings will be lost. For instance, replacement
of _G4968 by two different variables, say A and C, leads to

Arg1 = calls(a2,A), Arg2 = (f=B, C=D, ...), testcall(Arg1,Arg2).
^ ^
instead of

Arg1 = calls(a2,A), Arg2 = (f=B, A=D, ...), testcall(Arg1,Arg2).
^ ^
Is this possibly a result of a recent change? I am pretty sure
that I used to cut and paste large values from detail views in
order to create test cases for identified bugs. Or did it only
work by accident because the different bindings didn't share any
variables?

Could this be changed (back) in a future release?

-- Günter

--------------------------------------------------------------------
Dr. Günter Kniesel http://www.cs.uni-bonn.de/~gk/
Institut für Informatik III gk@...
Universität Bonn
Römerstr. 164 (Raum A107) Tel (+49 228) 73-4511
D-53117 Bonn Fax (+49 228) 73-4382

swi-debugger-bug.jpg (40K) Download Attachment

Rem's algorithm for maintaining equivalence classes

2008-10-07T00:49:47Z

SICStus Prolog has a library(rem) for maintaining equivalence classes
using Rem's algorithm - see
http://www.sics.se/sicstus/docs/latest/html/sicstus/lib_002drem.html . Has
anyone - its author perhaps... - written an equivalent for SWI?

Jocelyn Paine
http://www.j-paine.org
+44 (0)7768 534 091

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: [JPL] Reset Prolog session

2008-10-06T07:12:10Z

Florian Pommmerening wrote:
> Hi all,
>
> I read in the chanegelog that one can initialize JPL only once to avoid inconsistencies. My problem is that a prolog program I'm trying to use from Java works only once per session. I'm trying to fix this bug at its source of course but this is not my code and debugging foreign code is ... well lets just say I'm looking for a workaround in case I cannot find a way to fix this bug.

Well you can stop debugging - it isn't a bug ;-)

It's a deliberately unimplemented feature: the effort required to
support this in JPL would be fairly minor compared to supporting full
reinitialisation in SWI-Prolog, but it's not a high priority for
either me or Jan.

> Is there any way to start a new prolog session with JPL?

Sorry, no.

> Are there other possibilities to reset prolog? (I tried retractall(x(_)) for every dynamic x but it did not help)

Yes, but it will need a bit more thought and care. For motivation,
tell yourself that you will benefit from understanding all the changes
which this Prolog program (I understand that it may not be your own
code) can or does make to the Prolog environment.

Maybe scan the SWIPL docs for things which could be left in a
different state: flags, streams, modules, dynamic procedures etc.

Maybe rewrite the app to separate setup from running, add some code to
tidy up after itself ready to run again.

NB I sympathise with your wish to just restart from scratch, and
realise that (depending how this program is written) you may never get
it to rerun correctly :-(

cheers

Paul Singleton

> thanks
> Florian
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

[JPL] Reset Prolog session

2008-10-06T06:00:16Z

Hi all,

I read in the chanegelog that one can initialize JPL only once to avoid inconsistencies. My problem is that a prolog program I'm trying to use from Java works only once per session. I'm trying to fix this bug at its source of course but this is not my code and debugging foreign code is ... well lets just say I'm looking for a workaround in case I cannot find a way to fix this bug.

Is there any way to start a new prolog session with JPL?
Are there other possibilities to reset prolog? (I tried retractall(x(_)) for every dynamic x but it did not help)

thanks
Florian
--
Psssst! Schon vom neuen GMX MultiMessenger gehört? Der kann`s mit allen: http://www.gmx.net/de/go/multimessenger
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T09:50:17Z

> Is this a bug? Nobody says it is not allowed to call the wakeup in the
> middle of a unify.

True. As such, this is not a bug. But implicitely I assumed that within
=/2 you will not call other goals. So you will only call them thereafter.
Further, this was a change from 5.6 to 5.7.

But you are right. To make the case even more explicit:

p :- put_attr(V1,user,10),(V1,4)=(0,1).

... could be transformed into:

p :- put_attr(V1,user,10), V1 = 0, 4 = 1.

Still, I am somewhat hesitant about the exact freedom (and nondeterminacy) that
should be respected. For this reason it is really best if all delayed goals
etc. will terminate always, otherwise life is much harder (as it is with freeze/2).
Who wants a system where turning on -O produces nontermination that did not
exist before?
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T08:37:22Z

On Sunday 05 October 2008 17:14:47 Bart Demoen wrote:
> > "_ = something" is simply replaced by `true'.
> > I'm still considering GCC-like warnings here, such as
> >
> > 'Goal has no effect'
> > 'Goal always fails'
>
> I had the message "Stupid unification" in the BIM-Prolog compiler long
> ago. Just before shipping it to customers, someone would replace it
> with something more gentle because it upset the customers :-)

The SWI-Prolog customers don't pay, but still I prefer to be a bit more
polite :-)

> I think that flagging such code is a really nice thing, because it
> almost always is due to typos.
>
> Don't stop there though - flag first occurrences of variables in
> arithmetic expressions, uses of functor/3 with a non-integer in third
> argument, ..., and look (at compile time) inside what is asserted,
> meta-called, etc.

The interesting question of course is, what is better left to a type
checker and what is better done by the compiler? Your functor/3 example
appears to be as a clear example of an issue for the type checker.

Of course, "_ = something" is not a type error, so at least strickly
speaking it isn't the domain of the type checker. It could still be
argued it must be the responsibility of some sort of static analysis
tool outside the compiler proper. On the other hand, the compiler does a
lot of the work, so it can do some of these tasks without any overhead.
In the Var = Something example it already distinguishes singleton, first
use and non-first use, so while writing the compiler you have to do
*something* if you see <singleton> = something ...

Cheers --- Jan

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T08:14:47Z

> "_ = something" is simply replaced by `true'.
> I'm still considering GCC-like warnings here, such as
>
> 'Goal has no effect'
> 'Goal always fails'

I had the message "Stupid unification" in the BIM-Prolog compiler long
ago. Just before shipping it to customers, someone would replace it
with something more gentle because it upset the customers :-)

I think that flagging such code is a really nice thing, because it
almost always is due to typos.

Don't stop there though - flag first occurrences of variables in
arithmetic expressions, uses of functor/3 with a non-integer in third
argument, ..., and look (at compile time) inside what is asserted,
meta-called, etc.

Cheers

Bart Demoen
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T05:10:09Z

Hi Victor,

On Sunday 05 October 2008 13:36:12 Victor NOEL wrote:
> On Sun, Oct 05, 2008 at 01:30:04PM +0200, Jan Wielemaker wrote:

> > here and the bug was diagnosed as an error due to changes of handling
> > the wakeup list. Only applies to 5.7.x. Fixed.
>
> Thanks you, this fix with the previous one fixes all my problems now

The bug found by Ulrich can probably cause crashes and many other
unwanted behaviours. Thanks for the reports. Still, be careful with
5.7.x. In a large app by us I found a GC crash. I left it for now as it
reproduces very poorly (big multi-threaded app with lots of data in it)
and I have no time to dig into it. Still, be warned and if you find a
better case, send it.

Cheers --- Jan

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T04:36:12Z

On Sun, Oct 05, 2008 at 01:30:04PM +0200, Jan Wielemaker wrote:

> Hi Ulrich,
>
> On Sunday 05 October 2008 02:01:33 Ulrich Neumerkel wrote:
> > The current bug is that a syntactically failing unification still
> > invokes accumulated unification-hooks in stead of failing.
> >
> > Sometimes this works, and sometimes not.
> >
> > g3> /opt/gupu/pl-57x/bin/pl -f none
> > Welcome to SWI-Prolog (Multi-threaded, 64 bits, Version 5.7.1-46-g32a4502)
> > ...
> > ?- put_attr(V1,user,10),(V1,4)=(0,1).
> > ERROR: uhook/3: Undefined procedure: attr_unify_hook/2
>
> Is this a bug? Nobody says it is not allowed to call the wakeup in the
> middle of a unify. I think implementations are allowed to do many things
> with this code, including replacing it by 'fail'. SWI-Prolog 5.7 already
> does a few of these. E.g. "_ = something" is simply replaced by `true'.
> I'm still considering GCC-like warnings here, such as
>
> 'Goal has no effect'
> 'Goal always fails'
>
> That was my first intuition and I still think that is a valid
> observation, but a little digging showed this should not be the case
> here and the bug was diagnosed as an error due to changes of handling
> the wakeup list. Only applies to 5.7.x. Fixed.

Thanks you, this fix with the previous one fixes all my problems now
:)

Victor

signature.asc (196 bytes) Download Attachment

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T04:30:04Z

Hi Ulrich,

On Sunday 05 October 2008 02:01:33 Ulrich Neumerkel wrote:

> The current bug is that a syntactically failing unification still
> invokes accumulated unification-hooks in stead of failing.
>
> Sometimes this works, and sometimes not.
>
> g3> /opt/gupu/pl-57x/bin/pl -f none
> Welcome to SWI-Prolog (Multi-threaded, 64 bits, Version 5.7.1-46-g32a4502)
> ...
> ?- put_attr(V1,user,10),(V1,4)=(0,1).
> ERROR: uhook/3: Undefined procedure: attr_unify_hook/2

Is this a bug? Nobody says it is not allowed to call the wakeup in the
middle of a unify. I think implementations are allowed to do many things
with this code, including replacing it by 'fail'. SWI-Prolog 5.7 already
does a few of these. E.g. "_ = something" is simply replaced by `true'.
I'm still considering GCC-like warnings here, such as

'Goal has no effect'
'Goal always fails'

That was my first intuition and I still think that is a valid
observation, but a little digging showed this should not be the case
here and the bug was diagnosed as an error due to changes of handling
the wakeup list. Only applies to 5.7.x. Fixed.

Cheers --- Jan

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T03:07:53Z

On Saturday 04 October 2008 22:08:59 Bart Demoen wrote:

> > ?- A in 0..5, B in 6..7, memberchk(A, [B, C]).
> > false.
> >
> >
> > Shouldn't the last one return :
> > A = C,
> > C in 0..5,
> > B in 6..7.
> >
> > ?
>
> First a look at:
>
> ?- help(memberchk).
> memberchk(?Elem, +List)
> Equivalent to member/2, but leaves no choice point.
>
> This is enough to answer your question: yes, you are correct about
> your expectation.
>
> In fact, the implementation of pl_memberchk in pl-list.c cuts the
> choicepoint before executing woken goals. It is a bit tricky to get
> this correct (from within C), but currently it doesn't deliver what
> the manual promises I think. If memchk/2 is written in Prolog, you get
> what you expect.

Thanks Bart. There is a call foreignWakeup() that executes delayed calls
and can be used (only) at places where C code is about to do something
that is effectively a cut. Also used by (e.g.) \=. Fixed in 5.6.x and
merged into 5.7.x.

memberchk/2 is now getting a bit complicated and hopefully 5.7.x itself
will get fast enough someday to avoid the desire to write memberchk in C
:-). Setup and exit are a bit slower. Luckily the iteration over
non-unifying elements without attributes remains the same.

> How did you find this bug ?

I'm still surprised how obvious bugs remain unnoticed for years while
at the same time there are reports on very weird bugs.

--- Jan

_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-05T03:03:59Z

On Sun, Oct 05, 2008 at 08:39:53AM +0200, Bart Demoen wrote:
>
> Which version of SWI are you using ?
> Your queries give the expected results in Version 5.6.50.

It is written in the title : 5.7.X git (5.7.1-46-g32a4502-DIRTY)

:)

Victor

signature.asc (196 bytes) Download Attachment

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-04T23:39:53Z

Which version of SWI are you using ?
Your queries give the expected results in Version 5.6.50.

Cheers

Bart Demoen
_______________________________________________
SWI-Prolog mailing list
SWI-Prolog@...
https://mailbox.iai.uni-bonn.de/mailman/listinfo.cgi/swi-prolog

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-04T15:21:47Z

On Sat, Oct 04, 2008 at 10:08:59PM +0200, Bart Demoen wrote:

>
> > ?- A in 0..5, B in 6..7, memberchk(A, [B, C]).
> > false.
> >
> >
> > Shouldn't the last one return :
> > A = C,
> > C in 0..5,
> > B in 6..7.
> >
> > ?
>
> First a look at:
>
> ?- help(memberchk).
> memberchk(?Elem, +List)
> Equivalent to member/2, but leaves no choice point.
>
> This is enough to answer your question: yes, you are correct about
> your expectation.
>
> In fact, the implementation of pl_memberchk in pl-list.c cuts the
> choicepoint before executing woken goals. It is a bit tricky to get
> this correct (from within C), but currently it doesn't deliver what
> the manual promises I think. If memchk/2 is written in Prolog, you get
> what you expect.

I come back on this, I think it is is more complex than just
a pl_memberchk problem.

I tried with a real example from the running of my app and a
handmade definition of member and memberchk, and both have
problem. I think something wrong happens when unification is done
(maybe it has to do with the woken goals you are talking about, I
do know nothing about all of this :).

This is what I get :

?- _G656 in 19..135, _G1879 in 12..134, _G1228 in 19..133, _G3188 in 0..19, _G3189 in 0..9\/11..200, _G3190 in 0..200,
mymember(ass(start(_G3188, _G3189, 4, _G3190)), [ass(start(0, 1, 0, _G1228)), ass(start(0, 0, 4, _G656))]).
false.

and
?- _G656 in 19..135, _G1879 in 12..134, _G1228 in 19..133, _G3188 in 0..19, _G3189 in 0..9\/11..200, _G3190 in 0..200,
mymember(ass(start(_G3188, _G3189, 4, _G3190)), [ass(start(0, 0, 4, _G656))]).
_G656 = _G3190,
_G3188 = 0,
_G3189 = 0,
_G3190 in 19..135,
_G1879 in 12..134,
_G1228 in 19..133 ;
false.

With this definition for mymember :
mymember(Element, [Element| _]).
mymember(Element, [_| List]) :-
mymember(Element, List).

Thanks you for your help,

Victor

signature.asc (196 bytes) Download Attachment

Re: 5.7.X : problem with attributed variables and memberchk ?

2008-10-04T13:46:13Z

On Sat, Oct 04, 2008 at 10:08:59PM +0200, Bart Demoen wrote:

It is complicated to explain, in simple :
I have a big program using memberchk and it was not doing what it should
be doing :>

I tried for a long time understanding what happened, at first I
thought it was the constraints on the variables that were not
compatibles so the results would have been normal, but after a lot
of test (now I know how to make attributes(portray) for
write_term/2 works :) I reduced it to this little example.

The program is a general argumentation framework that combines
preference reasoning, abduction and constraint programming.
I am working on the inclusion of constraint programming to it, you
can take a look at if you want, there is a hg branch for it there :
https://dev.crazydwarves.org/trac/Gorgias

Regards,

Victor

signature.asc (196 bytes) Download Attachment