No label defined (Q4023210)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 107624
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 107624

      Statements

      0 references
      23 January 1993
      0 references
      logic programming
      0 references
      Prolog
      0 references
      finite automata
      0 references
      graph theory
      0 references
      combinatorics
      0 references
      algebra of logic
      0 references
      calculi of logic
      0 references
      Hilbert's idea of the possibility to prove any mathematical truth by inferring it from axioms in a formal system turned out to be wrong, which has been proved by the famous Gödel's theorems. Anyway, Robinson's resolution method made it possible to develop logic programming languages which realize computation as deduction. The author uses the ARITY/PROLOG programming language for solving problems which have set-theoretical character and are, therefore, difficult to handle in classic imperative languages, such as graph algorithms or automatic design of finite automata. The author presents Prolog programs which realize algorithms that when having monadic logic formulas as an input produce operations over a finite automaton described by this formula. He also tackles the general problem of a formal description of a finite automaton given just in a text description. The book consists of four parts. Basic notions of mathematical logic, such as algebra of logic, propositional calculus, first order predicate calculus, sequential calculus, resolution method and unification (and their exploiting in Prolog) are studied in the first part. The second part deals with the theory of graphs, with some most common practical algorithms operating over graphs and their Prolog implementation. The theory of finite automata is presented in the third part. Finally, basic notions of combinatorics are presented in the fourth part and some interesting combinatorial algorithms are implemented again in Prolog.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references