Ciao-users

ciao-users@cliplab.org

948 discussions

Special Semester on Groebner Bases and Related Methods 2006
by Alexander Zapletal 16 Aug '05

16 Aug '05

[ Please apologize for multiple postings ] I would like to invite you and your students to participate in the Special Semester on Gröbner Bases and Related Methods 2006, February July 2006 Linz and Hagenberg, Austria The special semester on Gröbner bases aims at bringing together researchers from all over the world for joint research on Gröbner bases and related theories and methods. Also, through the special semester, knowledge on these theories should be made available and disseminated in a new way that uses both recent advances in formalized mathematics as well as web technol-ogy. Part of the effort during the special semester will also go into special lectures, tutorials, and training and, after the special semester, events for the dissemination of the research re-sults will be organized. Both established researchers as well as junior researchers, postdocs, and PhD students are welcome to participate in the activities of the special semester. For details and application, see: http://www.ricam.oeaw.ac.at/srs/groeb/ A low resolution version of our poster is attached. You can download the high resolution version from our webpage. Yours sincerely, Bruno Buchberger (Chair) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Alexander Zapletal, Dipl.-Ing. Scientific Assistant of Professor Buchberger Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences Altenbergerstraße 69 A-4040 Linz, Austria Phone office: ++43 732 2468 9983 E-mail: alexander.zapletal(a)oeaw.ac.at

1 0

Teams or equivalent?
by Ryan Kelly 16 Aug '05

16 Aug '05

Hi, I am interested in trying out the "Teams" functionality described in the paper "Implementing Distributed Concurrent Constraint Execution in the CIAO System", whereby distributed processes cooperate in the execution of a goal: http://clip.dia.fi.upm.es/papers/ciao-dis-impl-prode_bitmap.pdf I've found the concurrency primitives such as &> and <& in the library module "hlc", but I cannot find how to access predicates such as add_worker(Host,Id) which control the available workers. Has this functionality changed form since the above paper was produced, or am I simply not looking in the right place? As some background, I am a Masters student at the University of Melbourne, Australia, working on programming languages for multi-agent systems. Thanks for any help you can offer, Ryan ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

2 1

PADL 2006: Final Call For Papers
by Logic Programming Rsrch Association 16 Aug '05

16 Aug '05

