Search results for "pure-literal"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
70	Jan Johannsen	The Complexity of Pure Literal Elimination.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	pure literal, computational complexity, completeness
47	Michael Molloy 0001	The pure literal rule threshold and cores in random hypergraphs.	SODA	2004	DBLP BibTeX RDF
47	Marco Benedetti	Conditional Pure Literal Graphs.	IJCAR	2001	DBLP DOI BibTeX RDF
39	Stefan Szeider	Backdoor Sets for DLL Subsolvers.	J. Autom. Reason.	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.	IEEE Trans. Knowl. Data Eng.	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.	FOCS	2003	DBLP DOI BibTeX RDF
32	Guoqiang Pan, Moshe Y. Vardi	Optimizing a BDD-Based Modal Solver.	CADE	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.	AAAI	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?	IJCAI	2022	DBLP DOI BibTeX RDF
31	Olaf Beyersdorff, Benjamin Böhm 0001	QCDCL with Cube Learning or Pure Literal Elimination - What is best?	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
31	Alexander D. Scott, Gregory B. Sorkin	Structure of random r-SAT below the pure literal threshold	CoRR	2010	DBLP BibTeX RDF
31	Richard J. Wallace	Enhancing Maximum Satisfiablility Algorithms with Pure Literal Strategies.	AI	1996	DBLP DOI BibTeX RDF
31	Paul Walton Purdom Jr.	Average Time for the Full Pure Literal Rule.	Inf. Sci.	1994	DBLP DOI BibTeX RDF
31	Khaled M. Bugrara, Youfang Pan, Paul Walton Purdom Jr.	Exponential Average Time for the Pure Literal Rule.	SIAM J. Comput.	1989	DBLP DOI BibTeX RDF
31	Khaled M. Bugrara, Paul Walton Purdom Jr.	An Exponential Lower Bound for the Pure Literal Rule.	Inf. Process. Lett.	1988	DBLP DOI BibTeX RDF
31	Paul Walton Purdom Jr., Cynthia A. Brown	The Pure Literal Rule and Polynomial Average Time.	SIAM J. Comput.	1985	DBLP DOI BibTeX RDF
31	John Franco	Probabilistic analysis of the pure literal heuristic for the satisfiability problem.	Ann. Oper. Res.	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.	ICTAI (2)	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.	CP	2005	DBLP DOI BibTeX RDF
16	Jeong Han Kim	The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems.	COCOON	2004	DBLP DOI BibTeX RDF
16	Gabriel Aguilera 0001, Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde	Reducing signed propositional formulas.	Soft Comput.	1998	DBLP DOI BibTeX RDF
16	Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde	Implicates and Reduction Techniques for Temporal Logics.	JELIA	1998	DBLP DOI BibTeX RDF