scientific article; zbMATH DE number 1324220
From MaRDI portal
Publication:4255462
zbMATH Open0997.90506MaRDI QIDQ4255462FDOQ4255462
Authors:
Publication date: 15 August 1999
Title of this publication is not available (Why is that?)
Recommendations
- Optimization methods in logic
- scientific article; zbMATH DE number 4085615
- Optimization techniques for propositional intuitionistic logic and their implementation
- scientific article; zbMATH DE number 1550909
- scientific article; zbMATH DE number 1016959
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Optimizing probabilities in probabilistic logic programs
- scientific article; zbMATH DE number 3880460
- Logic, optimization, and constraint programming
Cited In (46)
- Incremental methods for optimizing partial instantiation
- Resolution and the integrality of satisfiability problems
- Construction of rule-based assignment models
- On exact selection of minimally unsatisfiable subformulae
- Title not available (Why is that?)
- Autark assignments of Horn CNFs
- Learning from conflicts in propositional satisfiability
- From LP to LP: Programming with constraints
- Optimization methods in logic
- What we can learn from conflicts in propositional satisfiability
- Title not available (Why is that?)
- Title not available (Why is that?)
- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
- Title not available (Why is that?)
- Parametric optimization and optimal control using algebraic geometry methods
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Optimum inductive methods
- A method of logical inference of modified conclusions
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
- Ideal clutters
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- Prominent classes of the most general subsumptive solutions of Boolean equations
- New methods for computing inferences in first order logic
- Formulating logical implications in combinatorial optimisation
- On a decision procedure for quantified linear programs
- A strategic model for supply chain design with logical constraints: Formulation and solution.
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- New tractable classes for default reasoning from conditional knowledge bases
- A probabilistic logic based on the acceptability of gambles
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- A complete adaptive algorithm for propositional satisfiability
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Calibrated imputation for multivariate categorical data
- Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
- A logic-based approach to polymer sequence analysis
- Improved extraction method on logic function optimization of mass data processing
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
- Solving peptide sequencing as satisfiability
- Generalized probabilistic satisfiability
- On semidefinite least squares and minimal unsatisfiability
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- Probabilistic satisfiability and coherence checking through integer programming
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255462)
