Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
| BestMatchAlgorithm(best match sort) |
| appearance as argument number 1 |
|
| (subclass BestMatchAlgorithm Procedure) | UXExperimentalTerms.kif 2270-2270 | Best match sort is a subclass of procedure |
| (documentation BestMatchAlgorithm EnglishLanguage "A Procedure that hasPurpose of there being a SearchEngine that is its agent, a SearchQuery which is its patient SRPResults being its agent.") | UXExperimentalTerms.kif 2272-2274 | Best match sort is a subclass of procedure |
| appearance as argument number 2 |
|
|
| (termFormat EnglishLanguage BestMatchAlgorithm "best match sort") | UXExperimentalTerms.kif 2276-2276 |
| antecedent |
|
|
| (=> (instance ?BM BestMatchAlgorithm) (hasPurpose ?BM (exists (?SEARCHENGINE) (and (instance ?SEARCHENGINE SearchEngine) (agent ?BM ?SEARCHENGINE))))) |
UXExperimentalTerms.kif 2278-2284 | If X is an instance of best match sort, then X has the purpose there exists Y such that Y is an instance of search engine and Y is an agent of X |
| (=> (instance ?BM BestMatchAlgorithm) (hasPurpose ?BM (exists (?SearchQuery) (and (instance ?SearchQuery SearchQuery) (patient ?BM ?SearchQuery))))) |
UXExperimentalTerms.kif 2286-2292 | If X is an instance of best match sort, then X has the purpose there exists Y such that Y is an instance of Search query and Y is a patient of X |
| (=> (instance ?BM BestMatchAlgorithm) (hasPurpose ?BM (exists (?RESULT) (and (instance ?RESULT SRPResults) (result ?BM ?RESULT))))) |
UXExperimentalTerms.kif 2294-2300 | If X is an instance of best match sort, then X has the purpose there exists Y such that Y is an instance of search results and Y is a result of X |
| (=> (instance ?BM BestMatchAlgorithm) (hasPurpose ?BM (exists (?QUERY ?SEARCHATTEMPT ?OBJECT ?AGENT) (and (instance ?QUERY SearchQuery) (instance ?SEARCHATTEMPT SearchAttempt) (represents ?QUERY ?SEARCHATTEMPT) (patient ?BM ?QUERY) (instance ?AGENT AutonomousAgent) (patient ?SEARCHATTEMPT ?OBJECT) (agent ?SEARCHATTEMPT ?AGENT))))) |
UXExperimentalTerms.kif 2302-2313 | If X is an instance of best match sort, then All of the following hold: (1) X has the purpose there exist Y, Z,, , W (2) V such that Y is an instance of Search query (3) Z is an instance of search attempt (4) Y expresses Z (5) Y is a patient of X (6) V is an instance of agent (7) W is a patient of Z (8) V is an agent of Z |
| consequent |
|
|
| (=> (and (instance ?SEO SEO) (patient ?SEO ?PAGE)) (hasPurpose ?SEO (exists (?SRPRESULT_BEFORE ?SRPRESULT_AFTER ?BEFORE ?AFTER ?BM1 ?BM2) (and (instance ?SRPRESULT_BEFORE SRPResults) (instance ?SRPRESULT_AFTER SRPResults) (equal ?PAGE (ListOrderFn ?SRPRESULT_BEFORE ?BEFORE)) (equal ?PAGE (ListOrderFn ?SRPRESULT_AFTER ?AFTER)) (instance ?BM1 BestMatchAlgorithm) (instance ?BM2 BestMatchAlgorithm) (earlier (WhenFn ?BM1) (WhenFn ?BM2)) (earlier (WhenFn ?SEO) (WhenFn ?BM2)) (earlier (WhenFn ?BM1) (WhenFn ?SEO)) (greaterThan ?BEFORE ?AFTER))))) |
UXExperimentalTerms.kif 2389-2405 | If X is an instance of search engine optimization and Y is a patient of X, then All of the following hold: (1) X has the purpose there exist ?SRPRESULT_BEFORE, ?SRPRESULT_AFTER,, , W,, , V,, , U (2) T such that ?SRPRESULT_BEFORE is an instance of search results (3) ?SRPRESULT_AFTER is an instance of search results (4) equal Y (5) S element of ?SRPRESULT_BEFORE (6) equal Y (7) R element of ?SRPRESULT_AFTER (8) U is an instance of best match sort (9) T is an instance of best match sort (10) the time of existence of U happens earlier than the time of existence of T (11) the time of existence of X happens earlier than the time of existence of T (12) the time of existence of U happens earlier than the time of existence of X (13) W is greater than V |
| (=> (instance ?RESULTS SRPResults) (exists (?BM) (and (instance ?BM BestMatchAlgorithm) (result ?BM ?RESULTS)))) |
UXExperimentalTerms.kif 2477-2482 | If X is an instance of search results, then there exists Y such that Y is an instance of best match sort and X is a result of Y |
|