Unification Algorithm Implementation for First-Order Logic Inference Engines

A unification algorithm is one of the most important parts of a First-Order Logic (FOL) inference engine because it allows for the discovery of substitutions that make two logical expressions identical. This process, in fact, is the very foundation for the work of successful automated reasoning and...

Full description

Saved in:
Bibliographic Details
Published in:2025 International Conference on Emerging Technologies in Computing and Communication (ETCC) pp. 1 - 6
Main Authors: Babu, Tina, S, Tejaswi, K, Darshan S, M, Pavan kumar, P, Raviprakash B, G, Ravindra, Parashar, Komal
Format: Conference Proceeding
Language:English
Published: IEEE 26.06.2025
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A unification algorithm is one of the most important parts of a First-Order Logic (FOL) inference engine because it allows for the discovery of substitutions that make two logical expressions identical. This process, in fact, is the very foundation for the work of successful automated reasoning and knowledge representation systems: such systems work by manipulating logical formulas in the tasks of theorem proving, query answering, and updating a knowledge base. Traditionally, unification uses heuristic and manual approaches that are very time-consuming and prone to errors. But recent advances in AI and machine learning techniques applied along with some image processing techniques open new scopes within which the process of unification may be made more efficient and accurate. This paper describes how the unification algorithm can be put into practice for inference engines built on FOL, focusing on how it facilitates the automation of logical deduction. We discuss a range of approaches from using CNN for the detection of very subtle logical relationships and differences in expressions. Put emphasis on recursive unification to cope with compound terms and nested structures. Methods proposed generally indicate rather serious efficiency improvements for scalability and reliability in automated reasoning systems. The unification procedure is more consistent and reproducible and can deal with large-scale logical problems if AI is applied.
AbstractList A unification algorithm is one of the most important parts of a First-Order Logic (FOL) inference engine because it allows for the discovery of substitutions that make two logical expressions identical. This process, in fact, is the very foundation for the work of successful automated reasoning and knowledge representation systems: such systems work by manipulating logical formulas in the tasks of theorem proving, query answering, and updating a knowledge base. Traditionally, unification uses heuristic and manual approaches that are very time-consuming and prone to errors. But recent advances in AI and machine learning techniques applied along with some image processing techniques open new scopes within which the process of unification may be made more efficient and accurate. This paper describes how the unification algorithm can be put into practice for inference engines built on FOL, focusing on how it facilitates the automation of logical deduction. We discuss a range of approaches from using CNN for the detection of very subtle logical relationships and differences in expressions. Put emphasis on recursive unification to cope with compound terms and nested structures. Methods proposed generally indicate rather serious efficiency improvements for scalability and reliability in automated reasoning systems. The unification procedure is more consistent and reproducible and can deal with large-scale logical problems if AI is applied.
Author Parashar, Komal
S, Tejaswi
Babu, Tina
K, Darshan S
P, Raviprakash B
G, Ravindra
M, Pavan kumar
Author_xml – sequence: 1
  givenname: Tina
  surname: Babu
  fullname: Babu, Tina
  email: tinababup@gmail.com
  organization: Alliance School of Advanced Computing, Alliance University,Bangalore,India
– sequence: 2
  givenname: Tejaswi
  surname: S
  fullname: S, Tejaswi
  email: tejaswi67@gmail.com
  organization: Alliance School of Advanced Computing, Alliance University,Bangalore,India
– sequence: 3
  givenname: Darshan S
  surname: K
  fullname: K, Darshan S
  organization: Alliance School of Advanced Computing, Alliance University,Bangalore,India
– sequence: 4
  givenname: Pavan kumar
  surname: M
  fullname: M, Pavan kumar
  organization: Alliance School of Advanced Computing, Alliance University,Bangalore,India
– sequence: 5
  givenname: Raviprakash B
  surname: P
  fullname: P, Raviprakash B
  organization: Alliance School of Advanced Computing, Alliance University,Bangalore,India
– sequence: 6
  givenname: Ravindra
  surname: G
  fullname: G, Ravindra
  organization: Alliance School of Advanced Computing, Alliance University,Bangalore,India
– sequence: 7
  givenname: Komal
  surname: Parashar
  fullname: Parashar, Komal
  email: komal.parashar.orp@chitkara.edu.in
  organization: Chitkara University,Centre of Research Impact and Outcome,Rajpura,Punjab,India,-140417
