ICLP
1999
Springer
13 years 8 months ago
1999
Springer
Delaying-based tabling mechanisms, such as the one adopted in XSB, are nonlinear in the sense that the computation state of delayed calls has to be preserved. In this paper, we pr...
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
ICLP
1999
Springer
13 years 8 months ago
1999
Springer
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could c...