The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase pure-literal (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1984-2005 (17) 2008-2022 (5)
Publication types (Num. hits)
article(11) inproceedings(11)
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
70Jan Johannsen The Complexity of Pure Literal Elimination. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF pure literal, computational complexity, completeness
47Michael Molloy 0001 The pure literal rule threshold and cores in random hypergraphs. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
47Marco Benedetti Conditional Pure Literal Graphs. Search on Bibsonomy IJCAR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Stefan Szeider Backdoor Sets for DLL Subsolvers. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF unit propagation, pure literal elimination, backdoor sets, W[P]-completeness, satisfiability, parameterized complexity
39Chuang Lin 0002, Abhijit Chaudhury, Andrew B. Whinston, Dan C. Marinescu Logical Inference of Horn Clauses in Petri Net Models. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 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
32Michael Alekhnovich, Eli Ben-Sasson Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Guoqiang Pan, Moshe Y. Vardi Optimizing a BDD-Based Modal Solver. Search on Bibsonomy CADE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
31Oleksii 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 AAAI The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
31Benjamin Böhm 0001, Tomás Peitl, Olaf Beyersdorff QCDCL with Cube Learning or Pure Literal Elimination - What is Best? Search on Bibsonomy IJCAI The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
31Olaf Beyersdorff, Benjamin Böhm 0001 QCDCL with Cube Learning or Pure Literal Elimination - What is best? Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2021 DBLP  BibTeX  RDF
31Alexander D. Scott, Gregory B. Sorkin Structure of random r-SAT below the pure literal threshold Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
31Richard J. Wallace Enhancing Maximum Satisfiablility Algorithms with Pure Literal Strategies. Search on Bibsonomy AI The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
31Paul Walton Purdom Jr. Average Time for the Full Pure Literal Rule. Search on Bibsonomy Inf. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Khaled M. Bugrara, Youfang Pan, Paul Walton Purdom Jr. Exponential Average Time for the Pure Literal Rule. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
31Khaled M. Bugrara, Paul Walton Purdom Jr. An Exponential Lower Bound for the Pure Literal Rule. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
31Paul Walton Purdom Jr., Cynthia A. Brown The Pure Literal Rule and Polynomial Average Time. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
31John Franco Probabilistic analysis of the pure literal heuristic for the satisfiability problem. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
16Pablo San Segundo, Cristóbal Tapia, Julio Puente, Diego Rodríguez-Losada A New Exact Bit-Parallel Algorithm for SAT. Search on Bibsonomy ICTAI (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Chu Min Li, Felip Manyà, Jordi Planes Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
16Jeong Han Kim The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
16Gabriel Aguilera 0001, Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde Reducing signed propositional formulas. Search on Bibsonomy Soft Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
16Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde Implicates and Reduction Techniques for Temporal Logics. Search on Bibsonomy JELIA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #22 of 22 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license