We stand with Ukraine

We stand with Ukraine

Felip Manyà

Orcid: 0000-0002-8366-1458

Affiliations:

Artificial Intelligence Research Institute, Bellaterra, Spain

According to our database¹, Felip Manyà authored at least 130 papers between 1994 and 2025.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org
on scholar.google.com

On csauthors.net:

Bibliography

2025

Integrating multi-armed bandit with local search for MaxSAT.

[BibT_eX]

[DOI]

,

,

,

,

,

Artif. Intell., 2025

2024

A Tableau Calculus for Non-Clausal Regular MaxSAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 54th IEEE International Symposium on Multiple-Valued Logic, 2024

A Complete Tableau Calculus for Non-Clausal Regular MinSAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Artificial Intelligence Research and Development, 2024

2023

MaxSAT resolution for regular propositional logic.

[BibT_eX]

[DOI]

,

,

,

Int. J. Approx. Reason., November, 2023

Parallel Bounded Search for the Maximum Clique Problem.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comput. Sci. Technol., September, 2023

The MaxSAT Problem in the Real-Valued MV-Algebra.

[BibT_eX]

[DOI]

Zuzana Haniková

,

,

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

Linking Łukasiewicz Logic and Boolean Maximum Satisfiability.

[BibT_eX]

[DOI]

,

,

Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023

Benchmarking Łukasiewicz Logic Solvers with Properties of Neural Networks.

[BibT_eX]

[DOI]

,

,

Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023

A Tableau Calculus for Signed Maximum Satisfiability.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023

A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers.

[BibT_eX]

[DOI]

,

,

,

,

,

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

A Complete Tableau Calculus for the Regular MaxSAT Problem.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Artificial Intelligence Research and Development, 2023

2022

Negative Learning Ant Colony Optimization for MaxSAT.

[BibT_eX]

[DOI]

Teddy Nurcahyadi

,

,

Int. J. Comput. Intell. Syst., 2022

Clausal Forms in MaxSAT and MinSAT.

[BibT_eX]

[DOI]

,

,

Joan Ramon Soler

,

Int. J. Comput. Intell. Syst., 2022

Incomplete MaxSAT approaches for combinatorial testing.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Josep M. Salvia

,

J. Heuristics, 2022

Incorporating Multi-armed Bandit with Local Search for MaxSAT.

[BibT_eX]

[DOI]

,

,

,

,

,

CoRR, 2022

Boosting branch-and-bound MaxSAT solvers with clause learning.

[BibT_eX]

[DOI]

,

,

,

,

,

AI Commun., 2022

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit.

[BibT_eX]

[DOI]

,

,

,

,

,

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract).

[BibT_eX]

[DOI]

,

,

,

,

,

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

A Tableau Calculus for MaxSAT Based on Resolution.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Artificial Intelligence Research and Development, 2022

Inference in MaxSAT and MinSAT.

[BibT_eX]

[DOI]

,

Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022

2021

MaxSAT, Hard and Soft Constraints.

[BibT_eX]

[DOI]

,

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

A resolution calculus for MinSAT.

[BibT_eX]

[DOI]

,

,

Log. J. IGPL, 2021

Clause tableaux for maximum and minimum satisfiability.

[BibT_eX]

[DOI]

,

,

,

Joan Ramon Soler

Log. J. IGPL, 2021

Solving longest common subsequence problems via a transformation to the maximum clique problem.

[BibT_eX]

[DOI]

,

Marko Djukanovic

,

Alberto Santini

,

,

,

,

Günther R. Raidl

Comput. Oper. Res., 2021

Combining Clause Learning and Branch and Bound for MaxSAT.

[BibT_eX]

[DOI]

,

,

,

,

,

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

From Non-Clausal to Clausal MinSAT.

[BibT_eX]

[DOI]

,

,

Joan Ramon Soler

,

Proceedings of the Artificial Intelligence Research and Development, 2021

2020

Solving the Team Composition Problem in a Classroom.

[BibT_eX]

[DOI]

,

Santiago Negrete

,

,

Joan Ramon Soler

Fundam. Informaticae, 2020

Clause vivification by unit propagation in CDCL SAT solvers.

[BibT_eX]

[DOI]

,

,

,

,

,

Artif. Intell., 2020

