Matti Järvisalo

From MaRDI portal
Person:269491

Available identifiers

zbMath Open jarvisalo.mattiWikidataQ88117527 ScholiaQ88117527MaRDI QIDQ269491

List of research outcomes

PublicationDate of PublicationType
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation2023-12-12Paper
Computing smallest MUSes of quantified Boolean formulas2023-04-04Paper
Clause redundancy and preprocessing in maximum satisfiability2022-12-07Paper
SAT competition 20202021-12-13Paper
Acceptance in incomplete argumentation frameworks2021-11-02Paper
Declarative Algorithms and Complexity Results for Assumption-Based Argumentation2021-08-05Paper
https://portal.mardi4nfdi.de/entity/Q49992892021-07-06Paper
https://portal.mardi4nfdi.de/entity/Q49993222021-07-06Paper
Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach2020-02-26Paper
Preprocessing argumentation frameworks via replacement patterns2020-02-18Paper
Unifying reasoning and core-guided search for maximum satisfiability2020-02-18Paper
https://portal.mardi4nfdi.de/entity/Q52156852020-02-12Paper
Synthesizing Argumentation Frameworks from Examples2019-11-26Paper
Solving Graph Problems via Potential Maximal Cliques2019-03-27Paper
Cautious reasoning in ASP via minimal models and unsatisfiable cores2018-12-04Paper
Synthesizing Argumentation Frameworks from Examples2018-07-12Paper
Subsumed Label Elimination for Maximum Satisfiability2018-07-12Paper
A constraint optimization approach to causal discovery from subsampled time series data2017-11-17Paper
Improving MCS enumeration via caching2017-11-15Paper
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation2017-10-24Paper
From structured to abstract argumentation: assumption-based acceptance via AF reasoning2017-09-05Paper
Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability2017-02-22Paper
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity2017-02-17Paper
Pakota: A System for Enforcement in Abstract Argumentation2016-11-30Paper
LMHS: A SAT-IP Hybrid MaxSAT Solver2016-09-05Paper
MaxSAT-Based Cutting Planes for Learning Graphical Models2016-07-25Paper
Separating OR, SUM, and XOR circuits2016-04-18Paper
Synchronous counting and computational algorithm design2015-12-11Paper
Complexity-sensitive decision procedures for abstract argumentation2015-08-27Paper
Clause Elimination for SAT and QSAT2015-08-25Paper
Weak models of distributed computing, with connections to modal logic2015-03-25Paper
Answer Set Solver Backdoors2015-01-14Paper
Weak models of distributed computing, with connections to modal logic2014-12-05Paper
Conditional Lower Bounds for Failed Literals and Related Techniques2014-09-26Paper
Finding Efficient Circuits for Ensemble Computation2013-08-12Paper
Formula Preprocessing in MUS Extraction2013-08-05Paper
Simulating circuit-level simplifications on CNF2013-07-05Paper
Revisiting Hyper Binary Resolution2013-06-04Paper
Inprocessing Rules2012-09-05Paper
https://portal.mardi4nfdi.de/entity/Q30891452011-08-24Paper
Efficient CNF Simplification Based on Binary Implication Graphs2011-06-17Paper
Clause Elimination Procedures for CNF Formulas2010-10-12Paper
Reconstructing Solutions after Blocked Clause Elimination2010-09-29Paper
Testing and debugging techniques for answer set solver development2010-08-19Paper
Blocked Clause Elimination2010-04-27Paper
A Module-Based Framework for Multi-language Constraint Modeling2009-11-10Paper
Max-ASP: Maximum Satisfiability of Answer Set Programs2009-11-10Paper
Limitations of restricted branching in clause learning2009-08-06Paper
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs2009-03-05Paper
Justification-Based Local Search with Adaptive Noise Strategies2009-01-27Paper
Extended ASP Tableaux and rule redundancy in normal logic programs2008-12-18Paper
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study2008-09-29Paper
Limitations of Restricted Branching in Clause Learning2008-09-02Paper
https://portal.mardi4nfdi.de/entity/Q34291552007-03-30Paper
Unrestricted vs restricted cut in a tableau method for Boolean circuits2006-01-23Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Matti Järvisalo