Defining Standard Prolog in Rewriting Logic
✍ Scribed by M. Kulaš; C. Beierle
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 170 KB
- Volume
- 36
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this note, we report on some work in progress on using rewriting logics for discrete event simulation. The idea is to combine the proofs in the logic with the observations in the simulations to gain a better understanding of the interaction intricacies that seem to occur in complex simulations. I
We show that the generalized variant of rewriting logic where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational log
UPiIVERSAL FIRST-ORDER DEFINABILITY I N MODAL LOGIC by R. E. JENNIXGS and D. K. JOHNSTON in Burnaby, British Columbia (Canada) and P. K. SCHOTCH in Halifax, Nova Scotia (Canada)l) In [ l ] R. I. GOLDBLATT presents a model theoretic characterization of the class of modal sentences determined by firs
In fuzzy logic, every word or phrase describing uncertainty is represented by a real number from the interval [0, 1]. There are only denumerable many words and phrases and continuum many real numbers; thus, not every real number corresponds to some common sense degree of uncertainty. In this article