High performance ATP systems by combining several AI methods
J Denzinger, M Fuchs, M Fuchs - 1996 - publikationen.sulb.uni-saarland.de
We present a concept for an automated theorem prover that employs a search control based
on ideas from several areas of artificial intelligence (AI). The combination of case-based …
on ideas from several areas of artificial intelligence (AI). The combination of case-based …
Ωmega: Towards a mathematical assistant
C Benzmüller, L Cheikhrouhou, D Fehrer… - … Deduction—CADE-14 …, 1997 - Springer
Ω mega is a mixed-initiative system with the ultimate purpose of supporting theorem proving
in main-stream mathematics and mathematics education. The current system consists of a …
in main-stream mathematics and mathematics education. The current system consists of a …
Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems
Hyper-heuristics aim to automate the heuristic selection process in order to operate well
across different problem instances, or even across different problem domains. A traditional …
across different problem instances, or even across different problem domains. A traditional …
Discount-a distributed and learning equational prover
J Denzinger, M Kronenburg, S Schulz - Journal of Automated Reasoning, 1997 - Springer
The DISCOUNT system is a distributed equational theorem prover based on the teamwork
method for knowledge-based distribution. It uses an extended version of unfailing Knuth …
method for knowledge-based distribution. It uses an extended version of unfailing Knuth …
DISCOUNT: A system for distributed equational deduction
J Avenhaus, J Denzinger, M Fuchs - … , April 5–7, 1995 Proceedings 6, 1995 - Springer
The teamwork method ([De93],[AD93]) is a concept for distributing deduction systems on
several processors. Its behavior is inspired by the behavior of a project team in a company …
several processors. Its behavior is inspired by the behavior of a project team in a company …
Parallel theorem proving
MP Bonacina - Handbook of Parallel Constraint Reasoning, 2018 - Springer
This chapter surveys the research in parallel or distributed strategies for mechanical
theorem proving in first-order logic, and explores some of its connections with the research …
theorem proving in first-order logic, and explores some of its connections with the research …
[PDF][PDF] Knowledge-Based Distributed Search Using Teamwork.
J Denzinger - ICMAS, 1995 - cdn.aaai.org
We present a knowledge-based distribution concept for sesxch problems that ot~ ex no
natural way to determine several agents to cooperate in finding a solution. Systems based …
natural way to determine several agents to cooperate in finding a solution. Systems based …
A taxonomy of parallel strategies for deduction
MP Bonacina - Annals of Mathematics and Artificial Intelligence, 2000 - Springer
This paper presents a taxonomy of parallel theorem-proving methods based on the control
of search (eg, master–slaves versus peer processes), the granularity of parallelism (eg, fine …
of search (eg, master–slaves versus peer processes), the granularity of parallelism (eg, fine …
A taxonomy of theorem-proving strategies
MP Bonacina - Artificial Intelligence Today: Recent Trends and …, 2001 - Springer
This article presents a taxonomy of strategies for fully-automated general-purpose first-order
theorem proving. It covers forward-reasoning ordering-based strategies and backward …
theorem proving. It covers forward-reasoning ordering-based strategies and backward …
Learning domain knowledge to improve theorem proving
J Denzinger, S Schulz - International Conference on Automated Deduction, 1996 - Springer
We present two learning inference control heuristics for equational deduction. Based on
data about facts that contributed to previous proofs, evaluation functions learn to select …
data about facts that contributed to previous proofs, evaluation functions learn to select …