ICLP
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes the development of the PALS system, an implementation of Prolog that efficiently exploits or-parallelism on share-nothing platforms. PALS makes use of a novel ...
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the ru...
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
13
Voted
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...