DOCSLIB.ORG

YAP User's Manual

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
YAP User's Manual YAP User's Manual Version 6.2.2 V´ıtorSantos Costa, Lu´ısDamas, Rog´erioReis, and R´uben Azevedo Copyright c 1989-2000 L. Damas, V. Santos Costa and Universidade do Porto. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the con- ditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another lan- guage, under the above conditions for modified versions. i Table of Contents Introduction :::::::::::::::::::::::::::::::::::::::: 1 1 Installing YAP :::::::::::::::::::::::::::::::::: 3 1.1 Tuning the Functionality of YAP ::::::::::::::::::::::::::::::: 3 1.2 Tuning YAP for a Particular Machine and Compiler :::::::::::: 4 1.3 Tuning YAP for GCC. ::::::::::::::::::::::::::::::::::::::::::: 4 1.3.1 Compiling Under Visual C++ ::::::::::::::::::::::::::::: 6 1.3.2 Compiling Under SGI's cc ::::::::::::::::::::::::::::::::: 7 2 Running YAP ::::::::::::::::::::::::::::::::::: 9 2.1 Running YAP Interactively ::::::::::::::::::::::::::::::::::::: 9 2.2 Running Prolog Files:::::::::::::::::::::::::::::::::::::::::: 10 3 Syntax:::::::::::::::::::::::::::::::::::::::::: 13 3.1 Syntax of Terms :::::::::::::::::::::::::::::::::::::::::::::: 13 3.2 Prolog Tokens::::::::::::::::::::::::::::::::::::::::::::::::: 14 3.2.1 Numbers ::::::::::::::::::::::::::::::::::::::::::::::::: 14 3.2.1.1 Integers ::::::::::::::::::::::::::::::::::::::::::::: 14 3.2.1.2 Floating-point Numbers ::::::::::::::::::::::::::::: 15 3.2.2 Character Strings :::::::::::::::::::::::::::::::::::::::: 15 3.2.3 Atoms ::::::::::::::::::::::::::::::::::::::::::::::::::: 16 3.2.4 Variables::::::::::::::::::::::::::::::::::::::::::::::::: 16 3.2.5 Punctuation Tokens :::::::::::::::::::::::::::::::::::::: 17 3.2.6 Layout ::::::::::::::::::::::::::::::::::::::::::::::::::: 17 3.3 Wide Character Support :::::::::::::::::::::::::::::::::::::: 17 3.3.1 Wide character encodings on streams ::::::::::::::::::::: 17 3.3.2 BOM: Byte Order Mark :::::::::::::::::::::::::::::::::: 19 4 Loading Programs ::::::::::::::::::::::::::::: 21 4.1 Program loading and updating :::::::::::::::::::::::::::::::: 21 4.2 Changing the Compiler's Behavior::::::::::::::::::::::::::::: 22 4.3 Conditional Compilation :::::::::::::::::::::::::::::::::::::: 26 4.4 Saving and Loading Prolog States ::::::::::::::::::::::::::::: 27 5 The Module System ::::::::::::::::::::::::::: 29 5.1 Module Concepts ::::::::::::::::::::::::::::::::::::::::::::: 29 5.2 Defining a New Module ::::::::::::::::::::::::::::::::::::::: 30 5.3 Using Modules :::::::::::::::::::::::::::::::::::::::::::::::: 30 5.4 Meta-Predicates in Modules ::::::::::::::::::::::::::::::::::: 31 5.5 Re-Exporting Predicates From Other Modules ::::::::::::::::: 32 ii YAP Prolog User's Manual 6 Built-In Predicates :::::::::::::::::::::::::::: 33 6.1 Control Predicates :::::::::::::::::::::::::::::::::::::::::::: 33 6.2 Handling Undefined Procedures ::::::::::::::::::::::::::::::: 37 6.3 Message Handling ::::::::::::::::::::::::::::::::::::::::::::: 39 6.4 Predicates on terms ::::::::::::::::::::::::::::::::::::::::::: 40 6.5 Predicates on Atoms :::::::::::::::::::::::::::::::::::::::::: 42 6.6 Predicates on Characters :::::::::::::::::::::::::::::::::::::: 44 6.7 Comparing Terms ::::::::::::::::::::::::::::::::::::::::::::: 46 6.8 Arithmetic :::::::::::::::::::::::::::::::::::::::::::::::::::: 47 6.9 I/O Predicates :::::::::::::::::::::::::::::::::::::::::::::::: 53 6.9.1 Handling Streams and Files :::::::::::::::::::::::::::::: 53 6.9.2 Handling Streams and Files :::::::::::::::::::::::::::::: 58 6.9.3 Handling Input/Output of Terms ::::::::::::::::::::::::: 59 6.9.4 Handling Input/Output of Characters :::::::::::::::::::: 65 6.9.5 Input/Output Predicates applied to Streams:::::::::::::: 66 6.9.6 Compatible C-Prolog predicates for Terminal I/O::::::::: 67 6.9.7 Controlling Input/Output :::::::::::::::::::::::::::::::: 68 6.9.8 Using Sockets From YAP ::::::::::::::::::::::::::::::::: 69 6.10 Using the Clausal Data Base ::::::::::::::::::::::::::::::::: 71 6.10.1 Modification of the Data Base ::::::::::::::::::::::::::: 71 6.10.2 Looking at the Data Base ::::::::::::::::::::::::::::::: 73 6.10.3 Using Data Base References ::::::::::::::::::::::::::::: 74 6.11 Internal Data Base ::::::::::::::::::::::::::::::::::::::::::: 75 6.12 The Blackboard:::::::::::::::::::::::::::::::::::::::::::::: 78 6.13 Collecting Solutions to a Goal :::::::::::::::::::::::::::::::: 78 6.14 Grammar Rules :::::::::::::::::::::::::::::::::::::::::::::: 80 6.15 Access to Operating System Functionality :::::::::::::::::::: 81 6.16 Term Modification ::::::::::::::::::::::::::::::::::::::::::: 84 6.17 Global Variables ::::::::::::::::::::::::::::::::::::::::::::: 84 6.18 Profiling Prolog Programs:::::::::::::::::::::::::::::::::::: 87 6.18.1 The Count Profiler :::::::::::::::::::::::::::::::::::::: 87 6.18.2 Tick Profiler :::::::::::::::::::::::::::::::::::::::::::: 88 6.19 Counting Calls ::::::::::::::::::::::::::::::::::::::::::::::: 89 6.20 Arrays ::::::::::::::::::::::::::::::::::::::::::::::::::::::: 90 6.21 Predicate Information :::::::::::::::::::::::::::::::::::::::: 92 6.22 Miscellaneous :::::::::::::::::::::::::::::::::::::::::::::::: 92 7 Library Predicates ::::::::::::::::::::::::::: 107 7.1 Aggregate ::::::::::::::::::::::::::::::::::::::::::::::::::: 107 7.2 Apply Macros:::::::::::::::::::::::::::::::::::::::::::::::: 109 7.3 Association Lists ::::::::::::::::::::::::::::::::::::::::::::: 109 7.4 AVL Trees ::::::::::::::::::::::::::::::::::::::::::::::::::: 110 7.5 Heaps ::::::::::::::::::::::::::::::::::::::::::::::::::::::: 111 7.6 List Manipulation:::::::::::::::::::::::::::::::::::::::::::: 112 7.7 Line Manipulation Utilities::::::::::::::::::::::::::::::::::: 114 7.8 Maplist :::::::::::::::::::::::::::::::::::::::::::::::::::::: 115 7.9 Matrix Library::::::::::::::::::::::::::::::::::::::::::::::: 117 7.10 MATLAB Package Interface::::::::::::::::::::::::::::::::: 120 iii 7.11 Non-Backtrackable Data Structures ::::::::::::::::::::::::: 122 7.12 Ordered Sets:::::::::::::::::::::::::::::::::::::::::::::::: 123 7.13 Pseudo Random Number Integer Generator ::::::::::::::::: 124 7.14 Queues ::::::::::::::::::::::::::::::::::::::::::::::::::::: 125 7.15 Random Number Generator::::::::::::::::::::::::::::::::: 126 7.16 Read Utilities::::::::::::::::::::::::::::::::::::::::::::::: 126 7.17 Red-Black Trees :::::::::::::::::::::::::::::::::::::::::::: 127 7.18 Regular Expressions :::::::::::::::::::::::::::::::::::::::: 129 7.19 SWI-Prolog's shlib library::::::::::::::::::::::::::::::::::: 131 7.20 Splay Trees ::::::::::::::::::::::::::::::::::::::::::::::::: 132 7.21 Reading From and Writing To Strings ::::::::::::::::::::::: 133 7.22 Calling The Operating System from YAP ::::::::::::::::::: 134 7.23 Utilities On Terms :::::::::::::::::::::::::::::::::::::::::: 138 7.24 Trie DataStructure ::::::::::::::::::::::::::::::::::::::::: 139 7.25 Call Cleanup ::::::::::::::::::::::::::::::::::::::::::::::: 140 7.26 Calls With Timeout :::::::::::::::::::::::::::::::::::::::: 142 7.27 Updatable Binary Trees::::::::::::::::::::::::::::::::::::: 142 7.28 Unweighted Graphs ::::::::::::::::::::::::::::::::::::::::: 143 7.29 Directed Graphs :::::::::::::::::::::::::::::::::::::::::::: 146 7.30 Undirected Graphs:::::::::::::::::::::::::::::::::::::::::: 148 7.31 Lambda Expressions :::::::::::::::::::::::::::::::::::::::: 149 7.32 LAM ::::::::::::::::::::::::::::::::::::::::::::::::::::::: 150 7.33 Block Diagram:::::::::::::::::::::::::::::::::::::::::::::: 152 8 SWI-Prolog Emulation::::::::::::::::::::::: 153 8.1 Invoking Predicates on all Members of a List ::::::::::::::::: 154 8.2 Forall :::::::::::::::::::::::::::::::::::::::::::::::::::::::: 154 9 SWI Global variables :::::::::::::::::::::::: 155 9.1 Compatibility of Global Variables :::::::::::::::::::::::::::: 156 10 Extensions to Prolog ::::::::::::::::::::::: 157 10.1 Rational Trees :::::::::::::::::::::::::::::::::::::::::::::: 157 10.2 Co-routining :::::::::::::::::::::::::::::::::::::::::::::::: 157 11 Attributed Variables:::::::::::::::::::::::: 159 11.1 hProlog and SWI-Prolog style Attribute Declarations :::::::: 159 11.2 SICStus Prolog style Attribute Declarations ::::::::::::::::: 162 11.2.1 Attribute Declarations ::::::::::::::::::::::::::::::::: 162 11.2.2 Attribute Manipulation :::::::::::::::::::::::::::::::: 163 11.2.3 Attributed Unification ::::::::::::::::::::::::::::::::: 163 11.2.4 Displaying Attributes :::::::::::::::::::::::::::::::::: 164 11.2.5 Projecting Attributes :::::::::::::::::::::::::::::::::: 164 11.2.6 Attribute Examples :::::::::::::::::::::::::::::::::::: 164 iv YAP Prolog User's Manual 12 Constraint Logic Programming over Reals ::::::::::::::::::::::::::::::::::::::::::::::: 169 12.1 Solver Predicates ::::::::::::::::::::::::::::::::::::::::::: 169 12.2 Syntax of the predicate arguments :::::::::::::::::::::::::: 170 12.3 Use of unification ::::::::::::::::::::::::::::::::::::::::::: 171 12.4 Non-Linear Constraints ::::::::::::::::::::::::::::::::::::: 171 13 CHR: Constraint Handling Rules ::::::::: 173 13.1 Introduction :::::::::::::::::::::::::::::::::::::::::::::::: 173 13.2 Syntax and Semantics::::::::::::::::::::::::::::::::::::::: 173
Load more

