ICLP
2003
Springer
13 years 10 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. The...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expres...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
