Algorithm for Extraction Common Properties of Objects Described in the Predicate Calculus Language with Several Predicate Symbols

In artificial intelligence problems, connected with the study of complex structured objects which are described in the terms of properties of their elements and relationships between these elements, it is convenient to use predicate calculus formulas, more precisely elementary conjunctions of atomic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Programming and computer software Ročník 50; číslo Suppl 1; s. S1 - S9
Hlavní autoři: Kosovskaya, T. M., Zhou, J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.10.2024
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Complex variables
Complexity
Computer Science
Isomorphism
Object recognition
Operating Systems
Predicate calculus
Software Engineering
Software Engineering/Programming and Operating Systems
Symbols
Variables
maximal common subformula
isomorphism of elementary conjunctions of predicate formulas
unifier of predicate formulas
ISSN:0361-7688, 1608-3261
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In artificial intelligence problems, connected with the study of complex structured objects which are described in the terms of properties of their elements and relationships between these elements, it is convenient to use predicate calculus formulas, more precisely elementary conjunctions of atomic predicate formulas. In such a case, the problem of extraction common properties of objects arises. The common properties of complex structured objects are set by formulas with variables as arguments, which, up to the names of the arguments, coincide with the subformulas of the objects under study, that is, are isomorphic to these subformulas. Previously, the authors developed algorithms for checking such formulas for isomorphism, as well as for extraction the maximal common subformula of two elementary conjunctions of predicate formulas with a single predicate symbol. Two algorithms, the first of which solves this problem for elementary conjunctions containing two predicate symbols, and the second for an arbitrary number of predicate symbols are proposed in this paper using the last-mentioned algorithm. Estimates of the computational complexity of the presented algorithms are proved. The algorithm is implemented in Python.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768824700348