Nonlinear approaches to satisfiability problems

Interpretation and Partition Refinement for Model Checking D.R.Dams Faculty of Mathernaties and Computing Scienee, TUE, 1996-13 Topological Dualities in Bemantics M. M. Bonsangue Faculty of Mathernaties and Computer Scienee, VUA, 1996-14 Algorithms for Graphs of Small Treewidth B. L. E. de Fluiter Faculty of Mathernaties and Computer Scienee, UU, 1997-01 Process-algebraic Transformations in Context W. T. M. Kars Faculty of Computer Scienee, UT, 1997-02 A Generic Theory of Data Types P.F. Hoogendijk Faculty of Mathernaties and Computing Science, TUE, 1997-03 The Evolution of Type Theory in Logic and Mathernaties T.D. L. Laan Faeulty of Mathernaties and Computing Scienee, TUE, 1997-04 Preservation of Termination for Explicit Substitution C. J. Bloo Faeulty of Mathernaties and Computing Scienee, TUE, 1997-05 DiscreteTime Process Algebra J. J. Vereijken Faculty of Mathernaties and Computing Scienee, TUE, 1997-06 A Functional Approach to Syntax and Typing F. A. M. van den Beuken Faculty of Mathernaties and Informaties, KUN, 1997-07 Ins and Outs in Refusal Testing A.W. Heerink Faculty of Computer Science, UT, 1998-01 A Discrete-Event Simulator for Systems Engineering G. Naumoski and W. Alberts Faculty of Mechanica! Engineering, TUE, 1998-02 Scheduling with Communication for Multiprocessor Computation J. Verriet Faculty of Mathernaties and Computer Seienee, UU, 1998-03 An Asynchronous Low-Power 80C51 Microcontroller J. S.H. van Gageldonk Faculty of Mathernaties and Computing Scienee, TUE, 1998-04 In Terms of Nets: System Design with Petri Nets and Process Algebra A. A. Basten Faculty of Mathernaties and Oomputing Science, TUE, 1998-05 Inductive Datatypes with Laws and Subtyping -A Relational Model E. Voermans Faeulty of Mathernaties and Computing Science, TUE, 1999-01 Towards Probabilistic Unification-based Parsing H. ter Doest Faculty of Computer Scienee, UT, 1999-02 Algorithms for the Simulation of Surface Processes J.P.L. Segers Faeulty of Mathernaties and Computing Seienee, TUE, 1999-03 Recombinative Evolutionary Search C.H.M. van Kemenade LIAOS, faeulty of Mathernaties and Natura! Seienees, Leiden University, 1999-04 Learning Reliability: a Study on Indecisiveness in Sample Selection E.I. Barakova Faculty of Mathernaties and Natura! Sciences, RUG, 1999-05 Schedulere Optimization in RealTime Distributed Databases M.P. Bodlaender Faculty of Mathernaties and Oomputing Science, TUE, 1999-06 Message Sequence Chart: Syntax and Bemantics M.A. Reniers Faculty of Mathernaties and Cornputing Science, TUE, 1999-07 Nonlinear Approaches to Satisfiability Problems J .P. Warners Faculty of Mathernaties and Cornputing Science, TUE, 1999-08

[1]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[4]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[5]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[6]  Stephen A. Cook,et al.  A short proof of the pigeon hole principle using extended resolution , 1976, SIGA.

[7]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[10]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[11]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[12]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[13]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[14]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[15]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[16]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[17]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[18]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[19]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

[20]  P. Raghavan.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[21]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[22]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[23]  John N. Hooker,et al.  Generalized resolution and cutting planes , 1988 .

[24]  Michael H. Schulz,et al.  SOCRATES: a highly efficient automatic test pattern generation system , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[25]  A. Prékopa,et al.  Probabilistic bounds and algorithms for the maximum satisfiability problem , 1990 .

[26]  Mauricio G. C. Resende,et al.  Computational experience with an interior point algorithm on the satisfiability problem , 1990, IPCO.

[27]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[28]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[29]  John M. Wilson.  Compact normal forms in propositional logic and integer programming formulations , 1990, Comput. Oper. Res..

[30]  Mauricio G. C. Resende,et al.  An interior point algorithm to solve computationally difficult set covering problems , 1991, Math. Program..

