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 …

[图书][B] Conflicting agents: conflict management in multi-agent systems

C Tessier, L Chaudron, HJ Müller - 2005 - books.google.com
Conflicts between agents acting in a multi-agent environment arise for different reasons,
involve different concepts, and are dealt with in different ways, depending on the kind of …

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 …

[HTML][HTML] Computing cooperative solution concepts in coalitional skill games

Y Bachrach, DC Parkes, JS Rosenschein - Artificial Intelligence, 2013 - Elsevier
We consider a simple model of cooperation among agents called Coalitional Skill Games
(CSGs). This is a restricted form of coalitional games, where each agent has a set of skills …

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 …

[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 …

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 …

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 …

An alternative approach to concurrent theorem-proving

M Fisher - Machine Intelligence and Pattern Recognition, 1997 - Elsevier
We present an alternative mechanism for representing concurrent theorem-proving activity
which primarily relies upon massive parallelism and efficient broadcast communication. This …

[PDF][PDF] Recording and analysing knowledge-based distributed deduction processes

J Denzinger, S Schulz - Journal of Symbolic Computation, 1996 - core.ac.uk
Distributed models for deduction allow for more powerful proof systems, but also lead to new
problems. In particular, the analysis of the deduction process becomes harder, as a number …