Tableaux for Maximum Satisfiability in Łukasiewicz Logic.

[BibT_eX]

[DOI]

,

,

Proceedings of the 50th IEEE International Symposium on Multiple-Valued Logic, 2020

2019

New complexity results for Łukasiewicz logic.

[BibT_eX]

[DOI]

,

,

,

Soft Comput., 2019

A branching heuristic for SAT solvers based on complete implication graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Sci. China Inf. Sci., 2019

A Tableau Calculus for Non-clausal Maximum Satisfiability.

[BibT_eX]

[DOI]

,

,

Joan Ramon Soler

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Clausal Form Transformation in MaxSAT.

[BibT_eX]

[DOI]

,

,

Joan Ramon Soler

Proceedings of the 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), 2019

2018

A new upper bound for the maximum weight clique problem.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Oper. Res., 2018

Clause Branching in MaxSAT and MinSAT.

[BibT_eX]

[DOI]

,

,

,

Joan Ramon Soler

Proceedings of the Artificial Intelligence Research and Development, 2018

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem.

[BibT_eX]

[DOI]

,

,

,

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

2017

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem.

[BibT_eX]

[DOI]

,

,

Comput. Oper. Res., 2017

Exploiting Many-Valued Variables in MaxSAT.

[BibT_eX]

[DOI]

,

,

Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers.

[BibT_eX]

[DOI]

,

,

,

,

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

Solving MaxSAT with Natural Deduction.

[BibT_eX]

[DOI]

Joan Casas-Roma

,

Antonia Huertas

,

Proceedings of the Recent Advances in Artificial Intelligence Research and Development, 2017

A MaxSAT-Based Approach to the Team Composition Problem in a Classroom.

[BibT_eX]

[DOI]

,

Santiago Negrete

,

,

Joan Ramon Soler

Proceedings of the Autonomous Agents and Multiagent Systems, 2017

An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs.

[BibT_eX]

[DOI]

,

,

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

2016

Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Fuzzy Sets Syst., 2016

A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics.

[BibT_eX]

[DOI]

Joan Ramon Soler

,

Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

A Clause Tableau Calculus for MaxSAT.

[BibT_eX]

[DOI]

,

,

Joan Ramon Soler

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

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs.

[BibT_eX]

[DOI]

,

,

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

A Clause Tableau Calculus for MinSAT.

[BibT_eX]

[DOI]

,

,

Joan Ramon Soler

Proceedings of the Artificial Intelligence Research and Development, 2016

2015

SAT and SMT Technology for Many-Valued Logics.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

J. Multiple Valued Log. Soft Comput., 2015

Approximate dynamic programming for automated vacuum waste collection systems.

[BibT_eX]

[DOI]

Cèsar Fernández

,

,

,

Francina Sole-Mauri

Environ. Model. Softw., 2015

The Complexity of 3-Valued Łukasiewicz Rules.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Modeling Decisions for Artificial Intelligence, 2015

Finding Hard Instances of Satisfiability in Lukasiewicz Logics.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 2015 IEEE International Symposium on Multiple-Valued Logic, 2015

An Exact Inference Scheme for MinSAT.

[BibT_eX]

[DOI]

,

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

2014

Modeling energy consumption in automated vacuum waste collection systems.

[BibT_eX]

[DOI]

Cèsar Fernández

,

,

,

Francina Sole-Mauri

Environ. Model. Softw., 2014

Many-Valued MinSAT Solving.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the IEEE 44th International Symposium on Multiple-Valued Logic, 2014

2013

Resolution procedures for multiple-valued optimization.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Maria Luisa Bonet

,

,

Inf. Sci., 2013

MinSAT versus MaxSAT for Optimization Problems.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Principles and Practice of Constraint Programming, 2013

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Idelfonso Izquierdo

,

,

José Torres-Jiménez

Proceedings of the Artificial Intelligence Research and Development, 2013

2012

Foreward.

[BibT_eX]

[DOI]

Francesc Esteva

,

,

J. Multiple Valued Log. Soft Comput., 2012

Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic.

[BibT_eX]

[DOI]

Francesc Esteva

,

,

J. Multiple Valued Log. Soft Comput., 2012

Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT.

[BibT_eX]

[DOI]

