Search results for "one-literal"

Found 17 publication records. Showing 17 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
43	Hans Kleine Büning, Daoyun Xu	The complexity of homomorphisms and renamings for minimal unsatisfiable formulas.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	minimal unsatisfiable formula, complexity, graph isomorphism, homomorphism, renaming
32	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
24	Lawrence J. Henschen, Larry Wos	Unit Refutations and Horn Sets.	J. ACM	1974	DBLP DOI BibTeX RDF
22	Gábor Kusper	Solving the resolution-free SAT problem by submodel propagation in linear time.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	resolution-free SAT, submodel propagation, Unicorn-SAT, SAT
22	K. Subramani 0001	Absorbing Random Walks and the NAE2SAT Problem.	FAW	2008	DBLP DOI BibTeX RDF
22	Oliver Kullmann	The Combinatorics of Conflicts between Clauses.	SAT	2003	DBLP DOI BibTeX RDF
13	Jack Minker	On Indefinite Databases and the Closed World Assumption.	CADE	1982	DBLP DOI BibTeX RDF
12	Luís Moniz Pereira, Luís Caires, José Júlio Alferes	SLWV - A Theorem Prover for Logic Programming.	ELP	1992	DBLP DOI BibTeX RDF
12	Johanne Morin, Stan Matwin	Learning Relational Clichés with Contextual LGG.	ISMIS	2000	DBLP DOI BibTeX RDF
11	Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol	(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.	SAT	2009	DBLP DOI BibTeX RDF
11	Stefan Porschen, Bert Randerath, Ewald Speckenmeyer	Exact 3-satisfiability is decidable in time O(20.16254n).	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	exact satisfiability, autonomous clause pattern, formula graph, NP-completeness, perfect matching
11	Juan J. Rodríguez Diez, Carlos Alonso González	Applying Boosting to Similarity Literals for Time Series Classification.	Multiple Classifier Systems	2000	DBLP DOI BibTeX RDF
11	Eric McCreath, Arun Sharma 0001	LIME: A System for Learning Relations.	ALT	1998	DBLP DOI BibTeX RDF
11	Belaid Benhamou, Lakhdar Sais, Pierre Siegel	Two Proof Procedures for a Cardinality Based Language in Propositional Calculus.	STACS	1994	DBLP DOI BibTeX RDF	symmetry and cardinality, theorem proving, propositional calculus
11	Wen-Tsuen Chen, Ming-Yi Fang	Theorem proving in propositional logic on vector computers using a generalized Davis-Putnam procedure.	SC	1990	DBLP DOI BibTeX RDF
11	Ewald Speckenmeyer	Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability.	MFCS	1988	DBLP DOI BibTeX RDF
11	Ewald Speckenmeyer	On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem.	CSL	1987	DBLP DOI BibTeX RDF