Matti Järvisalo

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Unifying Core-Guided and Implicit Hitting Set Based Optimization.

[BibT_eX]

[DOI]

Hannes Ihalainen

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

MaxSAT-Based Inconsistency Measurement.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Oracle-Based Local Search for Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Markus Iser

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

SAT-based Judgment Aggregation.

[BibT_eX]

[DOI]

Ari Conati

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Incremental Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

MaxSAT-Based Bi-Objective Boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Pavel Smirnov

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Computing Smallest MUSes of Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2022

Clause Redundancy and Preprocessing in Maximum Satisfiability.

[BibT_eX]

[DOI]

Hannes Ihalainen

Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021

Preprocessing in SAT Solving.

[BibT_eX]

[DOI]

Benjamin Kiesl

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Maximum Satisfiability.

[BibT_eX]

[DOI]

Fahiem Bacchus

Ruben Martins

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2021

Declarative Algorithms and Complexity Results for Assumption-Based Argumentation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

SAT Competition 2020.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Acceptance in incomplete argumentation frameworks.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Maximal ancestral graph structure learning via exact search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Pseudo-Boolean Optimization by Implicit Hitting Sets.

[BibT_eX]

[DOI]

Pavel Smirnov

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper).

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Refined Core Relaxation for Core-Guided MaxSAT Solving.

[BibT_eX]

[DOI]

Hannes Ihalainen

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

Discovering causal graphs with cycles and latent confounders: An exact branch-and-bound approach.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2020

Learning Optimal Cyclic Causal Graphs from Interventional Data.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Probabilistic Graphical Models, 2020

Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation.

[BibT_eX]

[DOI]

Jarkko Savela

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

µ-toksia: An Efficient Abstract Argumentation Reasoner.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Controllability of Control Argumentation Frameworks.

[BibT_eX]

[DOI]

Daniel Neugebauer

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Learning Chordal Markov Networks via Stochastic Local Search.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Strong Refinements for Hard Problems in Argumentation Dynamics.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Preprocessing in Incomplete MaxSAT Solving.

[BibT_eX]

[DOI]

Marcus Leivo

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Deciding Acceptance in Incomplete Argumentation Frameworks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Finding Most Compatible Phylogenetic Trees over Multi-State Characters.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

SAT Competition 2018.

[BibT_eX]

[DOI]

Marijn J. H. Heule

Martin Suda

J. Satisf. Boolean Model. Comput., 2019

MaxSAT Evaluation 2018: New Developments and Detailed Results.

[BibT_eX]

[DOI]

Fahiem Bacchus

Ruben Martins

J. Satisf. Boolean Model. Comput., 2019

Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Synthesizing Argumentation Frameworks from Examples.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Towards transformational creation of novel songs.

[BibT_eX]

[DOI]

Connect. Sci., 2019

Preprocessing Argumentation Frameworks via Replacement Patterns.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Unifying Reasoning and Core-Guided Search for Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Enumerating Potential Maximal Cliques via SAT and ASP.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Centrality Heuristics for Exact Model Counting.

[BibT_eX]

[DOI]

Bernhard Bliem

Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Cautious reasoning in ASP via minimal models and unsatisfiable cores.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2018

Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction.

[BibT_eX]

[DOI]

Mach. Learn., 2018

Applications of MaxSAT in Data Analysis.

[BibT_eX]

[DOI]

Proceedings of Pragmatics of SAT 2015, 2018

A preference-based approach to backbone computation with application to argumentation.

[BibT_eX]

[DOI]

Alessandro Previti

Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018

Learning Optimal Causal Graphs with Exact Search.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Probabilistic Graphical Models, 2018

A Hybrid Approach to Optimization in Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Extension Enforcement under Grounded Semantics in Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Reduced Cost Fixing for Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

SAT-Based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2018

SAT for Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2018) co-located with the 7th International Conference on Computational Models of Argument (COMMA 2018), 2018

Premise Set Caching for Enumerating Minimal Correction Subsets.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

A constraint optimization approach to causal discovery from subsampled time series data.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2017

Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability.

[BibT_eX]

[DOI]

Artif. Intell., 2017

Improving MCS Enumeration via Caching.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

MaxPre: An Extended MaxSAT Preprocessor.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

AS-ASL: Algorithm Selection with Auto-sklearn.

[BibT_eX]

[DOI]

Proceedings of the Open Algorithm Selection Challenge 2017, 2017

Learning Chordal Markov Networks via Branch and Bound.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

A Core-Guided Approach to Learning Optimal Causal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Computing Generalized Backbones.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

Minimum-Width Confidence Bands via Constraint Optimization.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

Weight-Aware Core Extraction in SAT-Based MaxSAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

Reduced Cost Fixing in MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

SAT Competition 2016: Recent Developments.

[BibT_eX]

[DOI]

Tomás Balyo

