#### Filter Results:

#### Publication Year

2005

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We propose an abstract approach to coalition formation that fo-cuses on simple merge and split rules transforming partitions of a group of players. We identify conditions under which every iteration of these rules yields a unique partition. The main conceptual tool is a specific notion of a stable partition. The results are parametrized by a preference… (More)

We describe the planning problem within the framework of dynamic epistemic logic (DEL), considering the tree of sequences of events as the underlying structure. In general, the DEL planning problem is computationally difficult to solve. On the other hand, a great deal of fruitful technical advances have led to deep insights into the way DEL works, and these… (More)

We consider two simple variants of a framework for reasoning about knowledge amongst communicating groups of players. Our goal is to clarify the resulting epistemic issues. In particular, we investigate what is the impact of common knowledge of the underlying hypergraph connecting the players, and under what conditions common knowledge distributes over… (More)

We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples, we embed the associated semantic operator into a feed-forward network and train the network using the examples. This results in the learning of first-order knowledge while damaged… (More)

Significant advances have recently been made concerning the integration of symbolic knowledge representation with artificial neural networks (also called connectionist systems). However, while the integration with propositional paradigms has resulted in applicable systems, the case of first-order knowledge representation has so far hardly proceeded beyond… (More)

In a recent paper, van Benthem, Gerbrandy, Hoshi and Pacuit gave a natural translation of dynamic epistemic logic (DEL) into epistemic temporal logic (ETL) and proved a representation theorem, characterizing those ETL models that are translations of some DEL protocol; among the characterizing properties we also find <i>synchronicity</i>. In this paper, we… (More)

Research into the processing of symbolic knowledge by means of con-nectionist networks aims at systems which combine the declarative nature of logic-based artificial intelligence with the robustness and trainability of artificial neu-ral networks. This endeavour has been addressed quite successfully in the past for propositional knowledge representation and… (More)

We propose a theory of the interaction between knowledge and games. Epistemic game theory is of course a well developed subject [4,5]. But there is also a need for a theory of how some agents can affect the outcome of a game by affecting the knowledge which other agents have and thereby affecting their actions. We concentrate on games of incomplete or… (More)

Logic-based preference representation languages are used to represent utility functions in combinatorial auctions, and can also be used for voting. A canonical problem in this context is, given a set of propositional formulas with associated weights, to find an assignment 1 that maximizes the sum of those weights which are associated to satisfied formulas.… (More)