131 search results - page 13 / 27 » Complexity of the Satisfiability Problem for a Class of Prop... |
IJSI
2010
13 years 6 months ago
2010
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
SAT
2004
Springer
14 years 26 days ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
DAM
2006
13 years 7 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
AAAI
2008
13 years 9 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
COCO
1998
Springer
13 years 11 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...