We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
Pedro Cabalar, David Pearce, Panos Rondogiannis, W...
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...