Abstract
We consider logic programminglike systems which are based on solving equations in a given structure as opposed to obtaining unifiers. While such systems are elegant from an operational point of view, a logical interpretation of the programs is not always apparent. In this paper, we restrict ourselves to the class of structures ℜ satisfying the eliminable variable property: we can construct an explicit definition, in the form of one system of equations, of the set of solutions to any ℜsolvable system of equations. Correspondingly, we consider only the class of equality theories E such that every Eunifiable system of equations has an Emgu. We then state three properties which provide basic relationships between E and ℜ. We prove that their satisfaction establishes an equivalence between a program considered as an equation solving engine (with respect to a structure) and the program considered as a logic program (with respect to a corresponding equality theory). A logical basis for these programs is thus given.
Original language  English 

Title of host publication  3rd International Conference on Logic Programming  Imperial College of Science and Technology, Proceedings 
Editors  Ehud Shapiro 
Publisher  Springer 
Pages  313326 
Number of pages  14 
ISBN (Print)  9783540164920 
DOIs  
Publication status  Published  1 Jan 1986 
Event  International Conference on Logic Programming 1986  London, United Kingdom Duration: 14 Jul 1986 → 18 Jul 1986 Conference number: 3rd https://link.springer.com/book/10.1007/3540164928 (Proceedings) 
Publication series
Name  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 

Volume  225 LNCS 
ISSN (Print)  03029743 
ISSN (Electronic)  16113349 
Conference
Conference  International Conference on Logic Programming 1986 

Abbreviated title  ICLP 1986 
Country  United Kingdom 
City  London 
Period  14/07/86 → 18/07/86 
Internet address 
