|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 17 keywords
|
|
|
Results
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 113-127, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![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 |
24 | Lawrence J. Henschen, Larry Wos |
Unit Refutations and Horn Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 21(4), pp. 590-605, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
22 | Gábor Kusper |
Solving the resolution-free SAT problem by submodel propagation in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 129-136, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
resolution-free SAT, submodel propagation, Unicorn-SAT, SAT |
22 | K. Subramani 0001 |
Absorbing Random Walks and the NAE2SAT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, pp. 89-100, 2008, Springer, 978-3-540-69310-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Oliver Kullmann |
The Combinatorics of Conflicts between Clauses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 426-440, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Jack Minker |
On Indefinite Databases and the Closed World Assumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 6th Conference on Automated Deduction, New York, USA, June 7-9, 1982, Proceedings, pp. 292-308, 1982, Springer, 3-540-11558-7. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
12 | Luís Moniz Pereira, Luís Caires, José Júlio Alferes |
SLWV - A Theorem Prover for Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ELP ![In: Extensions of Logic Programming, Third International Workshop, ELP'92, Bologna, Italy, February 26-28, 1992, Proceedings, pp. 1-23, 1992, Springer, 3-540-56454-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
12 | Johanne Morin, Stan Matwin |
Learning Relational Clichés with Contextual LGG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 12th International Symposium, ISMIS 2000, Charlotte, NC, USA, October 11-14, 2000, Proceedings, pp. 274-282, 2000, Springer, 3-540-41094-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 363-376, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
11 | Stefan Porschen, Bert Randerath, Ewald Speckenmeyer |
Exact 3-satisfiability is decidable in time O(20.16254n). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 173-193, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multiple Classifier Systems ![In: Multiple Classifier Systems, First International Workshop, MCS 2000, Cagliari, Italy, June 21-23, 2000, Proceedings, pp. 210-219, 2000, Springer, 3-540-67704-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
11 | Eric McCreath, Arun Sharma 0001 |
LIME: A System for Learning Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings, pp. 336-374, 1998, Springer, 3-540-65013-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
11 | Belaid Benhamou, Lakhdar Sais, Pierre Siegel |
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 71-82, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings Supercomputing '90, New York, NY, USA, November 12-16, 1990, pp. 658-665, 1990, IEEE Computer Society, 0-89791-412-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
11 | Ewald Speckenmeyer |
Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 529-538, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
11 | Ewald Speckenmeyer |
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings, pp. 281-288, 1987, Springer, 3-540-50241-6. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|