blob: e58b185e44d22fb3fc877fae0b41bf33d47209f0 (
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
|
/*
* 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 literal.h
/// @brief A literal is a (possibly negated) atomic formula.
#include "atp/core/types.h"
namespace atp {
/// A literal: a polarity flag plus the TermId of the atom.
struct Literal {
TermId atom_; ///< TermId of the predicate application
bool is_positive_; ///< true = positive, false = negated
/// Complement: flip polarity, same atom.
[[nodiscard]] Literal complement() const { return {.atom_ = atom_, .is_positive_ = !is_positive_}; }
bool operator==(const Literal& other) const = default;
};
} // namespace atp
|
