Negation with logical variables in conditional rewriting

Chilukuri K. Mohan, Mandayam K. Srivas

Research output: Chapter in Book/Entry/PoemConference contribution

1 Scopus citations

Abstract

We give a general formalism for conditional rewriting, with systems containing conditional rules whose antecedents contain literals to be shown satisfiable and/or unsatisfiable. We explore semantic issues, addressing when the associated operational rewriting mechanism is sound and complete. We then give restrictions on the formalism which enable us to construct useful and meaningful specifications using the proposed operational mechanism.

Original languageEnglish (US)
Title of host publicationRewriting Techniques and Applications - 3rd International Conference, RTA 1989
EditorsNachum Dershowitz
PublisherSpringer Verlag
Pages292-310
Number of pages19
ISBN (Print)9783540510819
DOIs
StatePublished - 1989
Event3rd International Conference on Rewriting Techniques and Applications, RTA 1989 - Chapel Hill, United States
Duration: Apr 3 1989Apr 5 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume355 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Rewriting Techniques and Applications, RTA 1989
Country/TerritoryUnited States
CityChapel Hill
Period4/3/894/5/89

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Negation with logical variables in conditional rewriting'. Together they form a unique fingerprint.

Cite this