Author image not provided
 Matti Järvisalo

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.89
Citation Count264
Publication count54
Publication years2005-2017
Available for download1
Average downloads per article183.00
Downloads (cumulative)183
Downloads (12 Months)32
Downloads (6 Weeks)10
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


61 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 61
Result page: 1 2 3 4

Sort by:

1 published by ACM
February 2019 Journal of Experimental Algorithmics (JEA): Volume 24 Issue 1, June 2019
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 7,   Downloads (Overall): 7

Full text available: PDFPDF
The BT algorithm of Bouchitté and Todinca based on enumerating potential maximal cliques, originally proposed for the treewidth and minimum fill-in problems, yields improved exact exponential-time algorithms for various graph optimization problems related to optimal triangulations. While the BT algorithm has received significant attention in terms of theoretical analysis, less ...
Keywords: Bouchitté-Todinca algorithm, Potential maximal cliques, chordal completion, empirical evaluation, fractional hypertreewidth, generalized hypertreewidth, minimum fill-in, total table size, treewidth

2
July 2018 IJCAI'18: Proceedings of the 27th International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Maximum satisfiability (MaxSAT) offers a competitive approach to solving NP-hard real-world optimization problems. While state-of-the-art MaxSAT solvers rely heavily on Boolean satisfiability (SAT) solvers, a recent trend, brought on by MaxSAT solvers implementing the so-called implicit hitting set (IHS) approach, is to integrate techniques from the realm of integer programming ...

3 published by ACM
April 2018 SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Downloads (Overall): 23

Full text available: PDFPDF
The backbone of a constraint satisfaction problem consists of those variables that take the same value in all solutions. Algorithms for determining the backbone of propositional formulas, i.e., Boolean satisfiability (SAT) instances, find various real-world applications. From the knowledge representation and reasoning (KRR) perspective, one interesting connection is that of ...

4
January 2018 Machine Learning: Volume 107 Issue 1, January 2018
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

Various algorithms have been proposed for finding a Bayesian network structure that is guaranteed to maximize a given scoring function. Implementations of state-of-the-art algorithms, solvers, for this Bayesian network structure learning problem rely on adaptive search strategies, such as branch-and-bound and integer linear programming techniques. Thus, the time requirements of ...
Keywords: Algorithm portfolio, Algorithm selection, Bayesian networks, Empirical hardness, Hyperparameter optimization, Runtime prediction, Structure learning

5
September 2017 Journal of Artificial Intelligence Research: Volume 60 Issue 1, September 2017
Publisher: AI Access Foundation
Bibliometrics:
Citation Count: 0

Argumentation is an active area of modern artificial intelligence (AI) research, with connections to a range of fields, from computational complexity theory and knowledge representation and reasoning to philosophy and social sciences, as well as application-oriented work in domains such as legal reasoning, multi-agent systems, and decision support. Argumentation frameworks ...

6
August 2017 IJCAI'17: Proceedings of the 26th International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Discovery of causal relations is an important part of data analysis. Recent exact Boolean optimization approaches enable tackling very general search spaces of causal graphs with feedback cycles and latent confounders, simultaneously obtaining high accuracy by optimally combining conflicting independence information in sample data. We propose several domain-specific techniques and ...

7
August 2017 IJCAI'17: Proceedings of the 26th International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Developing accurate algorithms for learning structures of probabilistic graphical models is an important problem within modern AI research. Here we focus on score-based structure learning for Bayesian networks as arguably the most central class of graphical models. A successful generic approach to optimal Bayesian network structure learning (BNSL), based on ...

8
February 2017 AAAI'17: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

We give an overview of SAT Competition 2016, the 2016 edition of the famous competition for Boolean satisfiability (SAT) solvers with over 20 years of history. A key aim is to point out "what's hot" in SAT competitions in 2016, i.e., new developments in the competition series, including new competition ...

9
January 2017 Journal of Artificial Intelligence Research: Volume 58 Issue 1, January 2017
Publisher: AI Access Foundation
Bibliometrics:
Citation Count: 0

