A categorical unification algorithm
Proceedings of a tutorial and workshop on Category theory and computer programming
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ISMVL '07 Proceedings of the 37th International Symposium on Multiple-Valued Logic
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
| Hi-index | 0.00 |
Non-standard logics departs from traditional logic mostly in extended views, on one hand syntactically related to logical operators, and on the other hand semantically related to truth values. Typical for these approaches is the remaining traditional view on 'sets and relations' and on terms based on signatures. Thus the cornerstones of the languages remain standard, and so does mostly the view on knowledge representation and reasoning using traditional substitution theories and unification styles. In previous papers we have dealt with particular problems such as generalizing terms and substitution, extending our views on sets and relations, and demonstrated the use of these non-standard language elements in various applications such as for fuzzy logic, generalized convergence spaces, rough sets and Kleene algebras. In this paper we provide an overview and summarized picture of what indeed happens when we drop the requirement for using traditional sets with relations and terms with equational settings.