Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1107.0040
Cited By
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
Journal of Artificial Intelligence Research (JAIR), 2011
30 June 2011
Heidi E. Dixon
M. Ginsberg
Andrew J. Parkes
AI4CE
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Generalizing Boolean Satisfiability I: Background and Survey of Existing Work"
5 / 5 papers shown
A First Polynomial Non-Clausal Class in Many-Valued Logic
Antoine Marot
AI4CE
172
3
0
21 Oct 2021
The Horn Non-Clausal Class and its Polynomiality
G. E. Imaz
340
3
0
31 Aug 2021
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints
Daniel Karapetyan
Andrew J. Parkes
G. Gutin
A. Gagarin
285
17
0
19 Apr 2016
Generalizing Boolean Satisfiability III: Implementation
Heidi E. Dixon
M. Ginsberg
David K. Hofer
E. Luks
Andrew J. Parkes
231
14
0
09 Sep 2011
Generalizing Boolean Satisfiability II: Theory
Heidi E. Dixon
M. Ginsberg
E. Luks
Andrew J. Parkes
177
27
0
09 Sep 2011
1
Page 1 of 1