BookMark eNo1j8FqwzAQRFVoD22aPyhUP-BUK1m2dAwmaQ2GHNKew1peuQJbDrIv_fsa0p6GmQfDzBO7j1Mkxl5B7ACEfTt8VlWhTV7upJB6zUAYZfUd29rSGqVAy7wsxCNrvmLwweESpsj3Qz-lsHyPvB6vA40UlxvwU-LHkOYlO6WOEm-mPjheR0-JoiN-iH2IND-zB4_DTNs_3bDzcV3ykTWn97raN1mwaslK47RoDRojAL2EjkoL4KBozerQYCdd7gglWiypBU9KQ462Bec7BLVhL7fWQESXawojpp_L_0X1C0DaTPc
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ETCC65847.2025.11108395
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9798331524760
EndPage 6
ExternalDocumentID 11108395
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i93t-78c50b8a8801af21de7911c16b8f21a8ad2c4cea2a9a7eb1fe3514a9b1cfda13
IEDL.DBID RIE
IngestDate Wed Aug 20 06:20:55 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i93t-78c50b8a8801af21de7911c16b8f21a8ad2c4cea2a9a7eb1fe3514a9b1cfda13
PageCount 6
ParticipantIDs ieee_primary_11108395
PublicationCentury 2000
PublicationDate 2025-June-26
PublicationDateYYYYMMDD 2025-06-26
PublicationDate_xml – month: 06
  year: 2025
  text: 2025-June-26
  day: 26
PublicationDecade 2020
PublicationTitle 2025 International Conference on Emerging Technologies in Computing and Communication (ETCC)
PublicationTitleAbbrev ETCC
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.9129058
Snippet A unification algorithm is one of the most important parts of a First-Order Logic (FOL) inference engine because it allows for the discovery of substitutions...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Automated Reasoning
Cognition
Computer science
Engines
Inference algorithms
Inference Engine
Knowledge representation
Logic
Logic programming
Logical deduction
Optimization
Recursive Unification
Reliability
Scalability
Symbolic Logic
Theorem proving
Title Unification Algorithm Implementation for First-Order Logic Inference Engines
URI https://ieeexplore.ieee.org/document/11108395
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4I8eAJHxjFR3rwWti2LG2Phkg0IUiiB26kr1USWQwPf7_TsmA8ePC2u9mkaSftNzP9vhmAO9V1COzCUSuDol2RBWqyglPhMRiz1qPRk6WHcjRSk4keV2L1pIUJISTyWWjHx3SX7xduE1NlHRY560LnNahJ2duKtSrOFst05-G134-AKjHs43l79_evvikJNgaNfw54DM0fAR4Z76HlBA5CeQqNXQcGUm3IMxiiy1hUWTdy__G2wFD_fU5Syd95pSoqCfqlZDBDN48-x0KbJPZXduRpP9K2JuGqCS8DnNwjrfoj0JkWayqVyzOrDO5AZgrOfJB4cjnWswrfjDKeu64LhhttJB7JRYisfaMtc4U3TJxDvVyU4QKIz3zIdSZUzCxajMAQ4zFyUVYKbbhil9CMazP93BbAmO6WpfXH9ys4ihaIjCreu4b6erkJN3Dovtaz1fI2me0b_IaaiQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JTwIxFH5RNNETLhh3e_BamLYM0x4NkUAckUQO3Ei3URIZDIu_39dhwHjw4G1mMknTvrRv6fe9D-BeNi06dmGpSbykTRF5qqOMU-EwGTPGodELS6dJvy9HIzUoyeoFF8Z7X4DPfD08Fnf5bmZXoVTWYAGzLlS8C3tBOquka5WoLRapxuOw3Q4uNcHEj8f1zf-_lFMKx9Gp_nPII6j9UPDIYOtcjmHH5ydQ3WgwkHJLnkKKQWNW1t3Iw8fbDJP99ykpmv5OS15RTjAyJZ0JBnr0JbTaJEFh2ZLedqR1V8JFDV47OLkuLRUS6ESJJU2kjSMjNe5BpjPOnE_w7LKsZSS-aakdt03rNddKJ3goZz7g9rUyzGZOM3EGlXyW-3MgLnI-VpGQobZoMAdDL4-5izSJUJpLdgG1sDbjz3ULjPFmWS7_-H4HB93hczpOe_2nKzgM1gj4Kt66hspyvvI3sG-_lpPF_LYw4Tc4O53S
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2025+International+Conference+on+Emerging+Technologies+in+Computing+and+Communication+%28ETCC%29&rft.atitle=Unification+Algorithm+Implementation+for+First-Order+Logic+Inference+Engines&rft.au=Babu%2C+Tina&rft.au=S%2C+Tejaswi&rft.au=K%2C+Darshan+S&rft.au=M%2C+Pavan+kumar&rft.date=2025-06-26&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FETCC65847.2025.11108395&rft.externalDocID=11108395