The following pages link to Matti Järvisalo (Q269491):
Displaying 50 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- A constraint optimization approach to causal discovery from subsampled time series data (Q1678425) (← links)
- Improving MCS enumeration via caching (Q1680254) (← links)
- SAT competition 2020 (Q2060693) (← links)
- Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Preprocessing argumentation frameworks via replacement patterns (Q2296701) (← links)
- Unifying reasoning and core-guided search for maximum satisfiability (Q2296713) (← links)
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach (Q2302940) (← links)
- From structured to abstract argumentation: assumption-based acceptance via AF reasoning (Q2401857) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- LMHS: A SAT-IP Hybrid MaxSAT Solver (Q2818041) (← links)
- Pakota: A System for Enforcement in Abstract Argumentation (Q2835885) (← links)
- Finding Efficient Circuits for Ensemble Computation (Q2843340) (← links)
- Inprocessing Rules (Q2908507) (← links)
- Answer Set Solver Backdoors (Q2938538) (← links)
- Clause Elimination for SAT and QSAT (Q2941732) (← links)
- Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Q2962570) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- (Q3089145) (← links)
- Conditional Lower Bounds for Failed Literals and Related Techniques (Q3192056) (← links)
- (Q3429155) (← links)
- Limitations of Restricted Branching in Clause Learning (Q3523067) (← links)
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study (Q3527696) (← links)
- Extended ASP Tableaux and rule redundancy in normal logic programs (Q3546041) (← links)
- Blocked Clause Elimination (Q3557074) (← links)
- Testing and debugging techniques for answer set solver development (Q3585183) (← links)
- Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs (Q3608651) (← links)
- A Module-Based Framework for Multi-language Constraint Modeling (Q3643114) (← links)
- Max-ASP: Maximum Satisfiability of Answer Set Programs (Q3643122) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- Synthesizing Argumentation Frameworks from Examples (Q4576191) (← links)
- Subsumed Label Elimination for Maximum Satisfiability (Q4576195) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Revisiting Hyper Binary Resolution (Q4922905) (← links)
- Reconstructing Solutions after Blocked Clause Elimination (Q4930602) (← links)
- Clause Elimination Procedures for CNF Formulas (Q4933317) (← links)
- Synthesizing Argumentation Frameworks from Examples (Q4972724) (← links)
- Strong Refinements for Hard Problems in Argumentation Dynamics (Q4999289) (← links)
- (Q4999322) (← links)
- Declarative Algorithms and Complexity Results for Assumption-Based Argumentation (Q5009697) (← links)
- (Q5215685) (← links)
- Formula Preprocessing in MUS Extraction (Q5326319) (← links)
- Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation (Q5371007) (← links)
