This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...