351 search results - page 3 / 71 » Logic Programs with Compiled Preferences |
IPPS
1999
IEEE
14 years 26 days ago
1999
IEEE
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
JAIR
2007
13 years 8 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
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...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...