Frequently Asked Questions - Comp.Lang.Prolog
Total Page：16
File Type：pdf, Size：1020Kb
Load more
Recommended publications
-
Portability of Prolog Programs: Theory and Case-Studies
Portability of Prolog programs: theory and case-studies Jan Wielemaker1 and V´ıtorSantos Costa2 1 VU University Amsterdam, The Netherlands, [email protected] 2 DCC-FCUP & CRACS-INESC Porto LA Universidade do Porto, Portugal [email protected] Abstract. (Non-)portability of Prolog programs is widely considered as an important factor in the lack of acceptance of the language. Since 1995, the core of the language is covered by the ISO standard 13211-1. Since 2007, YAP and SWI-Prolog have established a basic compatibility framework. This article describes and evaluates this framework. The aim of the framework is running the same code on both systems rather than migrating an application. We show that today, the portability within the family of Edinburgh/Quintus derived Prolog implementations is good enough to allow for maintaining portable real-world applications. 1 Introduction Prolog is an old language with a long history, and its user community has seen a large number of implementations that evolved largely independently. This sit- uation is totally different from more recent languages, e.g, Java, Python or Perl. These language either have a single implementation (Python, Perl) or are con- trolled centrally (a language can only be called Java if it satisfies certain stan- dards [9]). The Prolog world knows dialects that are radically different, even with different syntax and different semantics (e.g., Visual Prolog [11]). Arguably, this is a handicap for the language because every publically available significant piece of code must be carefully examined for portability issues before it can be applied. As an anecdotal example, answers to questions on comp.lang.prolog typically include \on Prolog XYZ, this can be done using . -
WP-MIRROR 0.7.4 Reference Manual
WP-MIRROR 0.7.4 Reference Manual Dr. Kent L. Miller November 22, 2014 DRAFT 1 DRAFT 2 To Tylery DRAFT i WP-MIRROR 0.7.4 Reference Manual Legal Notices Copyright (C) 2012–2014 Dr. Kent L. Miller. All rights reserved. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled “GNU Free Documentation License”. THIS PUBLICATION AND THE INFORMATION HEREIN ARE FURNISHED AS IS, ARE FURNISHED FOR INFORMATIONAL USE ONLY, ARE SUBJECT TO CHANGE WITH- OUT NOTICE, AND SHOULD NOT BE CONSTRUED AS A COMMITMENT BY THE AU- THOR. THE AUTHOR ASSUMES NO RESPONSIBILITY OR LIABILITY FOR ANY ER- RORS OR INACCURACIES THAT MAY APPEAR IN THE INFORMATIONAL CONTENT CONTAINED IN THIS MANUAL, MAKES NO WARRANTY OF ANY KIND (EXPRESS, IMPLIED, OR STATUTORY) WITH RESPECT TO THIS PUBLICATION,AND EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES OF MERCHANTABILITY, FITNESS FOR PAR- TICULAR PURPOSES, AND NONINFRINGEMENT OF THIRD-PARTY RIGHTS. The WP-MIRROR logotype (see margin) was released by the author into the public domain on 2014-Apr-10. See https://www.mediawiki.org/wiki/File:Wp-mirror.png. This logotype fea- tures a sunflower that is derived from 119px-Mediawiki logo sunflower Tournesol 5x rev2.png, which is also in the public domain. See https://en.wikipedia.org/wiki/File:Mediawiki_logo_sunflower_Tournesol_5x.png. -
Staying Without Power a Case Study of the Drupal Content Management System by Qi Zhang
Staying without Power A Case Study of the Drupal Content Management System By Qi Zhang Bachelor of Science in Engineering, Jiangxi Science and Technology Normal University (1999) Interfaculty initiative in information studies program, University of Tokyo (2006) Master of international studies, University of Tokyo (2008) Submitted to the System Design and Management Program in Partial Fulfillment of the Requirements for the degree of Master of Science In EngIneerIng and Management ARCHNES At the A/SSACHUSETTS INS fW E OF TECHNOLOGY Massachusetts Institute of Technology AUG 20 2013 May 2012 y2012 RRARIES C 2012 Massachusetts Institute of Technology Signature of Author Qi Zhang Certified by -. Michael A. Cusumano SMR Distinguished Professor of Management T( esis Supervisor Certified by_ Patrick Hale Director System Design and Management Program THIS PAGE IS INTENTIONALLY LEFT BLANK Acknowledgements I run the knowledge that I learned from M.I.T the most wisdom school of the world. It works AMAZING! I would also like to thank Michael, Imran and Pat who staying with me when I am without power. Love in M.I.T; Love in USA XlApq, M31 THIS PAGE IS INTENTIONALLY LEFT BLANK Staying without Power By Qi Zhang Submitted to the System Design and Management Program in Partial Fulfillment of the Requirements for the degree of Master of Science In Engineering and Management ABSTRACT This main focus of this thesis is not to describe the inner workings of the Ecosystem or software; it is to help young entrepreneurs with limited resources to not just survive, but thrive in a competitive business environment. Thesis Supervisor: Michael A. -
Prolog Basics
Prolog basics A little background on Prolog Facts and queries "Can you prove it?" Atoms and numbers Predicates, terms, and structures Fact/query mismatches More queries Operators are structures Alternative representations Unification Query execution CSc 372, Fall 2006 Prolog, Slide 1 W. H. Mitchell ([email protected]) A little background on Prolog The name comes from "programming in logic". Developed at the University of Marseilles (France) in 1972. First implementation was in FORTRAN and written by Alain Colmeraurer. Originally intended as a tool for working with natural languages. Achieved great popularity in Europe in the late 1970s. Was picked by Japan in 1981 as a core technology for their "fifth generation" project. Prolog is a commercially successful language. Many companies have made a business of supplying Prolog implementations, Prolog consulting, and/or applications in Prolog. There are many free implementations of Prolog available. We'll be using SWI-Prolog. CSc 372, Fall 2006 Prolog, Slide 2 W. H. Mitchell ([email protected]) Facts and queries A Prolog program is a collection of facts, rules, and queries. We'll talk about facts first. Here is a small collection of Prolog facts: % cat foods.pl food('apple'). food('broccoli'). food('carrot'). food('lettuce'). food('rice'). These facts enumerate some things that are food. We might read them in English like this: "An apple is food", "Broccoli is food", etc. A fact represents a piece of knowledge that the Prolog programmer deems to be useful. The name food was chosen by the programmer. One alternative is edible('apple'). 'apple' is an example of an atom. -
Ada User Journal
ADA Volume 23 USER Number 3 JOURNAL September 2002 Contents Page Editorial Policy for Ada User Journal 122 Editorial 123 News 125 Conference Calendar 160 Forthcoming Events 167 Articles Michael Kersten, Joerg Matthes, Christian Fouda Manga, Stephan Zipser and Hubert B. Keller “Customizing UML for the Development of Distributed Reactive Systems and Ada 95 Code Generation” 175 Ada-Europe 2002 Sponsors 184 Ada-Europe Associate Members (National Ada Organizations) Inside Back Cover Ada User Journal Volume 23, Number 3, September 2002 122 Editorial Policy for Ada User Journal Publication Original Papers Commentaries Ada User Journal – The Journal for the Manuscripts should be submitted in We publish commentaries on Ada and international Ada Community – is accordance with the submission software engineering topics. These published by Ada-Europe. It appears guidelines (below). may represent the views either of four times a year, on the last days of individuals or of organisations. Such March, June, September and All original technical contributions are articles can be of any length – December. Copy date is the first of the submitted to refereeing by at least two inclusion is at the discretion of the month of publication. people. Names of referees will be kept Editor. confidential, but their comments will Opinions expressed within the Ada Aims be relayed to the authors at the User Journal do not necessarily discretion of the Editor. Ada User Journal aims to inform represent the views of the Editor, Ada- readers of developments in the Ada The first named author will receive a Europe or its directors. programming language and its use, complimentary copy of the issue of the general Ada-related software Journal in which their paper appears. -
Symbolic Analysis and Atomistic Model As a Basis for a Program Comprehension Methodology
JYVÄSKYLÄ STUDIES IN COMPUTING 90 Erkki Laitila Symbolic Analysis and Atomistic Model as a Basis for a Program Comprehension Methodology JYVÄSKYLÄN YLIOPISTO JYVÄSKYLÄ STUDIES IN COMPUTING 90 Erkki Laitila Symbolic Analysis and Atomistic Model as a Basis for a Program Comprehension Methodology Esitetään Jyväskylän yliopiston informaatioteknologian tiedekunnan suostumuksella julkisesti tarkastettavaksi yliopiston Agora-rakennuksessa (Ag Aud. 3) huhtikuun 26. päivänä 2008 kello 12. Academic dissertation to be publicly discussed, by permission of the Faculty of Information Technology of the University of Jyväskylä, in the Building Agora (Ag Aud. 3), on April 26, 2008 at 12 o'clock noon. UNIVERSITY OF JYVÄSKYLÄ JYVÄSKYLÄ 2008 Symbolic Analysis and Atomistic Model as a Basis for a Program Comprehension Methodology JYVÄSKYLÄ STUDIES IN COMPUTING 90 Erkki Laitila Symbolic Analysis and Atomistic Model as a Basis for a Program Comprehension Methodology UNIVERSITY OF JYVÄSKYLÄ JYVÄSKYLÄ 2008 Editors Tommi Kärkkäinen Department of Mathematical Information Technology, University of Jyväskylä Irene Ylönen, Marja-Leena Tynkkynen Publishing Unit, University Library of Jyväskylä Cover picture by Erkki Laitila URN:ISBN:978-951-39-3252-7 ISBN 978-951-39-3252-7 (PDF) ISBN 978-951-39-2908-4 (nid.) ISSN 1456-5390 Copyright ©2008 , by University of Jyväskylä Jyväskylä University Printing House, Jyväskylä 2008 3 ABSTRACT Laitila, Erkki Symbolic Analysis and Atomistic Model as a Basis for a Program Comprehension Methodology Jyväskylä: University of Jyväskylä, 2008, 326 p. (Jyväskylä Studies in Computing, ISSN 1456-5390; 90) ISBN 978-951-39-3252-7 (PDF), 978-951-39-2908-4 (nid.) Finnish summary Diss. Research on program comprehension (PC) is very important, because the amount of source code in mission-critical applications is increasing world-wide. -
Prolog: Beyond the Text & Summary
Prolog: Beyond the text & Summary Artificial Intelligence Programming in Prolog Lecturer: Tim Smith Lecture 18 29/11/04 29/11/04 AIPP Lecture 18: Beyond the Text & Summary 1 Contents • Prolog: Beyond the text – Tcl/tk – Java and prolog – Visual Prolog ~ COGENT * Will not be examined on ‘Beyond the text’. It presents advanced Prolog details beyond the specification of this course*. • Exam details • Lecture Summaries 29/11/04 AIPP Lecture 18: Beyond the Text & Summary 2 Creating Prolog GUIs • In AIPP we have only been using Prolog at the command line. • This makes it seem of limited use, more “retro”, compared to other languages, such as Java, which have significant graphical components. • But, Prolog does not have to be just textual! • Various techniques exists for creating Graphical User Interfaces (GUIs) for Prolog: – Tcl/tk – Jasper (Java interface) – Visual Basic (not discussed) – Visual Prologtm • Details on all of these available in the SICStus manual. http://www.sics.se/sicstus/docs/latest/html/sicstus.html/ 29/11/04 AIPP Lecture 18: Beyond the Text & Summary 3 Tcl/Tk • Tcl/Tk (“tickle/tee-kay”) – a scripting language and – toolkit for manipulating window based interfaces. • Very simple to code and quickly prototype cross- platform GUIs. • You might have come across Tcl/Tk on the HCI course. • SICStus Prolog contains a Tcl/Tk library (tcltk) which allows GUIs to be controlled and created: 1. The Prolog program loads the Tcl/Tk Prolog library, 2. creates a Tcl/Tk interpreter, and 3. sends commands to the interpreter to create a GUI. 4. The user interacts with the GUI and therefore with the underlying Prolog system. -
Visual Prolog Classes
Visual Prolog Version 5.x Language Tutorial (c) Copyright 1986-2001 Prolog Development Center A/S H.J. Holst Vej 3-5C, DK - 2605 Broendby, Copenhagen Denmark Copyright The documentation for this software is copyrighted, and all rights are reserved. It may not be reproduced, transmitted, stored in a retrieval system, or translated, either by electronic, mechanical or any other means, without the prior written consent of Prolog Development Center A/S. The software products described in these manuals are also copyrighted, and are licensed to the End User only for use in accordance with the End User License Agreement, which is printed on the diskette packaging. The prospective user should read this agreement carefully prior to use of the software. Visual Prolog is a registered trademark of Prolog Development Center A/S. Other brand and product names are trademarks or registered trademarks of their respective holders. Table of Contents Part 1 Introduction to Visual Prolog Chapter 1, Using Visual Prolog's Visual Development Environment What Needs to be Installed for This Book? ....................................................... 6 Starting the Visual Prolog's Visual Development Environment........................ 7 Creating the TestGoal Project for Running the Examples................................. 8 Opening an Editor Window ............................................................................. 11 Running and Testing a Program....................................................................... 11 Testing Language Tutorial Examples -
From Content to Knowledge: a Perspective on CMS**
AUTOMATYKA 2007 Tom 11 Zeszyt 12 Grzegorz J. Nalepa*, Antoni Ligêza*, Igor Wojnicki* From Content to Knowledge: a Perspective on CMS** 1. Introduction The Internet has become a single most important resource for instant information shar- ing. From the point of view of ordinary users it can be considered to constitute a very fle- xible and powerful version of the concept of the so-called blackboard architecture. The rapid growth of the Internet prompted a rapid development of specific software. This software addresses different aspects of information organization and interchange related issues, such as storing, retrieval, searching, indexing, aggregating, sharing, updating, etc. Taking into account the size and flexibility of the system as a whole, these problems consti- tute a real challenge. Content Management Systems (CMS for short) emerged as a technology providing a unified interface for large databases or data warehouses. In a broad sense a CMS consists of: a RDBMS (Relational Data Base System) which stores the data, and a complex web- based application or interface providing the access to the data. The web interface is built around using common web technologies. This software requires a proper and efficient run- time environment, including a web server. An important aspect of a CMS system is the possibility of user personalization, tracking, and interactive use. Today web technologies constitute an advanced and universal programming frame- work. This framework has a very heterogeneous structure including: data encoding and structuring languages (such as HTML and XML), meta-data languages (such as RDF), data transformation languages (such as XSL/T/FO), data presentation languages (such as CSS), server-side programming languages (such as PHP, JSP), and client-side programming lan- guages (such as Javascript). -
Prolog Language
Prolog Language #prolog Table of Contents About 1 Chapter 1: Getting started with Prolog Language 2 Remarks 2 Implementations 2 Examples 2 Installation or Setup 2 append/3 3 CLP(FD) Constraints 3 Database Programming 4 Hello, World 6 Hello, World in the interactive interpreter 6 Hello, World from a file 6 Chapter 2: Coding guidelines 8 Examples 8 Naming 8 Indentation 8 Order of arguments 8 Chapter 3: Constraint Logic Programming 10 Examples 10 CLP(FD) 10 CLP(Q) 10 CLP(H) 10 Chapter 4: Control structures 11 Examples 11 Disjunction (logical OR), implicit vs. explict 11 Conjunction (logical AND) 11 Cut (remove choice points) 11 Chapter 5: Data Structures 13 Examples 13 Lists 13 Pairs 13 Association lists 14 Terms 14 Terms with named fields using library(record) 14 Chapter 6: Definite Clause Grammars (DCGs) 16 Examples 16 Anything at all: `... //0` 16 Parsing with DCGs 16 Extra goals 16 Extra arguments 17 Chapter 7: Derivation trees 18 Examples 18 Proof tree 18 Chapter 8: Difference Lists 20 Introduction 20 Examples 20 Basic usage 20 Evaluate an arithmetic expression 21 Chapter 9: Error handling and exceptions 23 Examples 23 Instantiation errors 23 General points about error handling 23 Cleaning up after exceptions 23 Type and domain errors 23 Chapter 10: Extra-logical Predicates 25 Examples 25 Predicates with side effects 25 Meta-logical predicates 25 All-solutions predicates 25 !/0 and related predicates 25 Chapter 11: Higher-Order Programming 27 Examples 27 call/N predicates 27 maplist/[2,3] 27 Meta-call 27 foldl/4 27 Call a list of goals -
Working-With-Mediawiki-Yaron-Koren.Pdf
Working with MediaWiki Yaron Koren 2 Working with MediaWiki by Yaron Koren Published by WikiWorks Press. Copyright ©2012 by Yaron Koren, except where otherwise noted. Chapter 17, “Semantic Forms”, includes significant content from the Semantic Forms homepage (https://www. mediawiki.org/wiki/Extension:Semantic_Forms), available under the Creative Commons BY-SA 3.0 license. All rights reserved. Library of Congress Control Number: 2012952489 ISBN: 978-0615720302 First edition, second printing: 2014 Ordering information for this book can be found at: http://workingwithmediawiki.com All printing of this book is handled by CreateSpace (https://createspace.com), a subsidiary of Amazon.com. Cover design by Grace Cheong (http://gracecheong.com). Contents 1 About MediaWiki 1 History of MediaWiki . 1 Community and support . 3 Available hosts . 4 2 Setting up MediaWiki 7 The MediaWiki environment . 7 Download . 7 Installing . 8 Setting the logo . 8 Changing the URL structure . 9 Updating MediaWiki . 9 3 Editing in MediaWiki 11 Tabs........................................................... 11 Creating and editing pages . 12 Page history . 14 Page diffs . 15 Undoing . 16 Blocking and rollbacks . 17 Deleting revisions . 17 Moving pages . 18 Deleting pages . 19 Edit conflicts . 20 4 MediaWiki syntax 21 Wikitext . 21 Interwiki links . 26 Including HTML . 26 Templates . 27 3 4 Contents Parser and tag functions . 30 Variables . 33 Behavior switches . 33 5 Content organization 35 Categories . 35 Namespaces . 38 Redirects . 41 Subpages and super-pages . 42 Special pages . 43 6 Communication 45 Talk pages . 45 LiquidThreads . 47 Echo & Flow . 48 Handling reader comments . 48 Chat........................................................... 49 Emailing users . 49 7 Images and files 51 Uploading . 51 Displaying images . 55 Image galleries . -
Detailed Syllabus
SEMESTER 1 15XW11 CALCULUS AND ITS APPLICATIONS 3 2 0 4 BASIC CONCEPTS: Functions – Graphs, limit, continuity, jump discontinuity, piecewise continuity, periodic, differentiable, integrable, absolutely integrable functions. Fundamental theorem of calculus (statement only). Sequences – increasing, decreasing, bounded, function limit properties (No Proof). Series – convergence and divergence – alternating series test, absolute convergence – ratio test, power series. (7+5) FOURIER SERIES : Periodic waveforms, even and odd functions, orthogonality relations, Fourier series - Dirchlet’s conditions, statement of Fourier Theorem, Fourier Co-effecients – change of scale , Half range series, Parseval’s theorem – average power of a signal, RMS value, applications – frequency response of a linear system. (8+5) FUNCTIONS OF TWO VARIABLES: Introduction- partial derivative and its geometrical interpretation. Taylor series about a point - Maxima, minima - Constrained maxima and minima – Lagrange multiplier method. (7+5) INTEGRAL CALCULUS: Evaluation of multiple integrals - Change the order of integration - Application of multiple integrals to find area and volume - Beta and Gamma Integrals - Evaluation of definite integrals in terms of Beta and Gamma functions. (8+5) ORDINARY DIFFERENTIAL EQUATIONS OF FIRST ORDER: Modeling- Geometrical meaning- Exact differential equations, Integrating factors- linear differential equations, Bernouli equations - Applications to linear systems. (7+5) LINEAR DIFFERENTIAL EQUATIONS OF SECOND AND HIGHER ORDER: Homogeneous linear equations of second order and higher order equations with constant coefficients. Euler-Cauchy equation, Non-homogeneous equations, Solution by variation of parameter - Applications to linear systems. (8+5) Total L:45+T:30 = 75 TEXT BOOKS : 1. Erwin Kreyszig, “Advanced Engineering Mathematics”, John Wiley, 2014. 2. Maurice D. Weir, Joel Hass, Frank R. Giordano, “Thomas’ Calculus”, Pearson, 2013.