,

,

,

J. Multiple Valued Log. Soft Comput., 2012

Optimizing with minimum satisfiability.

[BibT_eX]

[DOI]

,

,

,

Artif. Intell., 2012

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Proceedings of the 42nd IEEE International Symposium on Multiple-Valued Logic, 2012

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.

[BibT_eX]

[DOI]

,

Cèsar Fernández

,

,

,

Francina Sole-Mauri

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

A New Encoding from MinSAT into MaxSAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Principles and Practice of Constraint Programming, 2012

A SAT-Based Approach to MinSAT.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Proceedings of the Artificial Intelligence Research and Development, 2012

The Automated Vacuum Waste Collection Optimization Problem.

[BibT_eX]

[DOI]

,

Cèsar Fernández

,

,

,

Francina Sole-Mauri

,

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Analyzing the Instances of the MaxSAT Evaluation.

[BibT_eX]

[DOI]

,

,

,

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

Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

Minimum Satisfiability and Its Applications.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the IJCAI 2011, 2011

Experimenting with the Instances of the MaxSAT Evaluation.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Artificial Intelligence Research and Development, 2011

2010

Resolution-based lower bounds in MaxSAT.

[BibT_eX]

[DOI]

,

,

Nouredine Ould Mohamedou

,

Constraints An Int. J., 2010

Exact MinSAT Solving.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

New Insights into Encodings from MaxCSP into Partial MaxSAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 2010

2009

MaxSAT, Hard and Soft Constraints.

[BibT_eX]

[DOI]

,

Proceedings of the Handbook of Satisfiability, 2009

Exploiting Cycle Structures in Max-SAT.

[BibT_eX]

[DOI]

,

,

Nouredine Ould Mohamedou

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Sequential Encodings from Max-CSP into Partial Max-SAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Generating Hard Instances for MaxSAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the ISMVL 2009, 2009

Regular Encodings from Max-CSP into Partial Max-SAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the ISMVL 2009, 2009

2008

The First and Second Max-SAT Evaluations.

[BibT_eX]

[DOI]

,

,

,

J. Satisf. Boolean Model. Comput., 2008

An efficient solver for weighted Max-SAT.

[BibT_eX]

[DOI]

,

,

J. Glob. Optim., 2008

A Preprocessor for Max-SAT Solvers.

[BibT_eX]

[DOI]

,

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Modelling Max-CSP as Partial Max-SAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Encoding Max-CSP into Partial Max-SAT.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation.

[BibT_eX]

[DOI]

,

,

Nouredine Ould Mohamedou

,

Proceedings of the Principles and Practice of Constraint Programming, 2008

Measuring the Hardness of SAT Instances.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Maria Luisa Bonet

,

,

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

2007

New Inference Rules for Max-SAT.

[BibT_eX]

[DOI]

,

,

J. Artif. Intell. Res., 2007

Regular-SAT: A many-valued approach to solving combinatorial problems.

[BibT_eX]

[DOI]

,

,

,

Cèsar Fernández

,

Discret. Appl. Math., 2007

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Ann. Math. Artif. Intell., 2007

Resolution for Max-SAT.

[BibT_eX]

[DOI]

Maria Luisa Bonet

,

,

Artif. Intell., 2007

Partial Max-SAT Solvers with Clause Learning.

[BibT_eX]

[DOI]

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Mapping CSP into Many-Valued SAT.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Maria Luisa Bonet

,

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

A Complete Resolution Calculus for Signed Max-SAT.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Maria Luisa Bonet

,

,

Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

The Logic Behind Weighted CSP.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Maria Luisa Bonet

,

,

Proceedings of the IJCAI 2007, 2007

What Is a Real-World SAT Instance?

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Maria Luisa Bonet

,

,

Proceedings of the Artificial Intelligence Research and Development, 2007

Inference Rules for High-Order Consistency in Weighted CSP.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Maria Luisa Bonet

,

,

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Exact Max-SAT solvers for over-constrained problems.

[BibT_eX]

[DOI]

,

J. Heuristics, 2006

A Complete Calculus for Max-SAT.

[BibT_eX]

[DOI]

Maria Luisa Bonet

,

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Towards Solving Many-Valued MaxSAT.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 2006

Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT.

[BibT_eX]

