The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...