Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...