3044 search results - page 261 / 609 » Linear logical approximations |
187
click to vote
LPNMR
2001
Springer
15 years 11 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
189
click to vote
BIS
2010
15 years 1 months ago
2010
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only par...
161
click to vote
CAV
2009
Springer
16 years 1 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
152
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
182
click to vote
ICLP
2005
Springer
16 years 5 days ago
2005
Springer
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integri...