The decision problem for Boolean satisfiability, generally referred to as SAT, is the
archetypal NP-complete problem, and encodings of many problems of practical interest exist …

Theorema is a project that aims at supporting the entire process of mathematical theory
exploration within one coherent logic and software system. This survey paper illustrates the …

Der Begriff Künstliche Intelligenz weckt Emotionen. Zum einen ist da die Faszination der
Intelligenz, die offenbar uns Menschen eine besondere Stellung unter den Lebewesen …

A structured organization of information is typically required by symbolic processing. On the
other hand, most connectionist models assume that data are organized according to …

The new edition of this successful and established textbook retains its two original intentions
of explaining how to program in the ML language, and teaching the fundamentals of …

Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

Acquire the tools for understanding new architectures and algorithms of dynamical recurrent
networks (DRNs) from this valuable field guide, which documents recent forays into artificial …

This account of propositional logic concentrates on the algorithmic translation of important
methods, especially of decision procedures for (subclasses of) propositional logic. Important …

This paper provides a detailed description of the CNF part of the TPTP Problem Library for
automated theorem-proving systems. The library is available via the Internet and forms a …

\prove ((E, F), A, B, C, D):-!, prove (E, F| A], B, C, D). prove ((E; F), A, B, C, D):-!, prove (E, A, B,
C, D), prove (F, A, B, C, D). prove (all (H, I), A, B, C, D):-!,\+ length (C, D), copy_term ((H, I …