Ciao-users February 2000

ciao-users@cliplab.org

1 participants
2 discussions

predicate_property/2 in CIAO 1.0pl7
by Paulo Jorge Lopes de Moura 04 Jul '00

04 Jul '00

Hi, I need a way to find if a given predicate is dynamic, static or built-in. The Reference Manual lists the usual predicate_property/2 but does not enumerate the possible predicate properties. Can someone provide me with some more info or a possible solution? Thanks. Regards, Paulo ----------------------------------------------------------- Paulo Jorge Lopes de Moura Dep. of Mathematics and Informatics Office 4.32 University of Beira Interior Phone: +351 75 319700 6200 Covilhc Fax: +351 75 319732 Portugal mailto:pmoura(a)noe.ubi.pt http://www.ci.uc.pt/logtalk/pmoura.html -----------------------------------------------------------

3 2

Try Constraint Handling Rules Online
by Thom Fruehwirth 09 Feb '00

09 Feb '00

Constraint Handling Rules (CHR) are available free and online now at: http://www.pms.informatik.uni-muenchen.de/~webchr/ Click on the link above to run the latest release of CHR in Sicstus Prolog on our server. Choose among dozens of constraint solvers written in CHR. Ask any query. Or even write your own constraint solvers. CHR are a rule-based high-level language to write constraint systems. CHR make it easy to define constraint reasoning: simplification and propagation as well as incremental solving (satisfaction) of constraints. Also, CHR have been successfully used as general purpose concurrent constraint language with ask and tell, as fairly efficient production rule system, as special kind of theorem prover, as system combining forward and backward chaining, as high-level language for manipulating attributed variables. CHR are essentially a committed-choice language consisting of guarded rules with multiple head atoms. CHR define simplification of, and propagation over, constraints. Simplification rewrites constraints to simpler constraints while preserving logical equivalence (e.g. X>Y,Y>X <=> false). Propagation adds new constraints which are logically redundant but may cause further simplification (e.g. X>Y,Y>Z ==> X>Z). Repeatedly applying the rules incrementally solves constraints (e.g. A>B,B>C,C>A leads to false). With multiple heads and propagation rules, CHR provide two features which are essential for non-trivial constraint handling. Test-Drive CHR. Run CHR online. Do a demo. Try it out now! Thom Fruehwirth

1 0

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

Ciao-users February 2000