Confluent Term Rewriting for Only-knowing Logics

STAIRS, pp. 162-174, 2010.

Cited by: 1|Views3
EI

Abstract:

Combining term rewriting and modal logics, this paper addresses confluence and termination of rewrite systems introduced for only-knowing logics. The rewrite systems contain a rule scheme that gives rise to an infinite number of critical pairs, hence we cannot check the joinability of every critical pair directly, in order to establish lo...More

Code:

Data:

Get fulltext within 24h
Bibtex
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

Upload a single paper

for 5 coins

Wechat's Red Packet
?

Upload 50 articles

for 280 coins

Wechat's Red Packet
?

Upload 200 articles

for 1200 coins

Wechat's Red Packet
?

Upload 500 articles

for 3000 coins

Wechat's Red Packet
?

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :
0

 

Tags
Comments