LEG networks for ranking functions

被引：5

作者：

Eichhorn, Christian ^{[1
]}

Kern-Isberner, Gabriele ^{[1
]}

机构：

[1] Lehrstuhl Informatik 1, Technische Universit¨at Dortmund, Dortmund

来源：

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8761卷

关键词：

Information retrieval - Knowledge based systems;

D O I：

10.1007/978-3-319-11558-0_15

中图分类号：

学科分类号：

摘要：

When using representations of plausibility for semantical frameworks, the storing capacity needed is usually exponentially in the number of variables. Therefore, network-based approaches that decompose the semantical space have proven to be fruitful in environments with probabilistic information. For applications where a more qualitative information is preferable to quantitative information, ordinal conditional functions (OCF) offer a convenient methodology. Here, Bayesian-like networks have been proposed for ranking functions, so called OCF-networks. These networks not only suffer from similar problems as Bayesian networks, in particular, allowing only restricted classes of conditional relationships, it also has been found recently that problems with admissibility may arise. In this paper we propose LEG networks for ranking functions, also carrying over an idea from probabilistics. OCF-LEG networks can be built for any conditional knowledge base and filled by local OCF that can be found by inductive reasoning. A global OCF is set up from the local ones, and it is shown that the global OCF is admissible with respect to the underlying knowledge base. © Springer International Publishing Switzerland 2014.

引用

页码：210 / 223

页数：13

共 15 条

[1]

Beierle C., Hermsen R., Kern-Isberner G., Observations on the Minimality of Ranking Functions for Qualitative Conditional Knowledge Bases and their Computation, Proceedings of the 27th International FLAIRS Conference, (2014)

[2]

Benferhat S., Dubois D., Garcia L., Prade H., On the transformation between possibilistic logic bases and possibilistic causal networks, International Journal of Approximate Reasoning, 9, 2, pp. 135-173, (2002)

[3]

Benferhat S., Tabia K., Belief Change in OCF-Based Networks in Presence of Sequences of Observations and Interventions: Application to Alert Correlation, PRICAI 2010. LNCS, 6230, pp. 14-26, (2010)

[4]

de Finetti B., Theory of Probability, 1-2, (1974)

[5]

Eichhorn C., Kern-Isberner G., Using inductive reasoning for completing OCF-networks, (2013)

[6]

Goldszmidt M., Pearl J., Qualitative probabilities for default reasoning, belief revision, and causal modeling, Artificial Intelligence, 84, 1-2, pp. 57-112, (1996)

[7]

Kern-Isberner G., Conditionals in Nonmonotonic Reasoning and Belief Revision, 2087, (2001)

[8]

Kern-Isberner G., Eichhorn C., Intensional combination of rankings for OCF-networks, Proceedings of the 26th International FLAIRS Conference FLAIRS-2013, pp. 615-620, (2013)

[9]

Kern-Isberner G., Eichhorn C., Structural inference from conditional knowledge bases, Studia Logica Special Issue Logic and Probability: Reasoning in Uncertain Environments, 102, 4, (2014)

[10]

Lemmer J.F., Efficient minimum information updating for bayesian inferencing in expert systems, Proc. of the National Conference on Artificial Intelligence, (1982)

← 1 2 →