308 search results - page 26 / 62 » Answer Set Programming Based on Propositional Satisfiability |
KIVS
2005
Springer
14 years 1 months ago
2005
Springer
: In modern information systems the dominant retrieval paradigms have shifted from exact matching towards retrieving a list of the most relevant objects. This is because users usua...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
ESWS
2005
Springer
14 years 1 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
EOR
2006
13 years 7 months ago
2006
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...