21 search results - page 2 / 5 » Propositional merging operators based on set-theoretic close... |
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
ECSQARU
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
ECML
2003
Springer
14 years 19 days ago
2003
Springer
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...