diff options
| author | Richard Qin <richard.qin.x@gmail.com> | 2026-04-02 04:10:53 +0800 |
|---|---|---|
| committer | Richard Qin <richard.qin.x@gmail.com> | 2026-04-02 04:10:53 +0800 |
| commit | cc440e2674697afc967e081cf91e03f149333502 (patch) | |
| tree | 6ad787ea9fbcc716378fbc5bac16122a566f1650 /proofsearch/include/atp/infer/resolution.h | |
| download | rcc-project-cc440e2674697afc967e081cf91e03f149333502.tar.gz rcc-project-cc440e2674697afc967e081cf91e03f149333502.tar.xz | |
Initial commit: Build project architecture, define interfaces, write documentation, with the help of Claude
Diffstat (limited to 'proofsearch/include/atp/infer/resolution.h')
| -rw-r--r-- | proofsearch/include/atp/infer/resolution.h | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/proofsearch/include/atp/infer/resolution.h b/proofsearch/include/atp/infer/resolution.h new file mode 100644 index 0000000..2d73b06 --- /dev/null +++ b/proofsearch/include/atp/infer/resolution.h @@ -0,0 +1,44 @@ +/* + * 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 resolution.h +/// @brief Binary resolution and factoring inference rules. + +#include "atp/core/clause.h" +#include "atp/core/term_bank.h" + +#include <optional> +#include <vector> + +namespace atp { + +/// Attempt binary resolution between two clauses on the specified literal indices. +/// @return The resolvent clause if resolution succeeds, std::nullopt otherwise. +std::optional<Clause> resolve(const TermBank& bank, const Clause& c1, size_t lit_idx1, + const Clause& c2, size_t lit_idx2); + +/// Generate all possible resolvents between two clauses. +std::vector<Clause> allResolvents(const TermBank& bank, const Clause& c1, const Clause& c2); + +/// Attempt factoring on a single clause (merge two unifiable literals). +std::vector<Clause> factor(const TermBank& bank, const Clause& c); + +} // namespace atp |
