M. Ayala. Embedding Built-in Predicates as Premises of Rules of Conditional Rewriting Systems. In Second Workshop on Logic, Language, Information and Computation, Recife, Brasil, July 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Deductive Calculus for Conditional Equational Systems with.. - Rincon (Correct)
....for evaluating many sorted first order logic predicates and rewriting techniques for manipulating the whole specification. This treatment can be conceived as a theoretical framework for reasoning about the combination of the logical and functional programming paradigms as it is mentioned in [Aya95b]. With more detail than Padawitz (at least from the operational point of view) Kaplan [Kap83] Kap84] has initially developed a calculus for equational universal Horn clauses but without the special kind of built in predicates incorporated here. The importance of Kaplan s work is principally ....
....guaranteeing the basic algebraic properties needed in order to obtain a complete deductive calculus for this class of combined specifications. In order to make operational the deduction, standard conditional rewriting techniques and built in decision algorithms should appropriately be combined. In [Aya95b] it was reported on a complete algorithm based on conditional rewriting and built in decision algorithms for deduction of formulae of the form P = s = t, where P is a purely built in premise. This combination will be reported in detail elsewhere. Acknowledgements The author would like to thank ....
M. Ayala. Embedding Built-in Predicates as Premises of Rules of Conditional Rewriting Systems. In Second Workshop on Logic, Language, Information and Computation, Recife, Brasil, July 1995.
Embedding Built-in Predicates as Premises of Rules of Conditional .. - Rincón (1995) (1 citation) Self-citation (Ayala) (Correct)
....conditional equations admitting predefined algebras. The clauses are treated by rewriting. His approach can be considered as an attempt to provide a general framework to handle specifications with predefined algebras in a semantically clean way. An abstract of this work appears in [Aya95b]. The paper is organized as follows. In the second and third sections an appropriate combination of standard conditional rewriting systems with built in predicates in a basic theory and its corresponding notion of reduction are introduced. In the third and fourth sections a decision procedure for ....
M. Ayala. Embedding Built-in Predicates as Premises of Rules of Conditional Rewriting Systems --- Abstract. In Second Workshop on Logic, Language, Information and Computation, Recife, Brasil, July 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC