977 search results - page 64 / 196 » Logic programming with infinite sets |
89
Voted
SAS
2005
Springer
15 years 6 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
124
click to vote
EPIA
1997
Springer
15 years 4 months ago
1997
Springer
Argumentation semantics in extended logic programming has been defined in [5,12] for a single agent which determines its believes by an internal argumentation process. In this pap...
105
Voted
AAAI
2008
15 years 2 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
143
click to vote
ILP
2004
Springer
15 years 5 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
86
Voted
PODS
1989
ACM
15 years 4 months ago
1989
ACM
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...