|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 12 keywords
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
70 | Jan Johannsen |
The Complexity of Pure Literal Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 35(1-3), pp. 89-95, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pure literal, computational complexity, completeness |
47 | Michael Molloy 0001 |
The pure literal rule threshold and cores in random hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 672-681, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
47 | Marco Benedetti |
Conditional Pure Literal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings, pp. 331-346, 2001, Springer, 3-540-42254-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Stefan Szeider |
Backdoor Sets for DLL Subsolvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 35(1-3), pp. 73-88, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
unit propagation, pure literal elimination, backdoor sets, W[P]-completeness, satisfiability, parameterized complexity |
39 | Chuang Lin 0002, Abhijit Chaudhury, Andrew B. Whinston, Dan C. Marinescu |
Logical Inference of Horn Clauses in Petri Net Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 5(3), pp. 416-425, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
net model, logical inconsistency check, T-invariants, one-literal, pure-literal, splitting clauses, Petri nets, inference mechanisms, resolution, propositional logic, Horn clauses, Horn clauses, Petri net models, first-order predicate logic, logical inference |
32 | Michael Alekhnovich, Eli Ben-Sasson |
Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 352-361, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Guoqiang Pan, Moshe Y. Vardi |
Optimizing a BDD-Based Modal Solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, pp. 75-89, 2003, Springer, 3-540-40559-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Oleksii Omelchenko, Andrei A. Bulatov |
Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pp. 3804-3812, 2022, AAAI Press, 978-1-57735-876-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Benjamin Böhm 0001, Tomás Peitl, Olaf Beyersdorff |
QCDCL with Cube Learning or Pure Literal Elimination - What is Best? ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022., pp. 1781-1787, 2022, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Olaf Beyersdorff, Benjamin Böhm 0001 |
QCDCL with Cube Learning or Pure Literal Elimination - What is best? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
31 | Alexander D. Scott, Gregory B. Sorkin |
Structure of random r-SAT below the pure literal threshold ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1008.1260, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
31 | Richard J. Wallace |
Enhancing Maximum Satisfiablility Algorithms with Pure Literal Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI '96, Toronto, Ontario, Canada, May 21-24, 1996, Proceedings, pp. 388-401, 1996, Springer, 3-540-61291-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Paul Walton Purdom Jr. |
Average Time for the Full Pure Literal Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 78(3-4), pp. 269-291, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Khaled M. Bugrara, Youfang Pan, Paul Walton Purdom Jr. |
Exponential Average Time for the Pure Literal Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 18(2), pp. 409-418, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
31 | Khaled M. Bugrara, Paul Walton Purdom Jr. |
An Exponential Lower Bound for the Pure Literal Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 27(4), pp. 215-219, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
31 | Paul Walton Purdom Jr., Cynthia A. Brown |
The Pure Literal Rule and Polynomial Average Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 14(4), pp. 943-953, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
31 | John Franco |
Probabilistic analysis of the pure literal heuristic for the satisfiability problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 1(3), pp. 273-289, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
16 | Pablo San Segundo, Cristóbal Tapia, Julio Puente, Diego Rodríguez-Losada |
A New Exact Bit-Parallel Algorithm for SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI (2) ![In: 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), November 3-5, 2008, Dayton, Ohio, USA, Volume 2, pp. 59-65, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Chu Min Li, Felip Manyà, Jordi Planes |
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 403-414, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Jeong Han Kim |
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 2, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Gabriel Aguilera 0001, Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde |
Reducing signed propositional formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 2(4), pp. 157-166, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde |
Implicates and Reduction Techniques for Temporal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, European Workshop, JELIA '98, Dagstuhl, Germany, October 12-15, 1998, Proceedings, pp. 309-323, 1998, Springer, 3-540-65141-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|