---
title: "Composition of ConGolog Programs"
authors:
  - "Sebastian Sardiña"
  - "Giuseppe De Giacomo"
doi: ""
url: "https://ijcai.org/proceedings/2009/154"
pdf: "https://ijcai.org/proceedings/2009/0154.pdf"
venue: "Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence"
year: 2009
pages: "904-909"
track: ""
keywords:
---

# Composition of ConGolog Programs

Sebastian Sardiña, Giuseppe De Giacomo

*Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence*, pages 904-909.

## Abstract

This article falls within the field of abstract argumentation frameworks. In particular, we focus on the study of frameworks using a proof procedure based on dialectical trees. These trees rely on a marking procedure to determine the warrant status of their root argument. Thus, our objective is to formulate rationality postulates to characterize the marking criterion over dialectical trees. The behavior of the marking procedure is closely tied to the alteration of trees, which is the keystone of any model of change based on dialectical argumentation. Hence, the results achieved in this work will benefit research on dynamics in argumentation.Nicolas Rotstein, Martin Moguillansky, Guillermo SimariWe look at composition of (possibly nonterminating) high-level programs over situation calculus action theories. Specifically the problem we look at is as follows: given a library of available ConGolog programs and a target program not in the library, verify whether the target program executions be realized by composing fragments of the executions of the available programs; and, if so, synthesize a controller that does the composition automatically. This kind of composition problems have been investigated in the CS and AI literature, but always assuming finite states settings. Here, instead, we investigate the issue in the context of infinite domains that may go through an infinite number of states as a result of actions. Obviously in this context the problem is undecidable. Nonetheless, by exploiting recent results in the AI literature, we devise a sound and well characterized technique to actually solve the problem.Sebastian Sardina, Giuseppe De Giacomo