Implementing Prioritized Merging with ASP

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper addresses the extension of the removed sets framework to prioritized removed sets fusion (PRSF). It discusses the links between PRSF and iterated removed sets revision and shows that PRSF satisfy most of the postulates proposed for prioritized merging. An implementation of this new syntactic prioritized fusion operator is proposed thanks to answer sets programming. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Hue, J., Papini, O., & Würbel, E. (2010). Implementing Prioritized Merging with ASP. In Communications in Computer and Information Science (Vol. 80 PART 1, pp. 138–147). https://doi.org/10.1007/978-3-642-14055-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free