42 search results - page 5 / 9 » Algorithms for computing backbones of propositional formulae |
157
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
117
Voted
AAAI
2006
15 years 5 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
152
Voted
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
119
Voted
DAC
2005
ACM
15 years 5 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
145
Voted
FOCI
2007
IEEE
15 years 10 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...