Rewriting Logic from a ρLog Point of View

نویسندگان

  • Mauricio Ayala-Rincón
  • Besik Dundua
  • Temur Kutsia
  • Mircea Marin
  • M. Ayala-Rincón
  • B. Dundua
  • T. Kutsia
  • M. Marin
چکیده

Rewriting logic is a well-known logic that emerged as an adequate logical and semantic framework for the specification of languages and systems. ρLog is a calculus for rule-based programming with labeled rules. Its expressive power stems from the usage of a fragment of higher-order logic (e.g., sequence variables, and function variables) to express atomic formulas. Its adequacy as a computational model for rule-based programming is derived from theoretical results concerning E-unification and E-matching in the fragment of logic adopted by ρLog. In this paper we choose a fragment of the ρLog calculus and argue that it can be used to perform deduction in rewriting logic. More precisely, we define a mapping between the entailment systems of rewriting logic and ρLog for which the conservativity theorem holds. It implies that, like rewriting logic, ρLog also can be used as a logical and semantic framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategies in P ρ Log

PρLog is an experimental extension of logic programming with strategic conditional transformation rules, combining Prolog with ρLog calculus. The rules perform nondeterministic transformations on hedges. Strategies provide a control on rule applications in a declarative way. In this short paper we give an overview on programming with strategies in PρLog and demonstrate how rewriting strategies ...

متن کامل

Strategies in PRholog

PρLog is an experimental extension of logic programming with strategic conditional transformation rules, combining Prolog with ρLog calculus. The rules perform nondeterministic transformations on hedges. Queries may have several results that can be explored on backtracking. Strategies provide a control on rule applications in a declarative way. With strategy combinators, the user can construct ...

متن کامل

ELAN from a rewriting logic point of view

ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule based processes. With the general goal to make precise a rewriting logic based semantics of ELAN, this paper has three contributions: a presentati...

متن کامل

Rewriting and call-time choice

Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is not a trivial issue that has been addressed f...

متن کامل

Confluence and termination of fuzzy relations

Confluence and termination are essential properties connected to the idea of rewriting and substituting which appear in abstract rewriting systems. The aim of the present paper is to investigate confluence, termination, and related properties from the point of view of fuzzy logic leaving the ordinary notions a particular case when the underlying structure of truth degrees is two-valued Boolean ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017