|
Search the dblp DataBase
Matti Järvisalo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Matti Järvisalo
Further Investigations into Regular XORSAT. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf]
- Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. [Citation Graph (0, 0)][DBLP] AMAI, 2004, pp:- [Conf]
- Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Unrestricted vs restricted cut in a tableau method for Boolean circuits. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2005, v:44, n:4, pp:373-399 [Journal]
- Matti Järvisalo, Tommi A. Junttila
Limitations of Restricted Branching in Clause Learning. [Citation Graph (0, 0)][DBLP] CP, 2007, pp:348-363 [Conf]
- Matti Järvisalo, Emilia Oikarinen
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs. [Citation Graph (0, 0)][DBLP] ICLP, 2007, pp:134-148 [Conf]
On the Power of Top-Down Branching Heuristics. [Citation Graph (, )][DBLP]
Justification-Based Non-Clausal Local Search for SAT. [Citation Graph (, )][DBLP]
Justification-Based Local Search with Adaptive Noise Strategies. [Citation Graph (, )][DBLP]
A Module-Based Framework for Multi-language Constraint Modeling. [Citation Graph (, )][DBLP]
Max-ASP: Maximum Satisfiability of Answer Set Programs. [Citation Graph (, )][DBLP]
Reconstructing Solutions after Blocked Clause Elimination. [Citation Graph (, )][DBLP]
Blocked Clause Elimination. [Citation Graph (, )][DBLP]
Structure-based satisfiability checkingAnalyzing and harnessing the potential. [Citation Graph (, )][DBLP]
Limitations of restricted branching in clause learning. [Citation Graph (, )][DBLP]
Extended ASP tableaux and rule redundancy in normal logic programs [Citation Graph (, )][DBLP]
Testing and Debugging Techniques for Answer Set Solver Development [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|