1144 search results - page 51 / 229 » Logic programming for combinatorial problems |
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
ATAL
1995
Springer
13 years 11 months ago
1995
Springer
This paper describes a novel approach to high-level agent programming based on a highly developed logical theory of action. The user provides a specification of the agents’ bas...
COR
2010
13 years 7 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...