----------------------------------------------------------------------------- CALL FOR PAPERS!!! Eighth International Symposium on Practical Aspects of Declarative Languages 2006 (PADL '06) http://www.cs.brown.edu/people/pvh/PADL06.html Charleston Place Hotel Charleston, South Carolina January 9-10 Co-located with ACM POPL'06 Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to vastly different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raises numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include: * innovative applications of declarative languages; * declarative domain-specific languages and applications; * practical applications of theoretical results; * new language developments & their impact on applications; * evaluation of implementation techniques on practical applications; * novel uses of declarative languages in the classroom; and * practical experiences PADL 06 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages, and is not limited to the scope of the past five PADL symposia. PADL 06 will be co-located with the ACM POPL. IMPORTANT DATES AND SUBMISSION GUIDELINES Paper Submission: August 20, 2005 Notification: September 30, 2005 Final Manuscript: October 20, 2005 Symposium: January 9-10, 2005 Authors should submit an electronic copy of the full paper (written in English) in Postscript (Level 2) or PDF. Papers must be no longer than 15 pages, written in 11-point font and with single spacing. Since the final proceedings will be published as Lecture Notes in Computer Science by Springer Verlag, authors are strongly encouraged to use the LNCS paper formatting guidelines for their submission. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email and postal addresses, telephone and fax numbers, abstract, and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chair for information on how to submit hard copies. MOST PRACTICAL PAPER AWARD The Most Practical Paper award will be given to the submission that is judged by the programm committee to be the best in terms of practicality, originality, and clarity of presentation. The program committee may choose not to make an award; or may make multiple awards. PROGRAM COMMITTEE: Kenichi Asai Ochanomizu University, Japan Daniel Damien BRICS, Denmark Mireille Ducasse IRISA/INSA of Rennes, France Matthew Flatt University of Utah, US Gopal Gupta University at Texas at Dallas, US Manuel Hermenegildo UP Madrid, Spain Paul Hudak Yale University, US Narendra Jusien Ecole des Mines de Nantes, France Laurent Michel University of Connecticut, US Enrico Pontelli New Mexico State University Gopalan Nadathur U. of Minnesota, US Vitor Santos-Costa U. Federal do Rio de Janeiro, Brazil Christian Schulte Royal Institute of Technology, Sweden Peter Stuckey U. of Melbourne, Australia Pascal Van Hentenryck Brown University, US Peter van Roy U. of Louvain, Belgium David S. Warren SUNY at Stony Brook, US Roland Yap National U. of Singapore, Singapore Contacts: For information about papers and submissions, please contact the Program Chair: Pascal van Hentenryck PC Chair - PADL 2006 Department of Computer Science Brown University Providence, RI, U.S.A. Email: pvh(a)cs.brown.edu For other information about the conference and the summer school, please contact: Gopal Gupta Department of Computer Science University at Texas at Dallas Dallas, TX, U.S.A. Email: gupta(a)utdallas.edu Sponsored by COMPULOG Americas (http://www.cs.nmsu.edu/~complog). ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

Compilation on Linux/amd64?
by Ryan Kelly 03 Aug '05

03 Aug '05

Hi, I've had about a half-hour go at getting the latest Ciao release to compile on my Gentoo Linux system, with is running on an Athlon64 procressor (so the architecture is x86_64). According to ciao_get_arch this platform is not known to the installation procedure. I had some limited success getting the compile running, but there seem to be a few issues with the platform, such as the fact that sizeof(long) is not 4 which violates some assertions in the source code. I'm happy to work towards getting things compiling smoothly on this platform, but before I go hacking around too much I was wondering if anyone has already had success or any experience getting things working on such a platform? Thanks, Ryan -- Ryan Kelly http://www.rfk.id.au | This message is digitally signed. Please visit ryan(a)rfk.id.au | http://www.rfk.id.au/ramblings/gpg/ for details

1 0

Teams or equivalent?
by Ryan Kelly 03 Aug '05

03 Aug '05

1 0

Unexpected behavior solving a FD benchmark with 10 equations
by afdez＠lcc.uma.es 20 Jul '05

20 Jul '05

Hi, I am using the finite domain (FD) constraint solving library of Ciao Prolog 1.10#5. I am trying to solve a system of 10 equations (code directly adapted from GNU Prolog - I attach the Ciao code below). If I use the FD constraint library of SICSTus as well GNU Prolog I correctly obtain the answer [6,0,8,4,9,3,9]. However, if I use the FD constraint library of Ciao Prolog, I receive a 'no' answer (indicating that this system has no solution). My code in Ciao Prolog for this benchmark is quite similar to that provided in the file crypta.pl (that is an example file provided in the distribution of the Ciao system). Is my code incorrect? If the answer is 'no', then, is the unexpected answer due to a limitation of the FD constraint library? thanks in advance for your attention, best regards, Antonio ================================================ *-------------------------------------------------------------------------*/ /* Benchmark (Finite Domain) */ /* */ /* Name : eq10.pl */ /* Title : linear equations */ /* Original Source: Thomson LCR */ /* Adapted to GNU Prolog by : Daniel Diaz log */ /* Date : September 1992 */ /* */ /* Adapted to Ciao Prolog by : Antonio J. Fernández (Málaga University) */ /* Date : July 2005 */ /* */ /* */ /* A system involving 7 variables and 10 equations */ /* */ /* Solution: */ /* [X1,X2,X3,X4,X5,X6,X7] */ /* [ 6, 0, 8, 4, 9, 3, 9] */ /*-------------------------------------------------------------------------*/ :- use_package(fd). :- use_module(library(prolog_sys), [statistics/2]). :- use_module(library(format)). q(Ls) :- statistics(runtime,_), eq10(Ls), statistics(runtime,[_, Time]), format("Used ~d milliseconds~n", Time). eq10(LD):- LD = [X1,X2,X3,X4,X5,X6,X7], LD in 0..10, 0+98527*X1+34588*X2+5872*X3+59422*X5+65159*X7 .=. 1547604+30704*X4+29649*X6, 0+98957*X2+83634*X3+69966*X4+62038*X5+37164*X6+85413*X7 .=. 1823553+93989*X1, 900032+10949*X1+77761*X2+67052*X5 .=. 0+80197*X3+61944*X4+92964*X6+44550*X7, 0+73947*X1+84391*X3+81310*X5 .=. 1164380+96253*X2+44247*X4+70582*X6+33054*X7, 0+13057*X3+42253*X4+77527*X5+96552*X7 .=. 1185471+60152*X1+21103*X2+97932*X6, 1394152+66920*X1+55679*X4 .=. 0+64234*X2+65337*X3+45581*X5+67707*X6+98038*X7, 0+68550*X1+27886*X2+31716*X3+73597*X4+38835*X7 .=. 279091+88963*X5+76391*X6, 0+76132*X2+71860*X3+22770*X4+68211*X5+78587*X6 .=. 480923+48224*X1+82817*X7, 519878+94198*X2+87234*X3+37498*X4 .=. 0+71583*X1+25728*X5+25495*X6+70023*X7, 361921+78693*X1+38592*X5+38478*X6 .=. 0+94129*X2+43188*X3+82528*X4+69025*X7, labeling(LD). -------------------------------- Webmail de SATD usando IlohaMail ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

dynamic loading problem
by Omar Nabil El Khatib 20 Jul '05

20 Jul '05

Hi all, I have a question. I want to load a file at runtime. See the example below: % file 1: pp1.pl :- module(pp1, [m/0]). :- use_module(library(compiler)). m :- use_module(pp2, [test/0, s/1]), pp2:test, pp2:s(2), use_module(pp3), pp3:test, pp3:s(3). % file: pp2.pl :- module(pp2, [test/0, s/1]). test :- message(['pp2']). s(X) :- message(['pp2:', X]). % file: pp3.pl :- module(pp3, [test/0, s/1]). test :- message(['pp3']). s(X) :- message(['pp3:', X]). When loading pp1.pl from ciao, the following error message appears: ?- use_module(pp1). {Compiling /cygdrive/d/pp1.pl ERROR: Bad module qualification of test/0, predicate not imported form module pp2 ERROR: Bad module qualification of s/1, predicate not imported form module pp2 ERROR: Bad module qualification of test/0, predicate not imported form module pp3 ERROR: Bad module qualification of s/1, predicate not imported form module pp3 } ?- yes Can anyone tell me why the above program does not work. Respectively Omar. ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

4 3

Fuzzy prolog =>
by Roman Komp 20 Jul '05

20 Jul '05

Hello, has anybody already tried to work with the ciao fuzzy prolog? I think, the implication-operator doesn't work properly. In all the examples included with the installtion of ciao, as well as in my own, I don't get any meaningful results when I try to use the => operator. Why is that? I tried for example the following: jung :# fuzzy_predicate[(0,1),(20,1),(30,0),(100,0)]. viel_schlafen :# fuzzy_predicate[(0,0),(5,0),(6,0.25),(8,1),(12,1)]. braucht(Alter,Stunden,M) :~ '=>'(min,jung(Alter,_),viel_schlafen (Stunden,_),M). But I never get a value for M. In the examples included it's the same problem, ciao only tells me that M must be between 0 and 1. What's wrong? Greetings, Roman ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

Fuzzy Prolog - dprod
by Roman Komp 20 Jul '05

20 Jul '05

Hello ciao users! I have a question concerning the fuzzy prolog chapter (105.4) in the ciao manual. It gives an example programm to determine the possibility that i throw a five with two loaded dice. But the program, resp. the dprod-aggregator in particular, doesn't work correctly. The solution (which, imho, should be 0.853) isn't computed. Another thing is, that the suggested query produces hundreds of output lines. I'm new to prolog, so I don't know the tricks. Is there a way to suppress duplicate output? (I certainly hope so!) Greetings from Koblenz, Germany, Roman ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

ICLP 2005: Call for Participation
by ICLP 2005 18 Jul '05

18 Jul '05

Dear Colleague, Please note that ICLP 2005 registration is now open. In fact, the early registration deadline is not too far (July 31st). More details can be found at the ICLP 2005 website: http://www.iiia.csic.es/iclp2005/ Highlights include invited talks by Ian Horrocks, Peter Stuckey, Francesca Rossi, a tutorial on "Inductive Logic Programmng, Statistical Relational Learning and its applications" by Vitor Santos Costa, contributed papers, posters, programming competition, panels, conference workshops, and of course the Solar Eclipse that will take place during the conference and will be visible in Barcelona (time has been set aside during the conference to view the eclipse). We look forward to seeing all of you in Barcelona. Best wishes, Gopal Gupta and Maurizio Gabbrielli ---------------------------------------------------------------------- LIST OF ACCEPTED PAPERS: ---------------------- Full papers (26 papers) ----------------------- Use of Logic Programming for Complex Business Rules Walter Wilson Semantics of Framed Temporal Logic Programs Zhenhua Duan, Xiaoxiao Yang and Maciej Koutny. On the relation between Answer Set and SAT procedures (or, between smodels and cmodels) Enrico Giunchiglia and Marco Maratea. HYPROLOG: a new logic programming language with assumptions and abduction Henning Christiansen and Veronica Dahl. A Generator of Efficient Abstract Machine Implementations and its Application to Emulator Minimization Jose Morales, Manuel Carro, German Puebla and Manuel Hermenegildo. Nondeterminism Analysis of Functional Logic Programs Bernd Brabel and Michael Hanus. Testing for Termination with Size Change Graphs Michael Codish, Vitaly Lagoon and Peter Stuckey. Towards an Integration of Answer Set and Constraint Solving Sabrina Baselice, Piero A. Bonatti and Michael Gelfond. Symbolic Support Graph: A Space Efficient Data Structure For Incremental Tabled Evaluation Diptikalyan Saha and C. R. Ramakrishnan. Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming Hans Tompits and Stefan Woltran. Hybrid Probabilistic Logic Programs With Non-monotonic Negation Emad Saad and Enrico Pontelli. Reducing Inductive Definitions to Propositional Satisfiability Nikolay Pelov and Eugenia Ternovska. A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems Agostino Dovier, Andrea Formisano and Enrico Pontelli. A Well-Founded Semantics with Disjunction Joao Alcantara, Carlos Damasio and Luis Moniz Pereira. An optimised Semantic Web query language implementation in Prolog Jan Wielemaker. Practical Higher-Order Pattern Unification via On-the-Fly Raising Gopalan Nadathur and Natalie Linnell. Dynamic Mixed-Strategy Evaluation of Tabled Logic Programs Ricardo Rocha, Fernando Silva and Vitor Santos Costa. Small proof witnesses for LF Susmit Sarkar, Brigitte Pientka and Karl Crary. Guard and Continuation Optimization for Occurrence Representations of CHR Jon Sneyers, Tom Schrijvers and Bart Demoen. Abduction of Linear Arithmetic Constraints Michael Maher. Coordination of Many Agents Joxan Jaffar, Roland Yap and Kenny Zhu. Parallelizing Union-Find in Constraint Handling Rules Using Confluence Thom Fruehwirth. Luca Bortolussi and Herbert Wiklicky. A Distributed and Probabilistic Concurrent Constraint Programming Language Deductive Multi-valued Model Checking Ajay Mallya. Techniques for Scaling Up Analyses Based on Pre-Interpretations John P. Gallagher, Kim Henriksen and Gourinath Banda. Polynomial Interpretations as a Basis for Termination An Manh Thang Nguyen and Danny De Schreye. ----------------------------- Accepted posters (18 posters) ----------------------------- Inconsistency-based Strategy For Clarifying Vague Software Requirements Kedian Mu, Zhi Jin and Ruqian Lu. A Type System for CHR Emmanuel Coquery and Francois Fages. Decision Support for Personalization on Mobile Devices Thomas Kleemann and Alex Sinner. Algorithms for FO(ID) model generation Maarten Marikn, Rudradeb Mitra and Marc Denecker. Abstract Interpretation with Specialized Definitions German Puebla, Elvira Albert and Manuel Hermenegildo. Induction of causal ramifications for action descriptions in ASP Ramon Otero. The need for Ancestor Resolution when answering queries in Horn Clause Logic Oliver Ray. Modeling Systems in CLP with Coinductive Tabling Joxan Jaffar, Andrew Edward Santosa and Razvan Voicu. A Sufficient Condition for Strong Equivalence under the Well-Founded Semantics Chistos Nomikos, Panos Rondogiannis and William Wadge. Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary Tom Schrijvers. IMPACT: Innovative Models for Prolog with Advanced Control and Tabling Ricardo Rocha, Ricardo Lopes, Fernando Silva and Vitor Santos Costa. Using CLP to characterise linguistic lattice boundaries in a text mining process Alexandre Saidi. Hybridization of Genetic Algorithms and Constraint Propagation for the BACP Tony Lambert, Carlos Castro, Eric Monfroy, Maria Cristina Riff and Fridiric Saubion. The MYDDAS Project: Using a Deductive Database for Traffic Characterization Michel Ferreira. Open World Reasoning in Datalog Gergely Lukacsy and Zsolt Nagy. Optimizing Queries for Heterogeneous Information Sources Andras Gyvrgy Bikis. Denotational semantics using Horn Concurrent Transaction Logic Marcus Santos. Gentra4cp: a Generic Trace Format for Constraint Programming Ludovic Langevine and The OADymPPaC team. ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

← Newer
1
...
49
50
51
52
53
54
55
...
95
Older →

Jump to page:

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