ICLP
2003
Springer
14 years 28 days ago
2003
Springer
ICLP
2003
Springer
14 years 28 days ago
2003
Springer
ICLP
2003
Springer
14 years 28 days ago
2003
Springer
We introduce a proposal to give argumentation capacity to databases. A database is said to have argumentation capacity if it can extract from the information available to it a set ...
ICLP
2003
Springer
14 years 28 days ago
2003
Springer
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...
ICLP
2003
Springer
14 years 28 days ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
ICLP
2003
Springer
14 years 28 days 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
14 years 28 days 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
14 years 28 days 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
14 years 28 days 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
14 years 28 days ago
2003
Springer
Abstract. Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. The...