Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Abstract. Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and servi...
Michael C. Jaeger, Gregor Rojec-Goldmann, Christop...
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Ontologies are today a key part of every knowledge based system. They provide a source of shared and precisely defined terms, resulting in system interoperability by knowledge sha...
Giorgos Stoilos, Giorgos B. Stamou, Stefanos D. Ko...