Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
We describe the design and the present state of the verification tool Augur 2 which is currently being developed. It is based on Augur 1, a tool which can analyze graph transforma...
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...