The challenging task of learning structures of probabilistic graphical models is an important problem within modern AI research. Recent years have witnessed several major algorithmic advances in structure learning for Bayesian networks--arguably the most central class of graphical models--especially in what is known as the score-based setting. A successful generic ...

10
August 2016 ECAI'16: Proceedings of the Twenty-second European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 0

Full text available: PDFPDF
We propose subsumed label elimination (SLE), a so-called label-based preprocessing technique for the Boolean optimization paradigm of maximum satisfiability (MaxSAT). We formally show that SLE is orthogonal to previously proposed SAT-based preprocessing techniques for MaxSAT in that it can simplify the underlying minimal unsatisfiable core structure of MaxSAT instances. We ...

11
August 2016 ECAI'16: Proceedings of the Twenty-second European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 0

Full text available: PDFPDF
Argumentation is nowadays a core topic in AI research. Understanding computational and representational aspects of abstract argumentation frameworks (AFs) is a central topic in the study of argumentation. The study of realizability of AFs aims at understanding the expressive power of AFs under different semantics. We propose and study the ...

12
August 2016 Journal of Computer and System Sciences: Volume 82 Issue 5, August 2016
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

We study circuits for linear maps defined by n times n Boolean matrices.We consider three circuit models: OR-circuits, SUM-circuits, and XOR-circuits.Our focus is on separating these models in terms of their circuit complexities.We obtain matrices with OR-circuits of size O(n) which require large SUM-circuits.We prove a conditional quadratic lower bound ...
Keywords: Boolean arithmetic, Arithmetic circuits, Rewriting, Idempotent arithmetic, Monotone separations

13
July 2016 IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

This overview accompanies the author's IJCAI-16 Early Career Spotlight Talk, highlighting aspects of the author's research agenda with a strong focus on some of the author's recent research contributions.

14
July 2016 IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

We present complexity results and algorithms for optimal status enforcement in abstract argumentation. Status enforcement is the task of adjusting a given argumentation framework (AF) to support given positive and negative argument statuses, i.e., to accept and reject specific arguments. We study optimal status enforcement as the problem of finding ...

15
April 2016 KR'16: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning
Publisher: AAAI Press
Bibliometrics:
Citation Count: 1

Lifting a recent proposal by Moreno-Centeno and Karp, we propose a general framework for so-called implicit hitting set algorithms for reasoning beyond NP. The framework is motivated by empirically successful specific instantiations of the approach—based on interactions between a Boolean satisfiability (SAT) solver and an integer programming (IP) solver—in the ...

16
March 2016 Journal of Computer and System Sciences: Volume 82 Issue 2, March 2016
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

Consider a complete communication network on n nodes. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses are "odd" and which are "even". Furthermore, the solution needs to be self-stabilising (reaching correct operation from any initial state) and tolerate f Byzantine ...
Keywords: Self-stabilisation, Byzantine fault tolerance, Distributed computing, Formal methods, SAT, Synthesis

17
February 2016 AAAI'16: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 2

Understanding the dynamics of argumentation frameworks (AFs) is important in the study of argumentation in AI. In this work, we focus on the so-called extension enforcement problem in abstract argumentation. We provide a nearly complete computational complexity map of fixed-argument extension enforcement under various major AF semantics, with results ranging ...

18
November 2015 ICTAI '15: Proceedings of the 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

Solvers for the maximum satisfiability (MaxSAT) problem -- a well-known optimization variant of Boolean satisfiability (SAT) -- are finding an increasing number of applications. Preprocessing has proven an integral part of the SAT-based approach to efficiently solving various types of real-world problem instances. It was recently shown that SAT preprocessing ...

19
July 2015 IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 2

Solvers for the Maximum satisfiability (MaxSAT) problem find an increasing number of applications today. We focus on improving MaxHS--one of the most successful recent MaxSAT algorithms-- via SAT-based preprocessing. We show that employing SAT-based preprocessing via the so-called labelled CNF (LCNF) framework before calling MaxHS can in some cases greatly ...

20
July 2015 IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us