Abstract
Axiom selection is a task that selects the most likely useful axioms from a large-scale axiom set for proving a given conjecture. Existing axiom selection methods either solely take shallow symbols into account or strongly dependent on previous successful proofs from homologous problems. To address these problems, we introduce a new metric to evaluate the dissimilarity between formulae and utilize it as an evaluator in the selection task. Firstly, we propose a substitution-based metric to compute the dissimilarity between terms. It is a pseudo-metric and can capture the in-depth syntactic difference trigged by both functional and variable subterms. We then extend it to atoms and prove the atom metric also to be a pseudo-metric. Treating formulae as atom sets, we define three kinds of dissimilarity metrics between formulae. Finally, we design and implement conjecture-oriented axiom selection methods based on newly proposed formula metrics. The experimental evaluation is conducted on the MPTP2078 benchmark and demonstrates dissimilarity-based axiom selection improves E proverโs performance. In the best case, it increases the ratio of successful proofs from 30.90% to 42.25%.
Similar content being viewed by others
Notes
The values of 1 and 2 for wv and wf are adopted from their use in E. The use of ln(x +โ1) for g(x) is motivated by its common adoption as a continuous increasing function.
The command is ./eprover โsatauto-schedule โfree-numbers -s -R โdelete-bad-limit=โ2000000000 โdefinitional-cnf=โ24 โprint-statistics โprint-version โproof-object โcpu-limit=โ60 problem_file
The command is ./vampire โmode axiom_selection โoutput_axiom_n ames on problem_file
The command is ./eprover โsatauto-schedule โfree-numbers -s -R โdelete-bad-limit=โ2000000000 โdefinitional-cnf=โ24 โprint-statistics โprint-version โproof-object โcpu-limit=โ60 โsine problem_file
The command is ./eprover โsatauto-schedule โfree-numbers -s -R โdelete-bad-limit=โ2000000000 โdefinitional-cnf=โ24 โprint-statistics โprint-version โproof-object โcpu-limit=โ10 problem_file
References
Koubarakis M (2002) Querying Temporal Constraint Networks: A Unifying Approach. Appl Intell 17(3):297โ311
Sutcliffe G (2017) The TPTP Problem Library and Associated Infrastructure. From CNF to TH0, TPTP v6.4.0. J Autom Reas 59(4):483โ502
McCune W (2005) Prover9 and Mace4. http://www.cs.unm.edu/~mccune/prover9/, Accessed December 14, 2018
Kovรกcs L, Voronkov A (2013) First-order theorem proving and Vampire. In: International Conference on Computer Aided Verification. Springer, pp 1โ35
Schulz S (2002) Eโa brainiac theorem prover. Ai Commun 15(2, 3):111โ126
Rudnicki P (1992) An overview of the Mizar project. In: Proceedings of the 1992 Workshop on Types for Proofs and Programs, pp 311โ330
Lenat D B (1995) CYC: A large-scale investment in knowledge infrastructure. Commun ACM 38(11):33โ38
Niles I, Pease A (2001) Towards a standard upper ontology. In: Proceedings of the international conference on Formal Ontology in Information Systems-Volume 2001. ACM, pp 2โ9
Kern C, Greenstreet M R (1999) Formal verification in hardware design: a survey. ACM Trans Des Autom Electron Syst (TODAES) 4(2):123โ193
Klein G, Elphinstone K, Heiser G, Andronick J, Cock D, Derrin P, Elkaduwe D, Engelhardt K, Kolanski R, Norrish M et al (2009) seL4: Formal verification of an OS kernel. In: Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles. ACM, pp 207โ220
Leroy X (2009) Formal verification of a realistic compiler. Commun ACM 52(7):107โ115
Sutcliffe G, Puzis Y (2007) Srass-a semantic relevance axiom selection system. In: International Conference on Automated Deduction. Springer, pp 295โ310
Pudlรกk P (2007) Semantic selection of premisses for automated theorem proving. ESARLT 257
Roederer A, Puzis Y, Sutcliffe G (2009) Divvy: An ATP meta-system based on axiom relevance ordering. In: International Conference on Automated Deduction. Springer, pp 157โ162
Meng J, Paulson L C (2009) Lightweight relevance filtering for machine-generated resolution problems. J Appl Log 7(1):41โ 57
Hoder K, Voronkov A (2011) Sine qua non for large theory reasoning. In: International Conference on Automated Deduction. Springer, pp 299โ314
Alama J, Heskes T, Kรผhlwein D, Tsivtsivadze E, Urban J (2014) Premise selection for mathematics by corpus analysis and kernel methods. J Autom Reason 52(2):191โ213
Kaliszyk C, Urban J, Vyskocil J (2015) Efficient semantic features for automated reasoning over large theories. In: Twenty-Fourth International Joint Conference on Artificial Intelligence
Piotrowski B, Urban J (2018) ATPboost: Learning premise selection in binary setting with atp feedback. In: International Joint Conference on Automated Reasoning. Springer, pp 566โ 574
Irving G, Szegedy C, Alemi A A, Eรฉn N, Chollet F, Urban J (2016) Deepmath-deep sequence models for premise selection. In: Advances in Neural Information Processing Systems, pp 2235โ 2243
Wang M, Tang Y, Wang J, Deng J (2017) Premise selection for theorem proving by deep graph embedding. In: Advances in Neural Information Processing Systems, pp 2786โ2796
Crouse M, Abdelaziz I, Cornelio C, Thost V, Wu L, Forbus K, Fokoue A (2019) Improving Graph Neural Network Representations of Logical Formulae with Subgraph Pooling. arXiv:1911.06904
Hutchinson A (1997) Metrics on terms and clauses. In: European Conference on Machine Learning. Springer, pp 138โ145
Nienhuys-Cheng S-H (1997) Distance between herbrand interpretations: A measure for approximations to a target concept. In: International Conference on Inductive Logic Programming. Springer, pp 213โ226
Ramon J, Bruynooghe M (1998) A framework for defining distances between first-order logic objects. In: International Conference on Inductive Logic Programming. Springer, pp 271โ280
Muggleton S (1991) Inductive logic programming. Gener Comput 8(4):295โ318
Bachmair L, Ganzinger H (2001) Resolution theorem proving. In: Handbook of automated reasoning. Elsevier, pp 19โ99
Plotkin G D (1970) A note on inductive generalization. Mach Intell 5(1):153โ163
Liu Q, Xu Y, He X (2020) Selecting premises by first-order formula dissimilarity. In: Developments Of Artificial Intelligence Technologies In Computation And Robotics-Proceedings Of The 14th International Flins Conference (Flins 2020), vol 12. World Scientific, pp 269
McCune W W (1994) Otter 3.0 reference manual and guide. Technical Report. Argonne National Lab., IL
Rudnicki P (1992) An Overview of the Mizar Project. In: Proceedings of the 1992 Workshop on Types for Proofs and Programs, pp 311โ332
Liu Q, Wu Z, Wang Z, Sutcliffe G Evaluation of Axiom Selection Techniques
Jakubรผv J, Urban J (2016) Extending E Prover with Similarity Based Clause Selection Strategies
Sutcliffe G (2008) CASC-J4 the 4th IJCAR ATP system competition. In: International Joint Conference on Automated Reasoning. Springer, pp 457โ458
Funding
This research were funded by the National Natural Science Foundation of China of grant numbers 61603307, 61673320, and 61473239 and the Ministry of Education in China Project of Humanities and Social Sciences of grant number 9YJCZH048.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors declare no conflict of interest.
Additional information
Publisherโs note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix A
Appendix A
Proof Proof of Lemma 1
We need to prove that dโฒ satisfies all properties a pseudo-metric has if function Sโฒ satisfies 1 - 6.
Let t1, t2 be arbitrary two terms. By condition 1, obviously,
If t2 = t1, t1 is the lgg of itself. The substitution mapping a term to itself is an empty substitution or a renaming substitution. By conditions 2 and 3,
According to the definition of dโฒ, the symmetry is also satisfied. That is,
Finally, we prove that dโฒ satisfies the triangle inequality.
As shown in Fig.ย 2, t1, t2, and t3 are arbitrary three terms, lgg(t1,t2) = t4, lgg(t1,t3) = t5, lgg(t2,t3) = t6, lgg(t5,t6) = t7. Here, t3 must be a unified term of t5 and t6. For convenience, we use ๐ij to denote the substitution which maps from term ti to term tj.
By the definition of dโฒ,
By condition 5,
By condition 4,
By condition 6,
Hence,
โก
Proof Proof of Theorem 1
By lemma 1, we only need to ensure that the function ST satisfies 1 - 6.
-
1.
For any substitution ๐, obviously, by (3) and (4), we have
$$S_{f}(\theta_{f})\geq0 \text{and} S_{v}(\theta_{v})\geq0.$$Hence, by (5),
$$S_{T}(\theta)\geq_{2}(0,0).$$ -
2.
For an empty substitution ฮต, both ฮตf and ฮตv are also empty substitutions. Hence, Sf(ฮตf), Sv(ฮตv) are empty sums, and we have
$$S_{T}(\varepsilon)=_{2}(0,0).$$ -
3.
For a renaming substitution ฮท and t1ฮท = t2, we have ฮทf = ฮต and ฮทv = ฮท. Suppose that ฮทv = ฮท = {X1โฆY1,...,XnโฆYn}, where Y1, ..., Yn are distinct variables in t2 and โXiโฆYi โ ฮทv, \(occ_{t_{1}}^{+}(X_{i})=occ_{t_{2}}^{+}(Y_{i})\) and \(g(w_{v}(occ_{t_{2}}^{+}(Y_{i})-occ_{t1}^{+}(X_{i})))=g(0)=0\). Hence,
$$ S_{T}(\eta)=_{2}(0,0).$$ -
4.
As shown in Fig.ย 3 , for arbitrary three terms t1, t2 and t3, which satisfy:
$$t_{1}\theta_{1}=t_{2}, t_{2}\theta_{2}=t_{3} \text{and} t_{1}\theta=t_{3}. $$To prove the inequality of ST(๐) โค2ST(๐1) + ST(๐2), we would like to prove the conclusion of \(S_{f}(\theta _{f})\leq S_{f}(\theta _{1_{f}})+S_{f}(\theta _{2_{f}})\) at first.
-
(a)
๐f = โ . Hence, \(\theta _{1_{f}}=\boldsymbol {\emptyset }\) and \(\theta _{2_{f}}=\boldsymbol {\emptyset }\). We have
\(S_{f}(\theta _{f})=S_{f}(\theta _{1_{f}})+S_{f}(\theta _{2_{f}})\).
-
(b)
๐fโ โ . Suppose that Ran(๐f) = {u1,...,um}(m โฅโ1). In ๐, โui โ Ran(๐f), let \(V_{t_{1}}(u_{i})=\{X_{i1}, ..., X_{ik}\}(k\geq 1)\), denoting the set of variables substituted by ui in t1. \(\forall X_{ij}\in V_{t_{1}}(u_{i})\), let \(occ_{t_{1}}(X_{ij})=n_{ij}(\geq 1)\) and \({\sum }_{j=1}^{k}n_{ij}=n_{i}\). Hence, Sf(๐f) also can be presented as:
\(S_{f}(\theta _{f})={\sum }_{f\in \bigcup _{i=1}^{m}F(u_{i})}w_{f}(f)({\sum }_{i=1}^{m}n_{i}occ_{u_{i}}(f))\).
For any \(f\in \bigcup _{i=1}^{m}F(u_{i})\), \({\sum }_{i=1}^{m}n_{i}occ_{u_{i}}(f)\) is considered as the number of new occurrences of f under ๐f. Obviously, the sum of the number of new occurrences of f under \(\theta _{1_{f}}\) and \(\theta _{2_{f}}\) equals to \({\sum }_{i=1}^{m}n_{i}occ_{u_{i}}(f)\). Hence,
\(S_{f}(\theta _{f})=S_{f}(\theta _{1_{f}})+S_{f}(\theta _{2_{f}})\).
Next, we start to prove \(S_{v}(\theta _{v})\leq S_{v}(\theta _{1_{v}})+S_{v}(\theta _{2_{v}})\).
-
(a)
๐v is a renaming substitution or an empty substitution. \(\theta _{1_{v}}\) and \(\theta _{2_{v}}\) are either empty substitution or renaming substitution (should not be empty at the same time). By the previous proof, we know
\(S_{v}(\theta _{v})=S_{v}(\theta _{1_{v}})=S_{v}(\theta _{2_{v}})=0\).
Hence,
\(S_{v}(\theta _{v})=S_{v}(\theta _{1_{v}})+S_{v}(\theta _{2_{v}})\).
-
(b)
Otherwise, suppose that ๐v = {X1โฆZ1,...,XnโฆZn}. โXiโฆZi โ ๐v, let \(\theta _{v_{i}}=\{X_{i}\mapsto Z_{i}\}\), then \(\bigcup _{i=1}^{n}\theta _{v_{i}}=\theta _{v}\) and \(\theta _{v_{i}}\cap \theta _{v_{j}}=\boldsymbol {\emptyset }(i\neq j)\). Obviously,
\(S_{v}(\theta _{v})={\sum }_{i=1}^{n}S_{v}(\theta _{v_{i}})\).
For any \(\theta _{v_{i}}\), we have
\(S_{v}(\theta _{v_{i}})=g(w_{v}(occ_{t_{3}}^{+}(Z_{i})-occ_{t_{1}}^{+}(X_{i})))\).
It must exist substitutions \(\theta _{1_{v_{i}}}=\{X_{i}\mapsto Y_{i}\}\subseteq \theta _{1_{v}}\) (Yi may equal to Xi) and \(\theta _{2_{v_{i}}}=\{Y_{i}\mapsto Z_{i}\}\subseteq \theta _{2_{v}}\) (Yi may equal to Zi) such that
\(X_{i}\theta _{1_{v_{i}}}\theta _{2_{v_{i}}}=Z_{i}\).
If Yi = Xi or Yi = Zi, then \(\theta _{1_{v_{i}}}\) or \(\theta _{2_{v_{i}}}\) is an empty substitution. Obviously,
\(occ_{t_{2}}^{+}(Y_{i})\geq occ_{t_{1}}^{+}(X_{i})\) and \(occ_{t_{3}}^{+}(Z_{i})\geq occ_{t_{2}}^{+}(Y_{i})\).
By the properties of function g, we have
\(g(w_{v}(occ_{t_{3}}^{+}(Z_{i})-occ_{t_{1}}^{+}(X_{i})))=g(w_{v}(occ_{t_{3}}^{+}(Z_{i})-occ_{t_{2}}^{+}(Y_{i})+occ_{t_{2}}^{+}(Y_{i})-occ_{t_{1}}^{+}(X_{i})))\leq g(w_{v}(occ_{t_{3}}^{+}(Z_{i})-occ_{t_{2}}^{+}(Y_{i})))+g(w_{v}(occ_{t_{2}}^{+}(Y_{i})-occ_{t_{1}}^{+}(X_{i})))\).
Hence,
\(S_{v}(\theta _{v_{i}})\leq S_{v}(\theta _{1_{v_{i}}})+S_{v}(\theta _{2_{v_{i}}})\) and \(S_{v}(\theta _{v})\leq S_{v}(\theta _{1_{v}})+S_{v}(\theta _{2_{v}})\).
As a result,
ST(๐) โค2ST(๐1) + ST(๐2).
-
(a)
-
5.
Under the same assumptions in 4, it is clear that \(S_{f}(\theta _{2_{f}})\leq S_{f}(\theta _{f})\).
-
(a)
\(S_{f}(\theta _{2_{f}})<S_{f}(\theta _{f})\). It is obvious that ST(๐2) <2ST(๐).
-
(b)
\(S_{f}(\theta _{2_{f}})=S_{f}(\theta _{f})\). Suppose that ๐v = {X1โฆZ1,...,XnโฆZn}. โXiโฆZi โ ๐v, there must exist substitutions \(\{X_{i}\mapsto Y_{i}^{\prime }\}\subseteq \theta _{1_{v}}\) and \(\{Y_{i}^{\prime }\mapsto Z_{i}\}\subseteq \theta _{2_{v}}\). Let \(\theta _{2_{v}}^{\prime }=\bigcup _{i}\{Y_{i}^{\prime }\mapsto Z_{i} | occ_{t_{3}}^{+}(Z_{i})\geq occ_{t_{2}}^{+}(Y_{i}^{\prime })\}\), \(\theta _{2_{v}}^{\prime \prime }=\bigcup _{j}\{Y_{j}^{\prime \prime }\mapsto Z_{j}^{\prime \prime } | Y_{j}^{\prime \prime } \in Ran(\theta _{1_{f}})\wedge occ_{t_{2}}^{+}(Y_{j}^{\prime \prime })=occ_{t_{3}}^{+}(Z_{j}) \}\). We can assert that \(\theta _{2_{v}}=\theta _{2_{v}}^{\prime }\cup \theta _{2_{v}}^{\prime \prime }\). Hence,
\(S_{v}(\theta _{2_{v}})\leq S_{v}(\theta _{v})\).
As a result,
ST(๐2) โค2ST(๐).
-
(a)
-
6.
As shown in Fig.ย 4, t1 and t2 are two terms which can be unified, lgg(t1,t2) = t3, and t4 is a unified term of t1 and t2 (not need to be the most general unified term). For proving the conclusion of ST(ฯ1) + ST(ฯ2) โค2ST(ฯ1) + ST(ฯ2), we start to prove \(S_{f}(\rho _{1_{f}})+S_{f}(\rho _{2_{f}})\leq S_{f}(\varphi _{1_{f}})+S_{f}(\varphi _{2_{f}})\) at first.
-
(a)
\(\rho _{1_{f}}=\boldsymbol {\emptyset }\) and \(\rho _{2_{f}}=\boldsymbol {\emptyset }\). Obviously,
\(S_{f}(\rho _{1_{f}})+S_{f}(\rho _{2_{f}})\leq S_{f}(\varphi _{1_{f}})+S_{f}(\varphi _{2_{f}})\).
-
(b)
\(\rho _{1_{f}}\neq \boldsymbol {\emptyset }\) or \(\rho _{2_{f}}\neq \boldsymbol {\emptyset }\). If \(\rho _{1_{f}}\neq \boldsymbol {\emptyset }\), suppose that \(Ran(\rho _{1_{f}})=\{u_{1}^{\prime }, ..., u_{h}^{\prime }\}\) and \(Ran(\varphi _{2_{f}})=\{u_{1}, ..., u_{l}\}\). \(\forall u_{i}^{\prime }\in Ran(\rho _{1_{f}})\), let \(V_{t_{3}}(u_{i}^{\prime })=\{X_{i1}, ..., X_{ik}\}(k\geq 1)\) under ฯ1. \(\forall X_{ij}\in V_{t_{3}}(u_{i}^{\prime })\), \(occ_{t_{3}}(X_{ij})=n_{ij}^{\prime }\) and \({\sum }_{j=1}^{k}n_{ij}^{\prime }=n_{i}^{\prime }\). \(\forall u_{r}\in Ran(\varphi _{2_{f}})\), let \(V_{t_{2}}(u_{r})=\{Z_{r1}, ..., Z_{rs}\}(s\geq 1)\) under ฯ2. \(\forall Z_{rj}\in V_{t_{2}}(u_{r})\), \(occ_{t_{2}}(Z_{rj})=n_{rj}\) and \({\sum }_{j=1}^{s}n_{rj}=n_{r}\). By the previous proof, we have \(S_{f}(\rho _{1_{f}})={\sum }_{f\in \bigcup _{i=1}^{h}F(u_{i}^{\prime })}w_{f}(f)({\sum }_{i=1}^{h}n_{i}^{\prime }occ_{u_{i}^{\prime }}(f))\), \(S_{f}(\varphi _{2_{f}})={\sum }_{f\in \bigcup _{r=1}^{l}F(u_{r})}w_{f}(f)({\sum }_{r=1}^{l}n_{r}occ_{u_{r}}(f))\).
In ฯ1, \(\forall X\in \bigcup _{i=1}^{m}V_{t_{3}}(u_{i}^{\prime })\), X is substituted by a functional term. Because t1 and t2 can be unified, X must be substituted by a variable in ฯ2. Hence, \(\exists Z\in \bigcup _{r=1}^{l}V_{t_{2}}(u_{r})\), such that Xฯ1ฯ1 = Xฯ2ฯ2 = Zฯ2.
That is, \(\forall f\in \bigcup _{i=1}^{h}F(u_{i}^{\prime })\), there must exist some \(u_{r}\in Ran(\varphi _{2_{f}})\) such that f โ ur. Hence,
\(\bigcup _{i=1}^{h}F(u_{i}^{\prime })\subseteq \bigcup _{r=1}^{l}F(u_{r})\) \({\sum }_{i=1}^{h}n_{i}^{\prime }occ_{u_{i}^{\prime }}(f)\leq {\sum }_{r=1}^{l}n_{r}occ_{u_{r}}(f)\).
As a consequence,
\(S_{f}(\rho _{1_{f}})\leq S_{f}(\varphi _{2_{f}})\).
In the same way, if \(\rho _{2_{f}}\neq \boldsymbol {\emptyset }\), we have
\(S_{f}(\rho _{2_{f}})\leq S_{f}(\varphi _{1_{f}})\).
In a conclusion,
\(S_{f}(\rho _{1_{f}})+S_{f}(\rho _{2_{f}})\leq S_{f}(\varphi _{1_{f}})+S_{f}(\varphi _{2_{f}})\).
Next, we would like to prove \(S_{v}(\rho _{1_{v}})+S_{v}(\rho _{2_{v}})\leq S_{v}(\varphi _{1_{v}})+S_{v}(\varphi _{2_{v}})\) when \(S_{f}(\rho _{1_{f}})+S_{f}(\rho _{2_{f}})=S_{f}(\varphi _{1_{f}})+S_{f}(\varphi _{2_{f}})\). In this case, we have
\(S_{f}(\rho _{1_{f}})=S_{f}(\varphi _{2_{f}})\) and \(S_{f}(\rho _{2_{f}})=S_{f}(\varphi _{1_{f}})\),
-
(a)
\(S_{f}(\rho _{1_{f}})=S_{f}(\varphi _{2_{f}})=\boldsymbol {\emptyset }\) and \(S_{f}(\rho _{2_{f}})=S_{f}(\varphi _{1_{f}})=\boldsymbol {\emptyset }\). We have
\(S_{v}(\rho _{1_{v}})\leq S_{v}(\varphi _{2_{v}})\), \(S_{v}(\rho _{2_{v}})\leq S_{v}(\varphi _{1_{v}})\).
Hence,
\(S_{v}(\rho _{1_{v}})+S_{v}(\rho _{2_{v}})\leq S_{v}(\varphi _{1_{v}})+S_{v}(\varphi _{2_{v}})\).
-
(b)
\(S_{f}(\rho _{1_{f}})=S_{f}(\varphi _{2_{f}}) \neq \boldsymbol {\emptyset }\) or \(S_{f}(\rho _{2_{f}})=S_{f}(\varphi _{1_{f}})\neq \boldsymbol {\emptyset }\). If \(S_{f}(\rho _{1_{f}})=S_{f}(\varphi _{2_{f}})\neq \boldsymbol {\emptyset }\), suppose that \(Ran(\rho _{1_{f}})=\{u_{1}^{\prime }, ..., u_{h}^{\prime }\}\). Let \(V_{t_{3}}(u_{i}^{\prime })=\{X_{i1}, ..., X_{ik}\}(k\geq 1)\) under ฯ1, we can assert that \(\{X_{i1}\mapsto Y_{i1}, ..., X_{ik}\mapsto Y_{ik}\}\subseteq \rho _{2_{v}}\), where \(occ_{t_{3}}^{+}(X_{ij})=occ_{t_{2}}^{+}(Y_{ij})(1\leq j \leq k)\). For any singleton element \(\rho _{2_{v_{j}}}\in \rho _{2_{v}}/\bigcup _{i}\{X_{i1}\mapsto Y_{i1}, ..., X_{ik}\mapsto Y_{ik}\}\), Because t1 and t2 can be unified, there must exist a set \(\varphi _{1_{v_{j}}}\) such that \(S_{v}(\rho _{2_{v_{j}}})\leq S_{v}(\varphi _{1_{v_{j}}})\). Hence,
\(S_{v}(\rho _{2_{v}})\leq S_{v}(\varphi _{1_{v}})\).
In the same way, if \(S_{f}(\rho _{2_{f}})=S_{f}(\varphi _{1_{f}})\neq \boldsymbol {\emptyset }\), we have
\(S_{v}(\rho _{1_{v}})\leq S_{v}(\varphi _{2_{v}})\).
In a conclusion,
\(S_{v}(\rho _{1_{v}})+S_{v}(\rho _{2_{v}})\leq S_{v}(\varphi _{1_{v}})+S_{v}(\varphi _{2_{v}})\).
Hence,
$$S_{T}(\rho_{1})+S_{T}(\rho_{2})\leq_{2} S_{T}(\varphi_{1})+S_{T}(\varphi_{2}).$$ -
(a)
โก
Proof Proof of theorem 2
Given the function dT, dA must satisfy the properties 1 and 2 of pseudo-metric with no doubt. In the next proof, we only prove that dA satisfies the triangle inequality.
-
1.
A1, A2 are compatible.
-
(a)
If A3 is is compatible with A1 and A2, the triangle inequality is satisfied obviously.
-
(b)
If A3 is incompatible with A1 and A2, we have
\(d_{A}(A_{1},A_{3})=_{2}(+\infty ,+\infty )\), \(\qquad ~~~~~ d_{A}(A_{2},A_{3})=_{2}(+\infty ,+\infty )\),
and \(d_{A}(A_{1},A_{3})+d_{A}(A_{2},A_{3})=_{2}(+\infty ,+\infty )\).
Hence,
\(d_{A}(A_{1},A_{2})<_{2}(+\infty ,+\infty )=_{2}d_{A}(A_{1},A_{3})+d_{A}(A_{2},A_{3})\).
-
(a)
-
2.
A1, A2 are incompatible.
-
(a)
If A3 is incompatible with A1 and A2, we have
dA(A1,A2) =2dA(A1,A3) + dA(A2,A3).
-
(b)
If A3 is compatible with A1 or A2 (A3 only compatible with one atom). Here, we assume that A3 is compatible with A1,
\(d_{A}(A_{1},A_{3})<_{2}(+\infty ,+\infty )\), \(~~~~~d_{A}(A_{2},A_{3})=_{2}(+\infty ,+\infty )\),
and
\(d_{A}(A_{1},A_{3})+d_{A}(A_{2},A_{3})=_{2}(+\infty ,+\infty )\).
Hence,
dA(A1,A2) =2dA(A1,A3) + dA(A2,A3).
-
(a)
In a conclusion,
dA(A1,A2) โค2dA(A1,A3) + dA(A2,A3). โก
Proof Proof of Theorem 3
Given the atom metric dA, it is obvious that \(d_{F_{m}}\) satisfies the properties 1 and 2. Next, we continue to prove \(d_{F_{m}}\) satisfies the triangle inequality.
For a formula F with the corresponding atom set D, DrF = {A|โB โ D,dA(A,B) โค r} is a set of atoms that are at most r far away from one atom in F. observe that
\(d_{F_{m}}(F_{1},F_{2})=min\{r|D_{1}\subseteq D_{r}F_{2} \wedge D_{2}\subseteq D_{r}F_{1}\}\)
Given a formula F3 with the corresponding atom set D3, if
\(D_{3}\subseteq D_{r}F_{1}\wedge D_{1}\subseteq D_{r}F_{3} \wedge D_{3}\subseteq D_{s}F_{2}\wedge D_{2}\subseteq D_{s}F_{3}\),
then
โA โ D1,โC โ D3, (dA(A,C) โค r โงโB โ D2,dA(C,B) โค s).
In this case, \(D_{1}\subseteq D_{r+s}F_{2}\). We can also prove \(D_{2}\subseteq D_{r+s}F_{1}\).
Hence, if \(d_{F_{m}}(F_{1},F_{3})\leq r\) and \(d_{F_{m}}(F_{3},F_{2})\leq s\), then \(d_{F_{m}}(F_{1},F_{2})\leq r+s\), and consequently \(d_{F_{m}}(F_{1},F_{2}) \leq d_{F_{m}}(F_{1}, F_{3}) + d_{F_{m}}(F_{3}, F_{2})\). โก
Rights and permissions
About this article
Cite this article
Liu, Q., Xu, Y. Axiom selection over large theory based on new first-order formula metrics. Appl Intell 52, 1793โ1807 (2022). https://doi.org/10.1007/s10489-021-02469-1
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-021-02469-1