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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/* This file is part of the FaCT++ DL reasoner
Copyright (C) 2011-2015 Dmitry Tsarkov and The University of Manchester
Copyright (C) 2015-2016 Dmitry Tsarkov
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef TONTOLOGYATOM_H
#define TONTOLOGYATOM_H
#include <set>
#include "globaldef.h"
#include "tDLAxiom.h"
/// representation of the ontology atom
class TOntologyAtom
{
protected: // internal types
/// type to compare 2 atoms
struct AtomLess
{
bool operator()(const TOntologyAtom* a1, const TOntologyAtom* a2) const
{ return a1->getId() < a2->getId(); }
};
public: // typedefs
/// set of axioms
typedef AxiomVec AxiomSet;
/// set of atoms
typedef std::set<TOntologyAtom*, AtomLess> AtomSet;
protected: // members
/// set of axioms in the atom
AxiomSet AtomAxioms;
/// set of axioms in the module (Atom's ideal)
AxiomSet ModuleAxioms;
/// set of atoms current one depends on
AtomSet DepAtoms;
/// set of all atoms current one depends on
AtomSet AllDepAtoms;
/// unique atom's identifier
size_t Id;
protected: // methods
/// remove all atoms in AllDepAtoms from DepAtoms
void filterDep ( void )
{
for ( AtomSet::iterator p = AllDepAtoms.begin(), p_end = AllDepAtoms.end(); p != p_end; ++p )
DepAtoms.erase(*p);
}
/// build all dep atoms; filter them from DepAtoms
void buildAllDepAtoms ( AtomSet& checked )
{
// first gather all dep atoms from all known dep atoms
for ( AtomSet::iterator p = DepAtoms.begin(), p_end = DepAtoms.end(); p != p_end; ++p )
{
const AtomSet& Dep = (*p)->getAllDepAtoms(checked);
AllDepAtoms.insert ( Dep.begin(), Dep.end() );
}
// now filter them out from known dep atoms
filterDep();
// add direct deps to all deps
AllDepAtoms.insert ( DepAtoms.begin(), DepAtoms.end() );
// now the atom is checked
checked.insert(this);
}
public: // interface
/// empty c'tor
TOntologyAtom ( void ) : Id(0) {}
/// d'tor
~TOntologyAtom ( void ) {}
// fill in the sets
/// set the module axioms
void setModule ( const AxiomSet& module ) { ModuleAxioms = module; }
/// add axiom AX to an atom
void addAxiom ( TDLAxiom* ax )
{
AtomAxioms.push_back(ax);
ax->setAtom(this);
}
/// add atom to the dependency set
void addDepAtom ( TOntologyAtom* atom )
{
if ( likely(atom != NULL) && atom != this )
DepAtoms.insert(atom);
}
/// get all the atoms the current one depends on; build this set if necessary
const AtomSet& getAllDepAtoms ( AtomSet& checked )
{
if ( checked.count(this) == 0 ) // not build yet
buildAllDepAtoms(checked);
return AllDepAtoms;
}
// access to axioms
/// get all the atom's axioms
const AxiomSet& getAtomAxioms ( void ) const { return AtomAxioms; }
/// get all the module axioms
const AxiomSet& getModule ( void ) const { return ModuleAxioms; }
/// get atoms a given one depends on
const AtomSet& getDepAtoms ( void ) const { return DepAtoms; }
/// get the value of the id
size_t getId() const { return Id; }
/// set the value of the id to ID
void setId ( size_t id ) { Id = id; }
}; // TOntologyAtom
#endif
|
