Monday, December 20, 2004

Ho To Do Dreadlock Extensions

MAA Online Articles, reviews, and other links various

These last month absence of written production in these parts, I have been taking note of a series of articles, comments on blogs, and other links of various kinds, which have earned my interest in one or other reason, always depending on the subject on which relates or purports to relate this site. This is not an exhaustive list (of everything I've read and I was interested), or ordered with excessive discretion and rigor ... articles, introductions, annotations of "blogs" A taste of Poplog (1) and (2) (on Poplog development environment, in Special Effects). Pythologic - Prolog syntax in Python

(in

Lambda the Ultimate). Description Logics in Literate Haskell / SAT 3 with E Prover Proof via OWL (in Lambda the Ultimate). NewLisp: A Better Lisp / Scheme Fusion (newLISP

is a general purpose scripting language for Developing Web Applications and Programs in general and in the domain of Artificial Intelligence (AI)
and statistics."; en
Lambda
the Ultimate
).


The
Science of Word Recognition
(Kevin Larson - Advanced Reading Technology,
Microsoft Corporation).




Intelligent
library systems: artificial intelligence technology and library automation
systems (Bailey, Jr., Charles W., 1991).


What
is Artificial Intelligence?

(por Jack Copeland en AlanTuring.net

).




The
Calculus of Logic Digital Lab Digital Documentation Online Master

(Universitat Pompeu Fabra, also includes several utilities developed with of Google API, tools, map-editor DigiDocMap conceptual-DigiDocMenu-editor-down menu, and DigiDocIndex-indexer and generator of local search-).

Thursday, December 16, 2004

Free Brent Corrigan Clips

A general introduction to language Early

To those who seek a basic introduction (albeit very basic) Prolog language, I recommend reading the article or "white paper" of
Gerardo Rossel "programming as GICA " " A tour of logic programming and one of its most representative languages: Prolog, artificial intelligence classic, which applies in many ways in the development of commercial software " [Source: intro of the article] The introduction of the article is defined very clearly and concisely the famous "equation" of Kowalski (which may recall I spent a rather lengthy comment, not as clear and concise - long ago, in the notation " About Kowalski formula). We read in its introduction: "[...] equation [...] Robert Kowalski provides the essential idea of \u200b\u200blogic programming: algorithm = logic + control. That is, an algorithm is constructed by specifying a formal language knowledge (first-order logic), and the problem is solved by an inference engine (control) acting on that. "Published in number 7
  • journal. code, the full text article can be located, PDF format
  • through

    page Amzi!

    Monday, June 28, 2004

    Calories In Can Of Holsten Pils

    Prolog computer programming: ASCII and Cobol

    On Tuesday 22/06/2004, died in the U.S. Robert W.

    Bemer, a pioneer in computer programming. Among his professional accomplishments have contributed count the instrumental in the establishment of the standard ASCII

    1] [2 ] representation of information exchange, and development of the COBOL programming language

    . On the occasion of his death, the daily El Pais
    published in yesterday's edition 27/06/2004 A brief biographical note, translation of original text
    published in The New York Times

    , from which we extract the paragraphs that refer to Bemer work in the field of computer programming: Robert W.

    Bemer, a pioneer in computer programming Robert W.
    Bemer, an early computer programmers, who helped devise

    ASCII, a system that remains in use to represent letters and numbers in [...] code started working with computers when doing engineering work on military aircraft for the Rand Corporation in California, in 1949. "There I met early IBM computers and fell in love with his technique. I knew I was done for the world of computers. This business was in its infancy, and programming was a job that hacíaa the measure, usually involved preparing machines for calculations made one at a time. Until 1958 there was published the first mention of the word as a term computer software. The software was not a separate activity, but simply something that had to pay to get the computers, which were then the size of a room, could make their work, "he wrote in a series of memories in your web page .

    Bright, articulate and irreverent, Bemer seemed to fit exactly in the role during the early years programming crazy . Worked for aircraft manufacturers in California, until 1955, he joined the research department of IBM's programming in New York. There was no formal training for programmers, and for a time was Bemer recruiting manager.
    Bemer played
    an important role helping to develop a standard system for translating letters and numbers to a digital code that could be processed by a computer, known as American Standard Code for Information Interchange, or ASCII (acronym in English). Before
    ASCII, computer manufacturers had their own systems for encoding letters and numbers, making it difficult or impossible to exchange data between machines from different computer manufacturers. A final fifties and early sixties, Bemer was one of the leading advocates and supporters of the standard, under the guidance of

    American National Standards Institute (later adopted by the International Standards Organization). ASCII

    was implemented in 1963, expanded and modified over the years [...]. Bemer firmly supported ASCII

    , although the direction of IBM defended his own standard of coding. In 1962, Bemer left IBM to join the Sand's Sperry Univac division. In its way, the standard ASCII

    world. the late fifties, Bemer played a role in another important computer standard, the Cobol programming language. The Defense Department wanted a common language Data management and accounting, and the result at the end of 1959 was Cobol, stands for Common Language Oriented Management. [...] As its name suggests, COBOL (Common Business Oriented Language ) was a programming language created in 1959-1960 , within CODASYL committee ( Conference on Data Systems Languages \u200b\u200b

    )-sponsored since 1957 by the Department of Defense-US-for application in administrative tasks and accounting.

    ease of reading, thanks to a syntax very close to the natural language expression in English, but is blamed for

    COBOL language

    be too rigid in its format of writing very long sentences, and not suitable for structured programming techniques ( Pascal and C, to name a few, are examples of languages \u200b\u200boriented structured programming ). Moreover, the high standardization adopted since the start of development, and the special attention of the proper language to express data structures [ 1] [2

    ], among other features, has allowed even today continue operating in the banking, commercial and business applications with 40 years standing, showing a remarkable solidity and stability, for once the problems that the so-called "year-2000

    " (consisting on the problems of using two digits to store dates in older systems) involved in some cases, for operational and functioning properly. more about the language COBOL : [1 ] [ 2] [3 ] [ 4] [5 ] [ 6] [7

    ]

    Wednesday, June 2, 2004

    No Sew Fleece Scarf Tie

    human consciousness and artificial intelligence

    To break the long period of time without leaving anything written in these parts, and waiting, among other things, higher levels of inspiration, following are some articles and annotations I have called attention pleasantly recent weeks: Self Organizing Maps (for T. Germano, description of the application of artificial neural networks to display clasificacióny information.) Fuzzy Logic - Fuzzy Logic

    (by Hector Garcia Kirai.Net

    ). A Prolog Introduction for Hackers (comment on Through the blogging-glass at

    Prolog tutorial published in

    kuro5hin.org ). How does a search engine? [ 1], [2 ], [3

    ] and [4

    ] (by Hector Garcia Kirai.Net ). timetabling problem (practical implementation of certain aspects of graph theory, A. Arranz Cuesta Ordonez and E. Guzman, Programming in Castilian ). Multi-Backpropagation Network: Concept and Modeling (Backpropagation network is one of the Well Known NN model. However, large network is too complex and Takes a long time to train in Generation5 ...";

    ).

    George Boole (on Boolean logic

      , digital or binary, by Hector Garcia Kirai.Net
    • ).
    • As can be seen, a special place of mention in this short list, it certainly takes Hector Garcia, and at this point it seems pertinent to comment that it is very commendable so that has to address the issues that is usually on his blog ( Kirai.Net ), apart from those of character and interest maso less strictly personal and private, to know: fundamentals of computing, artificial intelligence and its applications, programming in general ... It'll note his remarkable effort to make accessible and understandable, for "ordinary mortals, such matters. In another of his notes, "
    • The Turing Test and Intelligent Computer
    • " addresses a topic which has traditionally raised, and should continue rising, much controversy and diverse opinions: basically, that which concerns how to define what might be called as true artificial intelligence , what are the defining characteristics, and an autonomous system, to see who is endowed with the properties and functions inherent to human intelligence (if it ever reached to know and understand all of these properties and functions, from a joint perspective) is those that express the nature and operation of cognitive processes, reasoning and learning that occur in the minds of human beings. In comments to this entry , we can read interesting opinions, and at this point I would make a reflection made by the English writer and critic David Lodge [1 ] [
    • 2
    • ] in the context of an interview published in the edition of the newspaper supplement Babelia The Country of May 1 ("In Defense of fiction, "basically deals with the importance of gender in the novel, fiction, as an instrument of representation of human consciousness, which varies according to different periods over time). Question the interviewer (Lourdes Gomez): "Do you think that consciousness is the software of the human mind?" and Lodge replied: "In the literary sense is good metaphor to describe consciousness. Another question is whether the human mind works like a computer. I think the computer is a type of brain rather limited. There are similarities in performance, but also important differences. Mainly in the connectivity of the human mind and the execution of simultaneous tasks. A computer can never replicate these characteristics despite what the experts assure us in artificial intelligence. Computers are much faster than the human brain, but I do not think intuitively be able to remove irrelevant elements of a function. We win at chess, but never in the decision-making requires an intuitive ability. " aside a reflection of both the Lodge, which in any case no longer an opinion, backed by the knowledge that if laid up in two years of study devoted to cognitive science, artificial intelligence and the phenomenon of consciousness, with an eye toward preparing your secret thoughts novel (Anagrama
    • , 2002, ISBN: 84-339-69893-8) the author explains in the interview, and without wishing to enter into great depth in regard to this issue, it is clear that hardly may transfer the characteristics of human intelligence and their cognitive processes to autonomous artificial system, thereby creating artificial intelligence, if not clearly understand the full functioning of these processes, and it seems Unless the scientific disciplines that deal with these matters (in respect to physical and chemical processes, such as those on the transfer and information processing) are quite far from reaching an optimal state of knowledge and "global" about the apparent complexities over which it was initially thought to approach its study of the human mind.

    Wednesday, April 14, 2004

    Best Place To Get Waxed In Ottawa

    Seminars

    We echo on this occasion three citations in the field of conferences and meetings related to the programming
  • declarative / functional (in PDF ) and GICA, are to be held in the coming months: 1st European Lisp and Scheme Workshop
  • (Oslo, June 13, 2004)
  • "Lisp has a tradition of Fruitful Providing a basis for language design experiments for many decades. The structure of Lisp, including Common
    Lisp and Scheme as its major dialects of today, makes it easy to extend
    the language or even to implement entirely new dialects without starting
    from scratch. Common Lisp, with the Common Lisp Object System (CLOS), was
    the first object-oriented programming language to receive an ANSI standard
    at the beginning of the 1990's. It is, arguably, the most complete and
    advanced object system of any programming language, and has influenced
    many other object-oriented programming languages that were to follow."
    [ continúa ]


  • Colloquium
    on Implementation of Constraint and LOgic Programming Systems

    (CICLOPS 2004)


    "This workshop aims at discussing and exchanging experience
    on the design, implementation, and optimization of logic, constraint (logic)
    programming systems, and systems intimately related to logic as a means
    to express computations. Experience backed up by real implementations and
    their evaluation will be given preference, as well as descriptions of work
    in progress in that direction."

    [

    continúa ]


    The 14th
    workshop on logic programming environments

    (WLPE' 04)


    "The aim of the workshop is to provide an informal meeting
    for Researchers working on the tools for the Development and analysis of logic programs. This year we want to Emphasize two Aspects: on one hand we want to discuss the presentation, pragmatics and Experience of Such tools, on the Other One, we want to extend the concept of "logic programming" Environments to tools based Developer for Any Language on computational logic (constraints, integration of Paradigms, specification languages, ...)." [ continues ] From the first date (to be held we learned via Bill Clementson's Blog , "Bits and pieces

    (mostly Lisp-related) That I collect from the ether
    ") are available in PDF format

    , the papers (communications, presentations) received so far. As for the

    workshops (workshops, seminars)

    CICLOPS 2004 and WLPE '04 , said to be held under the 20th International Conference on Logic Programming

    (ICLP'04, 6-10 September 2004, Saint-Malo, France) organized by the Association for Logic Programming

    (ALP).

    Manuel Carro and José Manuel Gomez-Perez, two of the organizers and coordinators of the workshops framed in ICLP'04
    to just refer to, are members of the CLIP Lab

    ( The Computational Logic, Languages, Implementation,

    and Parallelism Lab), Faculty of Computer Science, Polytechnic University of Madrid, whose area of \u200b\u200bactivity focuses on general Logic Programming and Constraint Logic Programming
    ( Constraint Logic Programming, CLP) in particular. In this context activity, members of the CLIP Lab
    have developed the Ciao Prolog

    : "[...]

    logic programming environment and restrictions [...] is one of the systems developed
    by the CLIP group. [...] [...] is free software and is currently being used in business applications both in the academic environment [...]. Among the advantages offered by Ciao Prolog highlights its extensibility, which have developed many libraries that add significant functionality to the system, such as constraint solvers, concurrency, distributed programming primitives and intelligent agents, persistence, higher order, objects, interfaces to other programming languages, etc.. As examples we can point the library PILLOW , possibly the most used for interconnection between logic programming systems (and restrictions) and the WWW
    and LPdoc

    a automatic documentation generator for logic programming systems and restrictions, both distributed as software Free. " [ source] Most technical reports (Technical Reports ) produced by members of the CLIP Lab are available for consultation by them sorted interest area and production per year (formats PDF documents are and PS). Unless you are looking for a specific text, from which it becomes aware in advance on which case is more direct and quick search by year the most practical and productive is done through the management and research topic . More information on conferences and seminars co-organized by the laboratory

    the relevant page.

    Wednesday, April 7, 2004

    How To I Prevent New Shoes From Creasing?

    Declarative Logic Programming and Prolog + Schelog

    Schelog is an implementation developed by D. Sitaram it possible to combine pieces of code written in a programming style similar to Prolog (including the main features of this language such as backtracking or reverse, the unification, the court, denial, meta-logical predicates , etc.). Scheme expressions in pure or conventional (Scheme is a language derived from Lisp

    - see previous entry in which we referred to the latter) within the same application: Schelog is an embedding of Prolog-style logic programming in Scheme. "Embedding''Means You Do not Lose Scheme: You use Prolog-style dog and Conventional Scheme code fragments Alongside Each Other. Schelog contains the full repertoire of Prolog features, Including meta-logical and second-order ("set'') predicates, only Those Leaving out features more That Could Easily Be Done Efficiently and more with Scheme subexpressions.
    In Programming in Schelog

    Schelog syntax is the characteristic of Lisp / Scheme (basically consists of nested lists and indented, without commas, as indicated by parentheses, preemption of operation sign arguments, strings in quotation marks, etc..). As an example, below the portion of code needed to compute, recursively, the factorial of a number, in Prolog in the first place, and in Schelog second (recall that factorial of a natural number n is the product of all natural numbers from 1 to n ): factor (0.1): -!. factorial (X, Y): - X1 is X-1, factorial(X1,Y1),
                     Y is X*Y1.

    (define %factorial
      (%rel (x y x1 y1)
        [(0 1) !]
        [(x y) (< x 0) ! %fail]
        [(x y) (%is x1 (- x 1))
               (% Factorial x1 y1) (% is and (* y1 x ))])) Schelog can be considered as a combination between styles of programming paradigms represented by one hand Prolog (logic programming

    dialect of Lisp

    other Scheme ( declarative programming functional). "Programming in Schelog " is an introduction in which the said D. Sitaram addresses the syntax and programming through the implementation that we are commenting. On the other hand, this same author, " Teach Yourself Scheme in Fixnum Days " is a quick guide and introduction to the language Scheme. Finally, we recommend reading a general introduction, referring to the origins of language Scheme: Scheme : small is beautiful - A programming language ideal for teaching dence ( Carlos Coello ). This article was subsequently published (PS

    format compressed in a. Zip) by the author, with the same title and more extensióny deep in the journal Advanced Solutions
    ( numbers 39 and 43, now this publication appears to be unavailable online, although Internet Archive can find multiple copies ). This new extended version of "Scheme: small is beautiful ..." adds to the explanation of the historical and language development Scheme, an introduction, with examples, the essential features and syntax for use, major updates and extensions as well as a final consideration about its utility RESEARCH AND teaching in the field of programming languages \u200b\u200b("Scheme as a teaching tool.")

    Thursday, April 1, 2004

    Manhattan Model : 460668

    Scheme = Lisp and Java-article-

    Not everything will be in the field Prolog declarative programming ... Through Lemonodor , weblog dedicated to language Lisp ( LISt Processing) and its associated technologies (but also address many issues related to robotics), we

     article 

    Lisp and Java (D. Milstein) : "First-class functions Are a Powerful feature of the Lisp programming language. This article describe Some Ways They Can Be Used, and explore how to Approximate Them in Java." Lisp language [1 ] [ 2] [3 ] [ 4] [5 ], developed initially in the late 50's of last century by John McCarthy (see his essay about

    History of Lisp), is undoubtedly a most known and used in the programming paradigm declarative / functional , and basis for the development of languages \u200b\u200band dialects other similar, more advanced features and modern, or just targeted to other areas of application (this is the case, for example, language Logo) . Lisp is a language widely used and extended in the Anglo world, specifically United States, especially through the implementation commom Lisp, and has traditionally been used both in academia and in business, to set process-driven applications of Artificial Intelligence (AI )-of Indeed one can say that was created and developed for this purpose, and is considered by both the "first language IA" - and natural language processing (NLP ), although today it is possible even find, for instance multiple applications, servers

    developed web more about the Lisp language:

    Practical Common Lisp (Peter Seibel). On Lisp (P. Graham). LISP

    First
    (C. Allen, M. Dhagat; another location).

    CLiki, the common lisp wiki . A Concise Introduction to LISP (David L. Matuszek). Common Lisp: A Gentle Introduction to Symbolic Computation (David S. Touretzky).


    Common
    Lisp the Language, 2nd Edition ( otra
    ubicación
    ).


    Lisp
    FAQ
    .


    Early
    LISP History (1956-1959)
    / The
    Influence of the Designer on the Design - J. McCarthy and LISP
    (H.
    Stoyan).


    Lisp
    Lectures (N. Levine).


    LISP
    Tutorial

    (M. Schwarz).




    • Successful Lisp:
      How to Understand and Use Common Lisp (David B. Lamkins).
    • The Common Lisp Cookbook.
    • How to Use Scheme. Writing Scripts and Programs with PLT Scheme (M. Felleisen et al.).
    • Teach Yourself Scheme in Fixnum Days ( D. Sitaram
    • ).
    • To illustrate the examples, the author of Java and Lisp
    • used a dialect of Lisp, called Scheme [
    • 1] [2 ]. The article is published in
    • ONJava.com
    • (whose main entrance We have taken the brief synopsis in English), great source of reference in which to find good articles and other references to the Java language and its many applications. Moreover, ONJava.com is an electronic publication subsumed under the corporate project
    • O'Reilly. Com
    • Tim O'Reilly, dedicated to publishing books, imparting conferences and courses, and web site creation (
    • Resource Centers) and on-line publications (
    • Online Publications : XML.com, Perl.com
    • , etc.) On computer technology and programming languages \u200b\u200b( Perl, Python
    • , C / C + + , XML
    • , . NET , etc.), with a clear focus on those technologies related to the development of web applications under
    • environments.

    Tuesday, March 30, 2004

    Nadine Jansen Terhes Videó

    About

    Following the style of which until recently was the design of my blog

    sister, little more than a month is changed ProLog appearance IR, although for different reasons-the same as during this time have maintained "silence" this area of \u200b\u200bpublication, so far has not made an explicit reference to this circumstance. Basically the redesign work has been to remove the tables as system layout, and make the latter entirely to CSS . The advantage of having the page structured in this way, regardless of maso least meet the standards existing the fact is that they are completely separate blocks of content from presentation itself, and thus more easily introduce future changes in style and appearance. In fact the style that you can see at this time intend to be provisional, since among other issues, and in its present configuration, may have some display problems in Internet Explorer (not!), Follow n is the screen resolution used.

    Also I have in mind a future change hosting and publishing system (" WordPress ?) In the short term, if time and the desire to allow ... In any case, the important thing, and what it is, issues of style aside, is to offer interesting content, and in this sense I hope, "put the batteries" hereinafter, and that I've expanded over intervals publication, combines Although statistics show me that, rather than regular and loyal users, the profile of visitors to this site corresponds to accessing people, a significantly majority to through search engines (Google in particular, how could it be otherwise, at least today) and metasearch, and search the corresponding equations-some very interesting and surprising, indeed, whose analysis allows the time to establish if there is an appropriate match between the topics commonly addressed and searches equivalent to those issues by users. Well, now time to clarify the meaning and significance of the event which currently shares the spotlight with the top of the page: "Algorithm = Logic + Control." This "equation" very general, has made a fortune when explicit, graphic and condensed form, the principles and rationale implicit in the logic programming paradigm (associated with this scheme, so particular, logic programming with constraints), and in general in the analysis software, and it is not the title of an article in which author Robert Kowalski explains his notion of declarative programming in general and logical in particular, early development for the years when it was published. The full review of this paper is as follows: Kowalski, R. (1979), "Algorithm = logic + control, Communications of the ACM, 22 (7), pp. 424-436. [complete reference ] The full text PDF format is available in digital library of ACM , although access is limited to paying subscribers . It is freely accessible the record, the summary and the bibliography accompanying the text. The article was later republished in the work Programming Languages: A Grand Tour (3 rd edition, E. Horwitz ed., Computer Science Press: Maryland, 1986, pp. 480-492).

    ) and how the program should address this objective (the

    how , the control). In this sense, the paradigm of logic programming, and in general the paradigm of declarative programming (which includes on one hand, functional programming - Haskell, Lisp , etc .- and other logic programming), clearly focuses on facilitating

    what we want to do the program-its target of pre-, which

    how you must do to achieve it, which does not exclude the existence of powerful control structures such as those which are represented in Prolog, by the mechanisms of instantiation of variables, and check

    unification of structures, recursion

    and backtracking

    or reverse, to name the most important.
    Chapter "Pandora's Box A = L + C and its variants", page 84 and following the notes of BC Ruiz Jiménez,
    Course Notes for Advanced Declarative Programming (University of Málaga
    , PDF format document

    ) provides a good EXPLANATION n the meaning and implications of the formula Kowalski. Indeed, in this paper can find a very clear articulation of synergy and symbiosis between certain projects provide programming paradigm represented in part by the language Prolog, and a number of approaches (functional, oriented objects etc.), as we mentioned in the previous annotation (" =" Logic Programming Prolog? ") concerning a notice published in Lambda the Ultimate . See paragraphs about "Logic Programming" and "Integrating logic and functional paradigms." Returning to the explanation of the equation Kowalski, interrupted by the reference in paragraph above, we can say that in Prolog, and given the characteristics of this programming language, the user is primarily concerned to implement the "logic" of programs (consisting mainly of the knowledge base, inference rules, and queries), as control mechanisms cited ; we were before, those who determine how solve specific objective program, implemented through a series of algorithms and mechanisms that work in-house, whose characteristics depend on the interpreter used last ( remember that Prolog is an interpreted language, if While some implementations allow certain instructions to pre-compile). arises at this point, associating with

    control logic , the idea of \u200b\u200bconstraint programming and Constraint Programming to provide more controlled evaluation of control mechanisms, the scheme logic programming and thus to fully satisfying the maximum Kowalski, thus giving rise to the Constraint Logic Programming and Constraint Logic Programming (CLP). Some documents on constraint programming in general: Constraint Programming (M. Wallace, also in PS format, see especially section 2.1.1 . Algorithm = Logic + Control ). Constraint Programming (lecture notes of Professor Jia-Huai You ).

    On-line guide to Constraint Programming

    (R. Bartak, also the author of Guide to Prolog Programming ). on Constraint Logic Programming in particular see for example the following texts: An Introductory Course on Constraint Logic Programming (M. Carro et al. ).

    Constraint Logic Programming - An Informal Introduction

    (T. Frühwirth et al. ; format

    PS). Constraint Logic Programming: A Survey (J. Jaffar, MJ Mayer, PS format).

    Constraint Logic Programming


    La
    Programmation Logique et par Contraintes
      (L. Jean-Michel en
    • Lambda
      Systems ).


      Algunas opiniones e interpretaciones al respecto de la "fórmula"
      que venimos comentando:



    • "The basic property of a declarative programming language is
      that a program is a theory in some suitable logic. This property immediately
      gives a precise meaning to programs written in the language. From a programmers
      point of the basic property is that programming is lifted to a higher level
      of abstraction. At this higher level of abstraction the programmer can
      concentrate stating on What Is To Be computed , Not Necessarily how it is to Be computed. In Kowalski's Terms WHERE algorithm = logic + control, the programmer Gives the logic But Not Necessarily the control. " Olof Torgersson
    • in
    • A Note on Declarative Programming Paradigms and the Future of Definitional Programming (text in HTML
    • is a shortened version of the original PS
    • format)
    • "The formula isn't required, and it Will not Be Until someone Proposes specifying a precise and Generally Accepted notion of how control is to Be added to an expression of the logic of a program. Nevertheless, the idea is attractive, and I believe it Can Be Made to work for Some interesting class of programs. It is analogous to my comparison of epistemology and heuristics or Chomsky's competence and performance. " John McCarthy in Coloring Maps and the Kowalski Doctrine
    • In any case it offers a fairly detailed explanation of the expression n "Algorithm = Logic + Control" and its meaning in relation to logic programming, in another text of the Kowalski, Logic Problem Solving for (North-Holland Elsevier, 1979), specifically in Chapter 5,
    • The Procedural Interpretation of Horn Clauses (PDF format , page 125 and following, although in fact the chapter ; whole chapter deals with this issue.) The chapters in this book, very affordable level, and full text are available in PDF in
    • personal page R.
    • Kowalski, which is also a selection of his latest literature and the preliminary draft chapters of the new book he is preparing How to be Artificially Intelligent - the Logical Way , which addresses the fundamental principles of computer logic, and implementation problems of everyday life. Kowalski will end by emphasizing that, along with Alain
    • Colmerauer
    , one of the key figures in the development creacióny logic programming in general and Prolog in particular. Colmerauer, which since the late 60's of last century had been working on the processing and natural language processing through the application of computational logic, makes contact with Kowalski in 1971 to hear their work in relation to the Show No automatic theorem (theorem proving

    ) and the resolution method
    SL (SL-resolution ), and fruit of this collaboration produced the first effective development of programming language No logic Prolog. Throughout this process, along with other notes autobiographical, is explained briefly in the same Kowalski in the text
    A Short Story of My Life and Work .

    Monday, March 29, 2004

    Cool Facebook Profile Image

    Kowalski formula = "Logic Programming Prolog?

    The reference the tutorial "The Logic Programming Paradigm and Prolog " of
    Apt KR (University of Amsterdam, document formats
    PS; really is Chapter 15 of the book " Concepts in Programming Languages \u200b\u200b
    "), is now bringing Lambda the Ultimate interesting comments that should not be missed by anyone interested in this programming language and logic programming in general. For example, Peter Van Roy , Catholic University of Louvain (Belgium), a leading researcher in programming language implementations in the domains of declarative programming, logic, and with restrictions, among others, criticizes
    -in a clear reference to own
    Apt

    - el, in his opinion, excessive "absorption" by some developers ... "[...] There is a Certain class of logic programmers choose to ignore anything Who That Does Not Fit Into The cozy little world of Prolog-style logic programming. " [Source ] ... almost exclusively interested in the logic programming paradigm when it is confined to Prolog and other languages \u200b\u200bare very similar (so they reach the equation implicitly assume logic programming Prolog = ), without considering other lines of development and investigation n that, based on the foundations and contributions of this paradigm, seek complement the shortcomings and limitations of Prolog "pure" when it comes to represent and solve certain problems and computational approaches. As an example of the routes in developing novel alternative programming systems, "unrelated" or related to some extent with the logic programming paradigm, we can cite the

    Project Mercury, the Mozart programming system , language logic / functional Curry, etc., etc. also very interesting commentary N. Krishnaswami, in response to a question from another participant says succinctly, with an example, what is the constraint programming [ 1] [2

    constraint programming (CP) that in the paradigm logical / declarative leads to Constraint Logic Programming

    or Constraint Logic Programming (CLP). The discussion on the terms mentioned at the beginning of this entry, raised by Peter Van Roy, of course continues the thread of reference made Lambda the Ultimate, so I can only recommend reading the new comments that will arise out of previous .

    Wednesday, March 3, 2004

    North Face Austin Tx Outlet

    "Spam" as a metaphor of a living organism

    Interesting article on the Generation5 "

    Application of Biological Metaphors for Identifying and Killing Spam
    " (S. Evans). Is the topic? creation of an anti-spam filter Artificial Neural Networks (ANN, Artificial Neural Networks

    ). As introduccióny theoretical argument, the author makes an interesting analogy, the phenomenon of spam as a living ( Spam as a Living Organism), in constant evolution and adaptation " medium "(in this case the email and streaming media formats and through Internet), governed by its own laws of" natural fit. " Complete with C # source code, this article looks at how to Identify a Variety of spam using biological metaphors Such as neural networks. [ source] The article includes the source code of the filter, downloadable in a zip file, and developed in C #

    language. Like all RNA , this code requires previous training to operate correctly, as explained in the text ( Training the Networks) . In the results section, we are informed that, in tests, has obtained a ruling just over 1000 emails analyzed. On another issues, not very far in any case, and in Generation5 , se
    publico hace ya varias semanas otro artículo que me gustaría
    destacar: " Intelligence
    - Artificial and Otherwise
    " (Bruce L. Toy):


    This paper presents a model of artificial intelligence, based
    on an XML
    memory structure, a logic architecture of divisible processor functions,
    and real-time sensor integration.  It incorporates learning, consciousness,
    creativity, and growth in a framework that can be used to understand human
    behavior, build an independent intelligent entity, or integrate a large-scale
    computer network into an intelligent system.

    [

    fuente ] Using XML to implement the memory structure of the working model based on IA

    features. Since the abstract of the article just quoted is sufficiently clear and expressive, I do not think we should add anything else about it except to recommend its reading.

    Monday, March 1, 2004

    Klucz Seryjny Do Mount&blade 1011 Pl

    An Introduction to Prolog "for" Hackers "...?

    Through pjorge , I find the recent publication of A Prolog Introduction for Hackers . In passing reference has helped me to know Kuro5hin.org " ... Collaborative site about technology and culture, Both separately and in Their Interactions. (

    source).

    ..." is simply an introduction to this language, very general, so that I can not understand that depict the "hackers" in the subject ... certainly, as I pointed Ander Donosti.org something this must have been as incomprehensible to mention ... General and brief, I repeat, although the exposure time sufficiently clear and complete, this little tutorial is however quite suitable for those who just know some (or all) of the Prolog language and are interested in acquiring basic. Perhaps it is missing a reference longest essential procedures such as cutting, denial, recursive techniques and battery parameters, using dynamic predicates, etc.

    are also highly recommended reading the many comments raised about this little tutorial (over 100 at the time of writing), with emphasis, in my view, which is entitled "Benefits of the Prolog mindset ... ", but anyway, should not miss any, many of them are simple criticism Maso less informed, about the methods rites or demerits of the language Prolog, while in other cases these contributions additional, very pertinent questions about little or nothing covered in the tutorial that we are commenting, or simply report interesting resources related to that language. In turn, in comments

    to pjorge annotation, JJ gives a somewhat surprising, and in my opinion biased and wrong, about the Prolog language, which in any case is answered by great success by Akuma ...
    also refer to the tutorial

    " A Prolog Introduction ... " and also, in the comments section can read some interesting opinions. Noted that Peter Van Roy

    outlining several tutorials, notes and introductions to Prolog. In some cases these are electronic versions of monographs dedicated to this programming language. The order of the words is random, does not imply any level of importance or anything: In Castilian

    Mathematical Logic Introduction - Mathematical Logic and Applications (SV Chapa Vergara). Introduction to Prolog (J. Suarez Sanz).

    Logic Programming ( V. Iniestra ). Knowledge representation in intelligent systems (G. Fernandez).

    Knowledge Representation (E. Morales, LE Sucar).

    Prolog Tutorial (partial translation of the manual DECSYSTEM-10 Prolog system). Prolog Tutorials Programming

    in Castilian

    (A. Fernández Pineda). Style Guide Prolog programming (PR Borges). Introduction to Prolog. Logic Programming Prolog (by Wintermute). Prolog

    (M. Salas Zúñiga, E. Uraga Serratos).

    Guide to
    Prolog Programming

    (R. Barták).






    En otros idiomas




    • La
      Programmation Logique et le langage Prolog
    • (P. Nugues).



    • Introduction
      à Prolog
    • (C. Solnon).



    • Manuale
      Prolog (G. Adorni et al.
    • ).



    • Méta
      Interpréteurs en Prolog
    • (
    • L.
      Jean-Michel ).


    • Tutorial
      de Prolog (Claudio Cesar de Sá).


    • Zur
      Entstehung der Programmiersprache Prolog ( D.
      Schmitt
    • ).



    • Introdução
      à Prolog Programação
    • (Luiz AM Palazzo).
    • This is by no means a complete list of everything you can find on the internet about this language. In English, and also in Castilian, are enough notes and lecture notes for college courses, usually quality and depth of analysis far superior to that found in the introductions and tutorials that just mention, while we let your reference later.

    Saturday, February 21, 2004

    Closed Tank Purged Tip Over

    A new "blog" and faceted classifications regarding

    Through the "Referrer" (referrals) of statistics, I find the existence of
  • Sense of Wonder,
  • weblog written in English by David Cherry, the truth is that looks great in both presentation and content, that ultimately becomes important. Fundamental problems of the theory of computation, programming languages, knowledge representation ... are, broadly speaking, some of the topics covered so far, supplemented by promising data such as found in the right column under "Worth reading documents, selection of relevant documents on various subjects.

    By the way, and since we mentioned the statistical system, is very curious and expressive, very "semantic", the identification Nedstat makes

    Time: all reality is viewed from a location in time.

    the following advantages of faceted classification:

    Divisions facets are original means to channel the materials and knowledge. Allow explain concepts more accurately than enumerative systems (those listed, listed, listing all the materials with linear nature, dividing the subjects into classes of different hierarchical levels, falling in specificity), from a number of smaller items. The facets have high combining ability, based on few initial elements. faceted systems lend themselves well to automation, since a subject can be located from each facet with which is was described, affecting in this way in certain aspects of the postcoordinación (post-coordinate indexing languages \u200b\u200bin terms of description are used freely without priori relationship between them, establishing this relationship at the time of recovery of the document).

    have a great capacity to integrate new concepts. You can make changes at a facet of a given area without affecting the others. However : faceted systems have a structure for each particular subject, with defined hierarchical levels less than the equivalent in nature enumerative classifications. resulting notations are often complicated and difficult to memorize, to be adapted specifically to each particular document. descriptions responsibility always rests on the competence of the classification, while the enumerative systems it has settled on the boards. In any case, the faceted classification system developed by Ranganathan, was an important theoretical advance of decisive influence on subsequent classification systems and combinatorial nature of modern thesauri.