Sciweavers

831 search results - page 103 / 167
» Coalgebraic Correspondence Theory
Sort
View
LICS
2009
IEEE
15 years 6 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
ECSQARU
2009
Springer
15 years 6 months ago
Extracting the Core of a Persuasion Dialog to Evaluate Its Quality
: A persuasion dialog is a dialog in which agents exchange arguments on a subject. In this kind of dialog, the agents disagree about the status of the subject and each one tries to...
Leila Amgoud, Florence Dupin de Saint-Cyr
ISSAC
2009
Springer
139views Mathematics» more  ISSAC 2009»
15 years 6 months ago
Multihomogeneous resultant formulae for systems with scaled support
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
Ioannis Z. Emiris, Angelos Mantzaflaris
LPNMR
2009
Springer
15 years 6 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
TAMC
2009
Springer
15 years 6 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens