sign in · help · news · about ·

BibSonomy :: author :: Järvisalo ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(27)

<< < 1 | 2 > >>

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
Matti Järvisalo, Tommi A. Junttila, and Ilkka Niemelä ISAIM, (2004)
to dblp by dblp and 1 other user on Feb 9, 2012, 12:00 AM
URL | BibTeX
Covered Clause Elimination
Marijn Heule, Matti Järvisalo, and Armin Biere CoRR (2010)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Extended ASP tableaux and rule redundancy in normal logic programs
Matti Järvisalo, and Emilia Oikarinen CoRR (2008)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Testing and Debugging Techniques for Answer Set Solver Development
Robert Brummayer, and Matti Järvisalo CoRR (2010)
to dblp by dblp and 1 other user on Dec 5, 2011, 12:00 AM
URL | BibTeX
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability
Anton Belov, and Matti Järvisalo CoRR (2011)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
On the Relative Efficiency of DPLL and OBDDs with Axiom and Join.
Matti Järvisalo CP, volume 6876 of Lecture Notes in Computer Science, page 429-437. Springer, (2011)
to dblp by dblp on Sep 2, 2011, 12:00 AM
URL | BibTeX
Depth-Driven Circuit-Level Stochastic Local Search for SAT.
Anton Belov, Matti Järvisalo, and Zbigniew Stachniak IJCAI, page 504-509. IJCAI/AAAI, (2011)
to dblp by dblp on Aug 9, 2011, 12:00 AM
URL | BibTeX
Efficient CNF Simplification Based on Binary Implication Graphs.
Marijn Heule, Matti Järvisalo, and Armin Biere SAT, volume 6695 of Lecture Notes in Computer Science, page 201-215. Springer, (2011)
to dblp by dblp on Jun 15, 2011, 12:00 AM
URL | BibTeX
Itemset Mining as a Challenge Application for Answer Set Enumeration.
Matti Järvisalo LPNMR, volume 6645 of Lecture Notes in Computer Science, page 304-310. Springer, (2011)
to dblp by dblp on May 2, 2011, 12:00 AM
URL | BibTeX
Clause Elimination Procedures for CNF Formulas.
Marijn Heule, Matti Järvisalo, and Armin Biere LPAR Yogyakarta, volume 6397 of Lecture Notes in Computer Science, page 357-371. Springer, (2010)
to dblp by dblp on Oct 8, 2010, 12:00 AM
URL | BibTeX
Reconstructing Solutions after Blocked Clause Elimination.
Matti Järvisalo, and Armin Biere SAT, volume 6175 of Lecture Notes in Computer Science, page 340-345. Springer, (2010)
to dblp by dblp on Jul 21, 2010, 4:02 PM
URL | BibTeX
Testing and debugging techniques for answer set solver development.
Robert Brummayer, and Matti Järvisalo TPLP 10(4-6):741-758 (2010)
to dblp by dblp and 1 other user on Jul 21, 2010, 3:48 PM
URL | BibTeX
Blocked Clause Elimination.
Matti Järvisalo, Armin Biere, and Marijn Heule TACAS, volume 6015 of Lecture Notes in Computer Science, page 129-144. Springer, (2010)
to dblp by dblp on Mar 15, 2010, 12:00 AM
URL | BibTeX
Limitations of restricted branching in clause learning.
Matti Järvisalo, and Tommi A. Junttila Constraints 14(3):325-356 (2009)
to dblp by dblp on Sep 30, 2009, 12:00 AM
URL | BibTeX
A Module-Based Framework for Multi-language Constraint Modeling.
Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä LPNMR, volume 5753 of Lecture Notes in Computer Science, page 155-168. Springer, (2009)
to dblp by dblp on Sep 3, 2009, 12:00 AM
URL | BibTeX
Max-ASP: Maximum Satisfiability of Answer Set Programs.
Emilia Oikarinen, and Matti Järvisalo LPNMR, volume 5753 of Lecture Notes in Computer Science, page 236-249. Springer, (2009)
to dblp by dblp on Sep 3, 2009, 12:00 AM
URL | BibTeX
Structure-based satisfiability checkingAnalyzing and harnessing the potential.
Matti Järvisalo AI Commun. 22(2):117-119 (2009)
to dblp by dblp on Jun 29, 2009, 12:00 AM
URL | BibTeX
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.
Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä JSAT 2(1-4):27-46 (2006)
to dblp by dblp on May 5, 2009, 12:00 AM
URL | BibTeX
Justification-Based Non-Clausal Local Search for SAT.
Matti Järvisalo, Tommi A. Junttila, and Ilkka Niemelä ECAI, volume 178 of Frontiers in Artificial Intelligence and Applications, page 535-539. IOS Press, (2008)
to dblp by dblp on Jan 30, 2009, 12:00 AM
URL | BibTeX
Justification-Based Local Search with Adaptive Noise Strategies.
Matti Järvisalo, Tommi A. Junttila, and Ilkka Niemelä LPAR, volume 5330 of Lecture Notes in Computer Science, page 31-46. Springer, (2008)
to dblp by dblp on Nov 18, 2008, 12:00 AM
URL | BibTeX

<< < 1 | 2 > >>publications per page: 5 10 20 50 100

a gripper