Sciweavers

874 search results - page 36 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
13 years 10 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
ML
2006
ACM
131views Machine Learning» more  ML 2006»
13 years 10 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
EAAI
2008
101views more  EAAI 2008»
13 years 10 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
JAIR
2007
121views more  JAIR 2007»
13 years 10 months ago
On the Semantics of Logic Programs with Preferences
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...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
AGP
2003
IEEE
14 years 2 months ago
Advanced Backjumping Techniques for Rule Instantiations
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
Simona Perri, Francesco Scarcello