[DOI]

,

,

Proceedings of the Proceedings, 2006

2005

Solving Over-Constrained Problems with SAT Technology.

[BibT_eX]

[DOI]

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Improved Exact Solvers for Weighted Max-SAT.

[BibT_eX]

[DOI]

,

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Mapping Many-Valued CNF Formulas to Boolean CNF Formulas.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Proceedings of the 35th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2005), 2005

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.

[BibT_eX]

[DOI]

,

,

Proceedings of the Principles and Practice of Constraint Programming, 2005

Solving Over-Constrained Problems with SAT.

[BibT_eX]

[DOI]

,

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Proceedings of the SAT 2004, 2004

The Interface between P and NP in Signed CNF Formulas.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 2004

A Max-SAT Solver with Lazy Data Structures.

[BibT_eX]

[DOI]

,

,

Proceedings of the Advances in Artificial Intelligence, 2004

Modeling Choices in Quasigroup Completion: SAT vs. CSP.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

,

Cèsar Fernández

,

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Exact Algorithms for MAX-SAT.

[BibT_eX]

[DOI]

,

,

Proceedings of the 4th International Workshop on First-Order Theorem Proving, 2003

Automated monitoring of medical protocols: a secure and distributed architecture.

[BibT_eX]

[DOI]

,

Carlos Ansótegui

,

,

Cèsar Fernández

,

Artif. Intell. Medicine, 2003

Técnicas de resolución de problemas de satisfacción de restricciones.

[BibT_eX]

[DOI]

,

Inteligencia Artif., 2003

Una introducción a los algoritmos de satisfactibilidad.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Inteligencia Artif., 2003

New Logical and Complexity Results for Signed-SAT.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

Boosting Chaff's Performance by Incorporating CSP Heuristics.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

,

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

Bridging the Gap between SAT and CSP.

[BibT_eX]

[DOI]

Carlos Ansótegui

,

Proceedings of the Principles and Practice of Constraint Programming, 2002

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.

[BibT_eX]

[DOI]

,

,

,

Cèsar Fernández

,

Proceedings of the Topics in Artificial Intelligence, 5th Catalonian Conference on AI, 2002

2001

Extending the Reach of SAT with Many-Valued Logics.

[BibT_eX]

[DOI]

,

,

Cèsar Fernández

,

,

Electron. Notes Discret. Math., 2001

A Modular Reduction of Regular Logic to Classical Logic.

[BibT_eX]

[DOI]

,

,

Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

Capturing Structure with Satisfiability.

[BibT_eX]

[DOI]

,

,

Cèsar Fernández

,

,

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

The 2-SAT Problem of Regular Signed CNF Formulas.

[BibT_eX]

[DOI]

Bernhard Beckert

,

,

Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic, 2000

A Multi-agent system architecture for monitoring medical protocols.

[BibT_eX]

[DOI]

,

,

Cèsar Fernández

,

Proceedings of the Fourth International Conference on Autonomous Agents, 2000

Solving the Round Robin Problem Using Propositional Logic.

[BibT_eX]

[DOI]

,

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

Solving Combinatorial Problems with Regular Local Search Algorithms.

[BibT_eX]

[DOI]

,

Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Transformations between Signed and Classical Clause Logic.

[BibT_eX]

[DOI]

Bernhard Beckert

,

,

Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic, 1999

Phase Transitions in the Regular Random 3-SAT Problem.

[BibT_eX]

[DOI]

,

Proceedings of the Foundations of Intelligent Systems, 11th International Symposium, 1999

A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas.

[BibT_eX]

[DOI]

,

Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1999

1998

The satisfiability problem in regular CNF-formulas.

[BibT_eX]

[DOI]

,

,

Gonzalo Escalada-Imaz

Soft Comput., 1998

1994

The Satisfiability Problem in Multiple-Valued Horn Formulae.

[BibT_eX]

[DOI]

Gonzalo Escalada-Imaz

,

Proceedings of the 24th IEEE International Symposium on Multiple-Valued Logic, 1994

Efficient Interpretation of Propositional Multiple-valued Logic Programs.

[BibT_eX]

[DOI]

Gonzalo Escalada-Imaz

,

Proceedings of the Advances in Intelligent Computing, 1994

Loading...