Information Flow under Budget Constraints

被引：1

作者：

Naumov, Pavel ^{[1
]}

Tao, Jia ^{[2
]}

机构：

[1] Vassar Coll, Comp Sci Dept, 124 Raymond Ave,Box 128, Poughkeepsie, NY 12604 USA

[2] Lafayette Coll, Comp Sci Dept, 740 High St, Easton, PA 18042 USA

来源：

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2017年 / 18卷 / 04期

关键词：

Armstrong's axioms; axiomatization; completeness; budget constraints;

D O I：

10.1145/3152768

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Although first proposed in the database theory as properties of functional dependencies between attributes, Armstrong's axioms capture general principles of information flow by describing properties of dependencies between sets of pieces of information. This article generalizes Armstrong's axioms to a setting in which there is a cost associated with information. The proposed logical system captures general principles of dependencies between pieces of information constrained by a given budget.

引用

页数：26

共 20 条

[1] Alechina N., 2002, Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems, P881
[2] ALECHINA N, 2004, P 3 INT JOINT C AUT, P606, DOI [10.1109/AAMAS.2004.10090, DOI 10.1109/AAMAS.2004.10090]
[3] Logic for coalitions with bounded resources1
Alechina, Natasha
Logan, Brian
Hoang Nga Nguyen
Rakib, Abdur
[J]. JOURNAL OF LOGIC AND COMPUTATION, 2011, 21 (06) : 907 - 937
[4] [Anonymous], 2009, Database Systems: The Complete Book
[5] Armstrong W.W., 1974, IFIP C
[6] Beeri C., 1977, P ACM SIGMOD INT C M, P47, DOI DOI 10.1145/509404.509414
[7] Belohlávek R, 2006, LECT NOTES COMPUT SC, V3882, P644
[8] Berge C., 1989, N HOLLAND MATH LIB, V45
[9] Bulling N, 2010, LECT NOTES ARTIF INT, V6214, P22
[10] LINEAR LOGIC
GIRARD, JY
[J]. THEORETICAL COMPUTER SCIENCE, 1987, 50 (01) : 1 - 102

← 1 2 →