Leibniz

swMATH12871MaRDI QIDQ24795FDOQ24795

Author name not available (Why is that?)

Described by source

• Design of Logic‐based Intelligent Systems
• Unnamed Publication

Cited In (34)

• Title not available (Why is that?)
• Oriented hypergraphs: introduction and balance
• Some interesting research directions in satisfiability
• A MINSAT approach for learning in logic domains
• A perspective on certain polynomial-time solvable classes of satisfiability
• Title not available (Why is that?)
• On exact selection of minimally unsatisfiable subformulae
• On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
• On functional dependencies in \(q\)-Horn theories
• Consistency of the static and dynamic components of object-oriented specifications
• Title not available (Why is that?)
• Algebraic and dynamical cancellations associated to spectral sequence
• Ideal clutters
• Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
• A characterization of oriented hypergraphic balance via signed weak walks
• Balanced matrices
• Title not available (Why is that?)
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• Oriented hypergraphs: balanceability
• Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
• An algorithm for the class of pure implicational formulas
• A complete adaptive algorithm for propositional satisfiability
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Theory and Applications of Satisfiability Testing
• A logic-based approach to polymer sequence analysis
• A satisfiability procedure for quantified Boolean formulae
• Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479)
• Signed-graphic matroids with all-graphic cocircuits
• New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
• Solving peptide sequencing as satisfiability
• Implementation of a unimodularity test
• Probability logic and optimization SAT: The PSAT and CPA models

This page was built for software: Leibniz