[31]  John N. Hooker,et al.  Extended Horn sets in propositional logic , 1991, JACM.

[32]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[33]  Michael E. Saks,et al.  A Complexity Index for Satisfiability Problems , 1994, IPCO.

[34]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[35]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[36]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[37]  Mauricio G. C. Resende,et al.  A continuous approach to inductive inference , 1992, Math. Program..

[38]  Lakhdar Sais,et al.  Theoretical Study of Symmetries in Propositional Calculus and Applications , 1992, CADE.

[39]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[40]  K. G. Ramakrishnan,et al.  An interior point approach to Boolean vector function synthesis , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

[41]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[42]  David P. Williamson,et al.  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..

[43]  Tomás E. Uribe,et al.  Ordered Binary Decision Diagrams and the Davis-Putnam Procedure , 1994, CCL.

[44]  Martin W. P. Savelsbergh,et al.  MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[45]  Fred S. Annexstein,et al.  On Finding Solutions for Extended Horn Formulas , 1995, Inf. Process. Lett..

[46]  Toward A Good Algorithm for Determining Unsatisfiability of Prepositional Formulas , 1995 .

[47]  James M. Crawford,et al.  The Minimal Disagreement Parity Problem as a Hard Satisfiability Problem , 1995 .

[48]  P. Goel.  AN IMPLICIT ENUMERATION ALGORITHM TO GENERATE TESTS FOR COMBINATIONAL LOGIC CIRCUITS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[49]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[50]  Peter L. Hammer,et al.  Boolean Elements in Combinatorial Optimization , 1995 .

[51]  Cor A. J. Hurkens,et al.  An overview of algorithmic approaches to frequency assignment problems , 1995 .

[52]  Gérard Cornuéjols,et al.  A class of logic problems solvable by linear programming , 1995, JACM.

[53]  I. Schiermeyer.  Pure Literal Look Ahead: An O(1,497^n) Satisfiability Algorithm (Extended Abstract) , 1996 .

[54]  James M. Crawford,et al.  Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[55]  John Harrison,et al.  Stålmarck's Algorithm as a HOL Derived Rule , 1996, TPHOLs.

[56]  Leonid Faybusovich,et al.  Semidefinite Programming: A Path-Following Algorithm for a Linear-Quadratic Functional , 1996, SIAM J. Optim..

[57]  Theodore B. Trafalis,et al.  Unsupervised Neural Network Training Via a Potential Reduction Approach , 1996 .

[58]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[59]  Benjamin W. Wah,et al.  A discrete Lagrangian-based global-search method for solving satisfiability problems , 1996, Satisfiability Problem: Theory and Applications.

[60]  B. He,et al.  Method of approximate centers for semi-definite programming , 1997 .

[61]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[62]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[63]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[64]  Bart Selman,et al.  Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.

[65]  Tamás Terlaky,et al.  Potential reduction algorithms for structured combinatorial optimization problems , 1997, Oper. Res. Lett..

[66]  Tamás Terlaky,et al.  A Potential Reduction Approach to the Frequency Assignment Problem , 1997, Discret. Appl. Math..

[67]  Takao Asano,et al.  Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[68]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

[69]  Nadia Creignou.  Complexity Versus Stability for Classes of Propositional Formulas , 1998, Inf. Process. Lett..

[70]  Yin Zhang,et al.  Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment † , 1998 .

[71]  Benjamin W. Wah,et al.  A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..

[72]  Joost P. Warners,et al.  A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form , 1998, Inf. Process. Lett..

[73]  Dmitrii V. Pasechnik.  An Interior Point Approximation Algorithm for a Class of Combinatorial Optimization Problems: Implem , 1998 .

[74]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[75]  Endre Boros.  Maximum Renamable Horn sub-CNFs , 1999, Discret. Appl. Math..

[76]  Hans van Maaren,et al.  Elliptic Approximations of Propositional Formulae , 1999, Discret. Appl. Math..

[77]  Uri Zwick,et al.  Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs , 1999, J. Algorithms.

[78]  Luca Trevisan,et al.  Gadgets, Approximation, and Linear Programming , 2000, SIAM J. Comput..

[79]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[80]  Hans van Maaren,et al.  Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT , 2000, Discret. Appl. Math..

[81]  Oliver Kullmann,et al.  Investigations on autark assignments , 2000, Discret. Appl. Math..