We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Webbases are database systems that enable creation of Web applications that allow end users to shop around for products and services at various Web sites without having to manually...
Hasan Davulcu, Guizhen Yang, Michael Kifer, I. V. ...
Abstract. The development of successful case-based design aids depends both on the CBR processes themselves and on crucial questions of integrating the CBR system into the larger t...
David B. Leake, Lawrence Birnbaum, Kristian J. Ham...