Marijn J. H. Heule

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Separating OR, SUM, and XOR circuits.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Synchronous counting and computational algorithm design.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

LMHS: A SAT-IP Hybrid MaxSAT Solver.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Causal Discovery from Subsampled Time Series Data by Constraint Optimization.

[BibT_eX]

[DOI]

Proceedings of the Probabilistic Graphical Models - Eighth International Conference, 2016

Implicit Hitting Set Algorithms for Reasoning Beyond NP.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Pakota: A System for Enforcement in Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Optimal Status Enforcement in Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Boolean Satifiability and Beyond: Algorithms, Analysis, and AI Applications.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Subsumed Label Elimination for Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

Clause Elimination for SAT and QSAT.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Weak models of distributed computing, with connections to modal logic.

[BibT_eX]

[DOI]

Distributed Comput., 2015

Overview and analysis of the SAT Challenge 2012 solver competition.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Learning Optimal Chain Graphs with Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Impact of Learning Strategies on the Quality of Bayesian Networks: An Empirical Evaluation.

[BibT_eX]

[DOI]

Brandon M. Malone

Petri Myllymäki

Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Do-calculus when the True Graph Is Unknown.

[BibT_eX]

[DOI]

Frederick Eberhardt

Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract).

[BibT_eX]

[DOI]

Wolfgang Dvorák

Stefan Woltran

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Re-using Auxiliary Variables for MaxSAT Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

MaxSAT-Based Cutting Planes for Learning Graphical Models.

[BibT_eX]

[DOI]

Brandon M. Malone

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014

Complexity-sensitive decision procedures for abstract argumentation.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Stefan Woltran

Artif. Intell., 2014

Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming.

[BibT_eX]

[DOI]

Frederick Eberhardt

Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Conditional Lower Bounds for Failed Literals and Related Techniques.

[BibT_eX]

[DOI]

Janne H. Korhonen

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Answer Set Solver Backdoors.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

SAT-Based Approaches to Treewidth Computation: An Evaluation.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability.

[BibT_eX]

[DOI]

Brandon M. Malone

Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

Predicting the Hardness of Learning Bayesian Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Optimal Neighborhood Preserving Visualization by Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Formula Preprocessing in MUS Extraction.

[BibT_eX]

[DOI]

Anton Belov

João Marques-Silva

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Optimal Correlation Clustering via MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013

Harnessing Constraint Programming for Poetry Composition.

[BibT_eX]

[DOI]

Jukka M. Toivanen

Hannu Toivonen

Proceedings of the Fourth International Conference on Computational Creativity, 2013

Revisiting Hyper Binary Resolution.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

Simulating Circuit-Level Simplifications on CNF.

[BibT_eX]

[DOI]

J. Autom. Reason., 2012

The International SAT Solver Competitions.

[BibT_eX]

[DOI]

AI Mag., 2012

Finding Efficient Circuits for Ensemble Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Relating Proof Complexity Measures and Practical Hardness of SAT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Inprocessing Rules.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability

[BibT_eX]

[DOI]

Anton Belov

CoRR, 2011

Efficient CNF Simplification Based on Binary Implication Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Itemset Mining as a Challenge Application for Answer Set Enumeration.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Depth-Driven Circuit-Level Stochastic Local Search for SAT.

[BibT_eX]

[DOI]

Anton Belov

Zbigniew Stachniak

Proceedings of the IJCAI 2011, 2011

On the Relative Efficiency of DPLL and OBDDs with Axiom and Join.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Testing and debugging techniques for answer set solver development.

[BibT_eX]

[DOI]

Robert Brummayer

Theory Pract. Log. Program., 2010

Blocked Clause Elimination.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Reconstructing Solutions after Blocked Clause Elimination.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Covered Clause Elimination.

[BibT_eX]

[DOI]

Proceedings of the Short papers for 17th International Conference on Logic for Programming, 2010

Clause Elimination Procedures for CNF Formulas.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Limitations of restricted branching in clause learning.

[BibT_eX]

[DOI]

Constraints An Int. J., 2009

Structure-based satisfiability checkingAnalyzing and harnessing the potential.

[BibT_eX]

[DOI]

AI Commun., 2009

Max-ASP: Maximum Satisfiability of Answer Set Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

A Module-Based Framework for Multi-language Constraint Modeling.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

2008

Structure-based satisfiability checking : analyzing and harnessing the potential.

[BibT_eX]

[DOI]

PhD thesis, 2008

Extended ASP Tableaux and rule redundancy in normal logic programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2008

The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study.

[BibT_eX]

[DOI]

J. Algorithms, 2008

Justification-Based Local Search with Adaptive Noise Strategies.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Justification-Based Non-Clausal Local Search for SAT.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2008, 2008

On the Power of Top-Down Branching Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2006

Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2006

Further Investigations into Regular XORSAT.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Unrestricted vs restricted cut in a tableau method for Boolean circuits.

[BibT_eX]

[DOI]