blob: e06988e9f44e350e7727bb4b92ebab3470762f46 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*
* richard-atp-engine: A saturation-based automated theorem prover for first-order logic.
* Copyright (C) 2026 Richard Qin
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#pragma once
/// @file calculus.h
/// @brief A Calculus bundles the exact set of inference rules + heuristics
/// to use for a specific problem class.
///
/// Think of it as the "algorithm profile" that the Prover loads.
/// Different problems get different calculi:
/// - Pure propositional: resolution + factoring only
/// - FOL without equality: + full unification
/// - FOL with equality: + paramodulation + KBO ordering
/// - Arithmetic: + theory solver integration
///
/// This is the single point where search space control happens.
#include "atp/rewrite/ordering.h"
#include "atp/search/clause_queue.h"
#include "atp/strategy/inference_rule.h"
#include <memory>
#include <string_view>
#include <vector>
namespace atp {
/// A Calculus = a complete specification of how to search for a proof.
/// The Prover is parameterized by this — it never hardcodes which rules to use.
struct Calculus {
/// Name for logging (e.g., "superposition", "pure_resolution").
std::string name;
/// Generating rules (executed in order during the main loop).
std::vector<std::unique_ptr<GeneratingRule>> generating_rules;
/// Simplifying rules (applied to each new clause before enqueuing).
std::vector<std::unique_ptr<SimplifyingRule>> simplifying_rules;
/// Clause selection heuristic.
ClauseComparator comparator = bfsCompare;
/// Term ordering (nullptr if equality reasoning is disabled).
std::unique_ptr<TermOrdering> ordering = nullptr;
/// Resource limits.
size_t max_clauses = 100000;
size_t max_iterations = 500000;
};
} // namespace atp
|