Recommended publications
  • Utgåvenoteringar För Fedora 11
    Fedora 11 Utgåvenoteringar Utgåvenoteringar för Fedora 11 Dale Bewley Paul Frields Chitlesh Goorah Kevin Kofler Rüdiger Landmann Ryan Lerch John McDonough Dominik Mierzejewski David Nalley Zachary Oglesby Jens Petersen Rahul Sundaram Miloslav Trmac Karsten Wade Copyright © 2009 Red Hat, Inc. and others. The text of and illustrations in this document are licensed by Red Hat under a Creative Commons Attribution–Share Alike 3.0 Unported license ("CC-BY-SA"). An explanation of CC-BY-SA is available at http://creativecommons.org/licenses/by-sa/3.0/. The original authors of this document, and Red Hat, designate the Fedora Project as the "Attribution Party" for purposes of CC-BY-SA. In accordance with CC-BY-SA, if you distribute this document or an adaptation of it, you must provide the URL for the original version. Red Hat, as the licensor of this document, waives the right to enforce, and agrees not to assert, Section 4d of CC-BY-SA to the fullest extent permitted by applicable law. Red Hat, Red Hat Enterprise Linux, the Shadowman logo, JBoss, MetaMatrix, Fedora, the Infinity Logo, and RHCE are trademarks of Red Hat, Inc., registered in the United States and other countries. 1 Utgåvenoteringar For guidelines on the permitted uses of the Fedora trademarks, refer to https:// fedoraproject.org/wiki/Legal:Trademark_guidelines. Linux® is the registered trademark of Linus Torvalds in the United States and other countries. Java® is a registered trademark of Oracle and/or its affiliates. XFS® is a trademark of Silicon Graphics International Corp. or its subsidiaries in the United States and/or other countries.
    [Show full text]
  • Translingual Obfuscation
    Translingual Obfuscation Pei Wang, Shuai Wang, Jiang Ming, Yufei Jiang, and Dinghao Wu College of Information Sciences and Technology The Pennsylvania State University fpxw172, szw175, jum310, yzj107, [email protected] Abstract—Program obfuscation is an important software pro- Currently the state-of-the-art obfuscation technique is to tection technique that prevents attackers from revealing the incorporate with process-level virtualization. For example, programming logic and design of the software. We introduce obfuscators such as VMProtect [10] and Code Virtualizer [4] translingual obfuscation, a new software obfuscation scheme replace the original binary code with new bytecode, and a which makes programs obscure by “misusing” the unique custom interpreter is attached to interpret and execute the features of certain programming languages. Translingual ob- bytecode. The result is that the original binary code does fuscation translates part of a program from its original lan- not exist anymore, leaving only the bytecode and interpreter, guage to another language which has a different program- making it difficult to directly reverse engineer [39]. How- ming paradigm and execution model, thus increasing program ever, recent work has shown that the decode-and-dispatch complexity and impeding reverse engineering. In this paper, execution pattern of virtualization-based obfuscation can we investigate the feasibility and effectiveness of translingual be a severe vulnerability leading to effective deobfusca- obfuscation with Prolog, a logic programming language. We tion [24], [66], implying that we are in need of obfuscation implement translingual obfuscation in a tool called BABEL, techniques based on new schemes. which can selectively translate C functions into Prolog pred- We propose a novel and practical obfuscation method icates.
    [Show full text]
  • On the Implementation of a Cloud-Based Computing Test Bench Environment for Prolog Systems †
    information Article On the Implementation of a Cloud-Based Computing Test Bench Environment for Prolog Systems † Ricardo Gonçalves, Miguel Areias * ID and Ricardo Rocha ID CRACS & INESC TEC and Faculty of Sciences, University of Porto, Rua do Campo Alegre, 1021/1055, 4169-007 Porto, Portugal; [email protected] (R.G.); [email protected] (R.R.) * Correspondence: [email protected] † This paper is an extended version of our paper published in the Symposium on Languages, Applications and Technologies 2017. Received: 13 September 2017; Accepted: 13 October 2017; Published: 19 October 2017 Abstract: Software testing and benchmarking are key components of the software development process. Nowadays, a good practice in large software projects is the continuous integration (CI) software development technique. The key idea of CI is to let developers integrate their work as they produce it, instead of performing the integration at the end of each software module. In this paper, we extend a previous work on a benchmark suite for the YAP Prolog system, and we propose a fully automated test bench environment for Prolog systems, named Yet Another Prolog Test Bench Environment (YAPTBE), aimed to assist developers in the development and CI of Prolog systems. YAPTBE is based on a cloud computing architecture and relies on the Jenkins framework as well as a new Jenkins plugin to manage the underlying infrastructure. We present the key design and implementation aspects of YAPTBE and show its most important features, such as its graphical user interface (GUI) and the automated process that builds and runs Prolog systems and benchmarks.
    [Show full text]
  • Distributed Multi-Threading in GNU Prolog Nuno Eduardo Quaresma Morgadinho
    §' Departamento de hrformática Distributed Multi-Threading in GNU Prolog Nuno Eduardo Quaresma Morgadinho <[email protected]> Supervisor: Salvador Abreu (Ur,iversidade de Évora DI) This thesis does not include aVpreciation nor suggestions madeby the iury. Esta dissertaçã.o não inclui as críticas e sugestões feitas pelo iúri, Évora 2007 § Departamento de Lrformática Distributed Multi-Threading in GNU Prolog Nuno Eduardo Quaresma Morgadinho <[email protected]> ..--# Jü3 3?Y Supervisor: Salvador Abreu (Universidade de Évora, DI) This thesis does not include appreciation nor suggestions madeby tlrc jury. Esta dissertação não inclui as críticas e sugestões feitas pelo júri. Évora 2007 Abstract Although parallel computing has been widely researdred, the process of bringrng concurrency and parallel programming to the mainstream has just be- gun. Combining a distributed multi-threading environment like PM2 with Pro- log, opens the way to exploit concurrency and parallel computing using logic programming. Tlo achieve suú a pu{pose, we developed PM2-Prolog, a Prolog interface to the PM2 system. It allows multithreaded Prolog applications to run in multiple GNU Prolog engines in a distributed environment, thus taking advan- tage of the resources available on a computer network. This is especially useful for computationally intensive problems, where performance is an important fac- tor. The system API offers thread management primitives, as well as explicit communication between threads. Preliminary test results show an almost linear speedup, when compared to a sequential version. Keywords: Distributed, Multi-Threading, Prolog, Logic Programming, Concurrency, Parallel, High-PerformÉulce Computing 1 Resumo Multi-Threading Distribuído no GNU Prolog Embora a computação paralela já tenha sido alvo de inúmeros estudos, o processo de a tomar acessível às massas ainda mal começou.
    [Show full text]
  • Improving the Compilation of Prolog to C Using Type and Determinism Information: Preliminary Results*
    Improving the Compilation of Prolog to C Using Type and Determinism Information: Preliminary Results* J. Morales1, M. Carro1' M. Hermenegildo* * [email protected] [email protected] [email protected] Abstract We describe the current status of and provide preliminary performance results for a compiler of Prolog to C. The compiler is novel in that it is designed to accept different kinds of high-level information (typically ob- tained via an analysis of the initial Prolog program and expressed in a standardized language of assertions) and use this information to optimize the resulting C code, which is then further processed by an off-the-shelf C compiler. The basic translation process used essentially mimics an unfolding of a C-coded bytecode emú- lator with respect to the particular bytecode corresponding to the Prolog program. Optimizations are then applied to this unfolded program. This is facilitated by a more flexible design of the bytecode instructions and their lower-level components. This approach allows reusing a sizable amount of the machinery of the bytecode emulator: ancillary pieces of C code, data definitions, memory management routines and áreas, etc., as well as mixing bytecode emulated code with natively compiled code in a relatively straightforward way We report on the performance of programs compiled by the current versión of the system, both with and without analysis information. 1 Introduction Several techniques for implementing Prolog have been devised since the original interpreter developed by Colmerauer and Roussel [5], many of them aimed at achieving more speed. An excellent survey of a sig- nifícant part of this work can be found in [26].
    [Show full text]
  • Specialising Dynamic Techniques for Implementing the Ruby Programming Language
    SPECIALISING DYNAMIC TECHNIQUES FOR IMPLEMENTING THE RUBY PROGRAMMING LANGUAGE A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Engineering and Physical Sciences 2015 By Chris Seaton School of Computer Science This published copy of the thesis contains a couple of minor typographical corrections from the version deposited in the University of Manchester Library. [email protected] chrisseaton.com/phd 2 Contents List of Listings7 List of Tables9 List of Figures 11 Abstract 15 Declaration 17 Copyright 19 Acknowledgements 21 1 Introduction 23 1.1 Dynamic Programming Languages.................. 23 1.2 Idiomatic Ruby............................ 25 1.3 Research Questions.......................... 27 1.4 Implementation Work......................... 27 1.5 Contributions............................. 28 1.6 Publications.............................. 29 1.7 Thesis Structure............................ 31 2 Characteristics of Dynamic Languages 35 2.1 Ruby.................................. 35 2.2 Ruby on Rails............................. 36 2.3 Case Study: Idiomatic Ruby..................... 37 2.4 Summary............................... 49 3 3 Implementation of Dynamic Languages 51 3.1 Foundational Techniques....................... 51 3.2 Applied Techniques.......................... 59 3.3 Implementations of Ruby....................... 65 3.4 Parallelism and Concurrency..................... 72 3.5 Summary............................... 73 4 Evaluation Methodology 75 4.1 Evaluation Philosophy
    [Show full text]
  • Bousi-Prolog Ver
    UNIVERSIDAD DE CASTILLA-LA MANCHA ESCUELA SUPERIOR DE INFORMÁTICA Dpto. de Tecnologías y Sistemas de Información Bousi∼Prolog ver. 2.0: Implementation, User Manual and Applications Autors: Pascual Julián-Iranzo and Juan Gallardo-Casero Other contributors: Fernando Sáenz-Pérez (U. Complutense de Madrid) Bousi∼Prolog ver. 2.0: Implementation, User Manual and Applications © Pascual Julián-Iranzo & Juan Gallardo-Casero, 2008-2017. Pascual Julián-Iranzo, Juan Gallardo- Casero & Fernando Sáenz-Pérez, 2017-2019. Bousi∼Prolog is licensed for research and educational purposes only and it’s distributed with NO WARRANTY OF ANY KIND. You are freely allowed to use, copy and distribute Bousi Prolog provided that you make no modifications to any of its files and give credit to its original authors. This documentation was written and formatted with LATEX. All the figures and diagrams that appear in it were designed with Gimp, Inkscape or ArgoUML. The shield of the cover is work of D. Villa, I. Díez, F. Moya, Xavigivax and G. Paula and is distributed under the Creative Commons Attribution 3.0 license. ii ABSTRACT Logic Programming is a programming paradigm based on first order logic that, in recent decades, has been used in fields such as knowledge representation, artificial intelligence or deductive databases. However, Logic Programming presents an important limitation when dealing with real-world problems where precise information is not available, since it does not have the tools to explicitly handle uncertainty and vagueness. One of the related frameworks to this paradigm is Fuzzy Logic Programming, which integrates concepts coming from Fuzzy Logic into Logic Programming to solve the disad- vantages of traditional logic languages when dealing with uncertainty and ambiguity.
    [Show full text]
  • IN112 Mathematical Logic Lab Session on Prolog
    Institut Supérieur de l’Aéronautique et de l’Espace IN112 Mathematical Logic Lab session on Prolog Christophe Garion DMIA – ISAE Christophe Garion IN112 IN112 Mathematical Logic 1/ 31 License CC BY-NC-SA 3.0 This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported license (CC BY-NC-SA 3.0) You are free to Share (copy, distribute and transmite) and to Remix (adapt) this work under the following conditions: Attribution – You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work). Noncommercial – You may not use this work for commercial purposes. Share Alike – If you alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one. See http://creativecommons.org/licenses/by-nc-sa/3.0/. Christophe Garion IN112 IN112 Mathematical Logic 2/ 31 Outline 1 Prolog: getting started! 2 Interpreting and querying 3 Unification and assignement 4 Lists 5 Negation by failure 6 Misc. Christophe Garion IN112 IN112 Mathematical Logic 3/ 31 Outline 1 Prolog: getting started! 2 Interpreting and querying 3 Unification and assignement 4 Lists 5 Negation by failure 6 Misc. Christophe Garion IN112 IN112 Mathematical Logic 4/ 31 Prolog interpreter Prolog is an interpreted language: no executable is created (even if it is possible) a Prolog program is loaded into the interpreter queries are executed on this program through the interpreter We will use the GNU Prolog interpreter.
    [Show full text]
  • Introducción a Linux Equivalencias Windows En Linux Ivalencias
    No has iniciado sesión Discusión Contribuciones Crear una cuenta Acceder Página discusión Leer Editar Ver historial Buscar Introducción a Linux Equivalencias Windows en Linux Portada < Introducción a Linux Categorías de libros Equivalencias Windows en GNU/Linux es una lista de equivalencias, reemplazos y software Cam bios recientes Libro aleatorio análogo a Windows en GNU/Linux y viceversa. Ayuda Contenido [ocultar] Donaciones 1 Algunas diferencias entre los programas para Windows y GNU/Linux Comunidad 2 Redes y Conectividad Café 3 Trabajando con archivos Portal de la comunidad 4 Software de escritorio Subproyectos 5 Multimedia Recetario 5.1 Audio y reproductores de CD Wikichicos 5.2 Gráficos 5.3 Video y otros Imprimir/exportar 6 Ofimática/negocios Crear un libro 7 Juegos Descargar como PDF Versión para im primir 8 Programación y Desarrollo 9 Software para Servidores Herramientas 10 Científicos y Prog s Especiales 11 Otros Cambios relacionados 12 Enlaces externos Subir archivo 12.1 Notas Páginas especiales Enlace permanente Información de la Algunas diferencias entre los programas para Windows y y página Enlace corto GNU/Linux [ editar ] Citar esta página La mayoría de los programas de Windows son hechos con el principio de "Todo en uno" (cada Idiomas desarrollador agrega todo a su producto). De la misma forma, a este principio le llaman el Añadir enlaces "Estilo-Windows". Redes y Conectividad [ editar ] Descripción del programa, Windows GNU/Linux tareas ejecutadas Firefox (Iceweasel) Opera [NL] Internet Explorer Konqueror Netscape /
    [Show full text]
  • GNU/Linux AI & Alife HOWTO
    GNU/Linux AI & Alife HOWTO GNU/Linux AI & Alife HOWTO Table of Contents GNU/Linux AI & Alife HOWTO......................................................................................................................1 by John Eikenberry..................................................................................................................................1 1. Introduction..........................................................................................................................................1 2. Traditional Artificial Intelligence........................................................................................................1 3. Connectionism.....................................................................................................................................1 4. Evolutionary Computing......................................................................................................................1 5. Alife & Complex Systems...................................................................................................................1 6. Agents & Robotics...............................................................................................................................1 7. Programming languages.......................................................................................................................2 8. Missing & Dead...................................................................................................................................2 1. Introduction.........................................................................................................................................2
    [Show full text]
  • Pipenightdreams Osgcal-Doc Mumudvb Mpg123-Alsa Tbb
    pipenightdreams osgcal-doc mumudvb mpg123-alsa tbb-examples libgammu4-dbg gcc-4.1-doc snort-rules-default davical cutmp3 libevolution5.0-cil aspell-am python-gobject-doc openoffice.org-l10n-mn libc6-xen xserver-xorg trophy-data t38modem pioneers-console libnb-platform10-java libgtkglext1-ruby libboost-wave1.39-dev drgenius bfbtester libchromexvmcpro1 isdnutils-xtools ubuntuone-client openoffice.org2-math openoffice.org-l10n-lt lsb-cxx-ia32 kdeartwork-emoticons-kde4 wmpuzzle trafshow python-plplot lx-gdb link-monitor-applet libscm-dev liblog-agent-logger-perl libccrtp-doc libclass-throwable-perl kde-i18n-csb jack-jconv hamradio-menus coinor-libvol-doc msx-emulator bitbake nabi language-pack-gnome-zh libpaperg popularity-contest xracer-tools xfont-nexus opendrim-lmp-baseserver libvorbisfile-ruby liblinebreak-doc libgfcui-2.0-0c2a-dbg libblacs-mpi-dev dict-freedict-spa-eng blender-ogrexml aspell-da x11-apps openoffice.org-l10n-lv openoffice.org-l10n-nl pnmtopng libodbcinstq1 libhsqldb-java-doc libmono-addins-gui0.2-cil sg3-utils linux-backports-modules-alsa-2.6.31-19-generic yorick-yeti-gsl python-pymssql plasma-widget-cpuload mcpp gpsim-lcd cl-csv libhtml-clean-perl asterisk-dbg apt-dater-dbg libgnome-mag1-dev language-pack-gnome-yo python-crypto svn-autoreleasedeb sugar-terminal-activity mii-diag maria-doc libplexus-component-api-java-doc libhugs-hgl-bundled libchipcard-libgwenhywfar47-plugins libghc6-random-dev freefem3d ezmlm cakephp-scripts aspell-ar ara-byte not+sparc openoffice.org-l10n-nn linux-backports-modules-karmic-generic-pae
    [Show full text]
  • An Empirical Study of Constraint Logic Programming and Answer Set Programming Solutions of Combinatorial Problems∗
    An Empirical Study of Constraint Logic Programming and Answer Set Programming Solutions of Combinatorial Problems∗ Agostino Dovier† Andrea Formisano‡ Enrico Pontelli§ Abstract This paper presents experimental comparisons between the declarative encod- ings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)). The objective is to investigate how the solvers in the two domains respond to differ- ent problems, highlighting strengths and weaknesses of their implementations and suggesting criteria for choosing one approach versus the other. Ultimately, the work in this paper is expected to lay the foundations for transfer of technology between the two domains, e.g., suggesting ways to use CLP(FD) in the execution of ASP. Keywords. Declarative Programming, Constraint Logic Programming, An- swer Set Programming, Solvers, Benchmarking. 1 Introduction The objective of this work is to experimentally compare the use of two distinct logic- based paradigms, traditionally recognized as excellent tools to tackle computationally hard problems. The two paradigms considered are Answer Set Programming (ASP) [2] and Constraint Logic Programming over Finite Domains (CLP(FD)) [27]. The moti- vation for this investigation arises from the successful use of both paradigms in dealing with various classes of combinatorial problems, and the need to better understand their respective strengths and weaknesses. Ultimately, we hope this work will indicate meth- ods for integration and cooperation between the two paradigms (e.g., along the lines of [10, 11]). ∗A preliminary version of this paper appeared in the Proceedings of the International Conference on Logic Programming, LNCS 3668, pp. 67–82, Springer Verlag, 2005.
    [Show full text]