192 search results - page 7 / 39 » Logic Programs with Abstract Constraint Atoms |
ECAI
2000
Springer
14 years 23 days ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
ICLP
1995
Springer
13 years 12 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
ESOP
2001
Springer
14 years 28 days ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s pre...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...