blob: ee7a83ecee53cc57cecd9be3e0fde06c73d8a7d8 (
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
|
/*
* 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 subsumption.h
/// @brief Forward and backward subsumption checks (backed by discrimination tree).
#include "atp/core/clause.h"
#include "atp/index/discrim_tree.h"
#include <vector>
namespace atp {
/// Subsumption engine: checks if a new clause is subsumed by existing ones
/// (forward) or subsumes existing ones (backward).
class SubsumptionEngine {
public:
explicit SubsumptionEngine(const TermBank& bank);
/// Returns true if `candidate` is subsumed by any existing clause.
[[nodiscard]] bool isForwardSubsumed(const Clause& candidate) const;
/// Returns IDs of existing clauses that are subsumed by `new_clause`.
[[nodiscard]] std::vector<ClauseId> backwardSubsumed(const Clause& new_clause) const;
/// Add a clause to the subsumption index.
void addClause(const Clause& clause);
/// Remove a clause from the subsumption index.
void removeClause(ClauseId id);
private:
DiscrimTree index_;
// TODO: Phase 5 implementation
};
} // namespace atp
|
