Reaching agreement over ontology alignmentsReaching Agreement • September 9th, 2020
Loredana Laera, Valentina Tamma, Jérôme Euzenat, Trevor Bench-Capon, Terry Payne. Reaching agreement over ontology alignments. Proc. 5th International semantic web conference (ISWC), Nov 2006, Athens, United States. pp.371-384, 10.1007/11926078_27 . hal-00825946
Reaching agreement over ontology alignmentsReaching Agreement • October 16th, 2006
We propose an approach for supporting the creation and exchange of different ar- guments, that support or reject possible correspondences. Each agent can decide, according to its preferences, whether to accept or refuse a candidate correspon- dence. The proposed framework considers arguments and propositions that are specific to the matching task and are based on the ontology semantics. This ar- gumentation framework relies on a formal argument manipulation schema and on an encoding of the agents’ preferences between particular kinds of arguments. Whilst the former does not vary between agents, the latter depends on the inter- ests of each agent. Thus, this approach distinguishes clearly between alignment rationales which are valid for all agents and those specific to a particular agent.
Reaching Agreement on Processor Group Membership in Synchronous Distributed SystemsReaching Agreement • January 28th, 2009
Reaching agreement on the identity of correctly functioning processors of a dis- tributed system in the presence of random communication delays, failures and proces- sor joins is a fundamental problem in fault-tolerant distributed systems. Assuming a synchronous communication network that is not subject to partition occurrences, we specify the processor-group membership problem and we propose three simple proto- cols for solving it. The protocols provide all correct processors with consistent views of the processor-group membership and guarantee bounded processor failure detection and join delays.
REACHING AGREEMENT ON REGIONAL GROWTH STRATEGIESReaching Agreement • August 24th, 2006
Reaching Agreement in Multiagent System: Optimization in Allocation ResourcesReaching Agreement • April 10th, 2013
Abstract— One aspect of Multiagent systems (MAS) that has been only partially studied is their role in software engineering and in particular their merit as a software architecture style.We studies a particular multiagent resource allocation problem with indivisible and sharable resources. The utility of an agent for using a bundle of resources is the difference between the valuations of that bundle of resources. The valuation and the delay can be agent-dependent. Currently, the great majority of agent-based systems consist of a single agent. However, as the technology matures and addresses increasingly complex applications, the need for systems that consist of multiple agents that communicate in a peer-to-peer fashion is becoming apparent. Central to the design and effective operation of such multiagent systems (MAS) are a core set of issues and research questions that have been studied over the years by the distributed AI community.
Reaching Agreement With Your Ex-Reaching Agreement • October 22nd, 2015
property of married or de facto couples can be entered into at any time during the time that couples live together or following separation but Court proceedings must be commenced within one year of a divorce order being granted.
Reaching Agreement in Quantum Hybrid NetworksReaching Agreement • October 21st, 2018
Any positive and Hermitian operator with trace one defines a proper density operator describing certain quantum state, and vice versa.
