|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 6 keywords
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Anton Belov, Matti Järvisalo |
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anton Belov, Matti Järvisalo, Zbigniew Stachniak |
Depth-Driven Circuit-Level Stochastic Local Search for SAT. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marijn Heule, Matti Järvisalo, Armin Biere |
Efficient CNF Simplification Based on Binary Implication Graphs. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo |
Itemset Mining as a Challenge Application for Answer Set Enumeration. |
LPNMR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo |
On the Relative Efficiency of DPLL and OBDDs with Axiom and Join. |
CP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijn Heule, Matti Järvisalo, Armin Biere |
Covered Clause Elimination |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Brummayer, Matti Järvisalo |
Testing and Debugging Techniques for Answer Set Solver Development |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Brummayer, Matti Järvisalo |
Testing and debugging techniques for answer set solver development. |
TPLP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Armin Biere, Marijn Heule |
Blocked Clause Elimination. |
TACAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijn Heule, Matti Järvisalo, Armin Biere |
Clause Elimination Procedures for CNF Formulas. |
LPAR (Yogyakarta) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Armin Biere |
Reconstructing Solutions after Blocked Clause Elimination. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila |
Limitations of restricted branching in clause learning. |
Constraints |
2009 |
DBLP DOI BibTeX RDF |
Branching heuristics, Clause learning, Backdoor sets, Proof complexity, Propositional satisfiability, DPLL, Problem structure |
| 1 | Matti Järvisalo |
Structure-based satisfiability checkingAnalyzing and harnessing the potential. |
AI Commun. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilia Oikarinen, Matti Järvisalo |
Max-ASP: Maximum Satisfiability of Answer Set Programs. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä |
A Module-Based Framework for Multi-language Constraint Modeling. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Ilkka Niemelä |
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Emilia Oikarinen |
Extended ASP tableaux and rule redundancy in normal logic programs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo, Emilia Oikarinen |
Extended ASP Tableaux and rule redundancy in normal logic programs. |
TPLP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Justification-Based Non-Clausal Local Search for SAT. |
ECAI |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Justification-Based Local Search with Adaptive Noise Strategies. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila |
On the Power of Top-Down Branching Heuristics. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo, Emilia Oikarinen |
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs. |
ICLP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila |
Limitations of Restricted Branching in Clause Learning. |
CP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä |
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. |
JSAT |
2006 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo |
Further Investigations into Regular XORSAT. |
AAAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Unrestricted vs restricted cut in a tableau method for Boolean circuits. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
cut rule, satisfiability, proof complexity, Boolean circuits, DPLL |
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. |
ISAIM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä |
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. |
AMAI |
2004 |
DBLP BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")