intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Báo cáo khoa học: "ON THE DECIDABILITY OF FUNCTIONAL UNCERTAINTY*"

Chia sẻ: Nhung Nhung | Ngày: | Loại File: PDF | Số trang:8

55
lượt xem
2
download
 
  Download Vui lòng tải xuống để xem tài liệu đầy đủ

We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions containing functional uncertainty in two phases, both phases using a set of deterministic and non-deterministic rewrite rules. We then compare our algorithm with the one of Kaplan and Maxwell, that does not cover cyclic feature descriptions. 1 Introduction the form x L y , where L is a finite description of a regular language of feature paths. A constraint x L y holds if there is a path w E L such that z...

Chủ đề:
Lưu

Nội dung Text: Báo cáo khoa học: "ON THE DECIDABILITY OF FUNCTIONAL UNCERTAINTY*"

ADSENSE

CÓ THỂ BẠN MUỐN DOWNLOAD

 

Đồng bộ tài khoản
2=>2