DeepAI AI Chat
Log In Sign Up

Finding Common Ground for Incoherent Horn Expressions

by   Ana Ozaki, et al.
University of Bergen

Autonomous systems that operate in a shared environment with people need to be able to follow the rules of the society they occupy. While laws are unique for one society, different people and institutions may use different rules to guide their conduct. We study the problem of reaching a common ground among possibly incoherent rules of conduct. We formally define a notion of common ground and discuss the main properties of this notion. Then, we identify three sufficient conditions on the class of Horn expressions for which common grounds are guaranteed to exist. We provide a polynomial time algorithm that computes common grounds, under these conditions. We also show that if any of the three conditions is removed then common grounds for the resulting (larger) class may not exist.


page 1

page 2

page 3

page 4


Automated Termination Analysis of Polynomial Probabilistic Programs

The termination behavior of probabilistic programs depends on the outcom...

Explanatory Publics: Explainability and Democratic Thought

In order to legitimate and defend democratic politics under conditions o...

From n-grams to trees in Lindenmayer systems

In this paper we present two approaches to Lindenmayer systems: the rule...

Determining the Hausdorff Distance Between Trees in Polynomial Time

The Hausdorff distance is a relatively new measure of similarity of grap...

How to Amend a Constitution? Model, Axioms, and Supermajority Rules

A self-governed community or society must have rules by which group deci...

A Formal Analysis of Multimodal Referring Strategies Under Common Ground

In this paper, we present an analysis of computationally generated mixed...

Mitigating Overexposure in Viral Marketing

In traditional models for word-of-mouth recommendations and viral market...