A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
We show how quantified constraints expressed in a sub-language of first-order logic, againstashareddatamodelthatisfreetoevolve, provideanexcellentwayof transporting domain-specific...
Kit-ying Hui, Peter M. D. Gray, Graham J. L. Kemp,...
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
Abstract. This paper is centered on the problem of merging (possibly conflicting) information coming from different sources. Though this problem has attracted much attention in pro...