Machine learning for automated theorem proving: Learning to solve SAT and QSAT
SB Holden - Foundations and Trends® in Machine Learning, 2021 - nowpublishers.com
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 …
archetypal NP-complete problem, and encodings of many problems of practical interest exist …
[HTML][HTML] Theorema: Towards computer-aided mathematical theory exploration
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 …
exploration within one coherent logic and software system. This survey paper illustrates the …
[图书][B] Grundkurs künstliche intelligenz
W Ertel, NT Black - 2016 - Springer
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 …
Intelligenz, die offenbar uns Menschen eine besondere Stellung unter den Lebewesen …
A general framework for adaptive processing of data structures
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 …
other hand, most connectionist models assume that data are organized according to …
[图书][B] ML for the Working Programmer
LC Paulson - 1996 - books.google.com
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 …
of explaining how to program in the ML language, and teaching the fundamentals of …
[图书][B] Heuristic search: theory and applications
S Edelkamp, S Schrödl - 2011 - books.google.com
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 …
problem solving. The authors present a thorough overview of heuristic search with a balance …
[图书][B] A field guide to dynamical recurrent networks
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 …
networks (DRNs) from this valuable field guide, which documents recent forays into artificial …
[图书][B] Propositional logic: deduction and algorithms
HK Büning, T Lettmann - 1999 - books.google.com
This account of propositional logic concentrates on the algorithmic translation of important
methods, especially of decision procedures for (subclasses of) propositional logic. Important …
methods, especially of decision procedures for (subclasses of) propositional logic. Important …
The TPTP problem library
G Sutcliffe, C Suttner - Journal of Automated Reasoning, 1998 - Springer
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 …
automated theorem-proving systems. The library is available via the Internet and forms a …
[PDF][PDF] leanTAP: Lean tableau-based deduction
B Beckert, J Posegga - Journal of Automated Reasoning, 1995 - researchgate.net
\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 …
C, D), prove (F, A, B, C, D). prove (all (H, I), A, B, C, D):-!,\+ length (C, D), copy_term ((H, I …