382 search results - page 11 / 77 » Complexity and Expressive Power of Logic Programming |
ICLP
2003
Springer
14 years 26 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...
LOPSTR
1997
Springer
13 years 11 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
SP
1997
IEEE
13 years 12 months ago
1997
IEEE
A major drawback of existing access control systems is that they have all been developed with a specific access control policy in mind. This means that all protection requirement...
KR
2004
Springer
14 years 1 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...