scientific article; zbMATH DE number 1324220
From MaRDI portal
Publication:4255462
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
(48)- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- On consistency in probabilistic logic for logical formulas represented by B-hypertrees
- New methods for computing inferences in first order logic
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- Resolution and the integrality of satisfiability problems
- Optimization of production knowledge base with respect to certainty and duration of inference
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- A strategic model for supply chain design with logical constraints: Formulation and solution.
- Formulating logical implications in combinatorial optimisation
- Construction of rule-based assignment models
- Autark assignments of Horn CNFs
- Generalized probabilistic satisfiability
- On exact selection of minimally unsatisfiable subformulae
- A complete adaptive algorithm for propositional satisfiability
- Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
- Optimum inductive methods
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
- Probabilistic satisfiability and coherence checking through integer programming
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- On a decision procedure for quantified linear programs
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- New tractable classes for default reasoning from conditional knowledge bases
- What we can learn from conflicts in propositional satisfiability
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- scientific article; zbMATH DE number 5932201 (Why is no real title available?)
- Optimization methods in logic
- Improved extraction method on logic function optimization of mass data processing
- scientific article; zbMATH DE number 4079375 (Why is no real title available?)
- scientific article; zbMATH DE number 151927 (Why is no real title available?)
- Learning from conflicts in propositional satisfiability
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- Prominent classes of the most general subsumptive solutions of Boolean equations
- From LP to LP: Programming with constraints
- Incremental methods for optimizing partial instantiation
- On semidefinite least squares and minimal unsatisfiability
- Parametric optimization and optimal control using algebraic geometry methods
- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
- A logic-based approach to polymer sequence analysis
- Calibrated imputation for multivariate categorical data
- Unit refutability of Horn constraint systems -- certification and parallel complexity
- Ideal clutters
- A method of logical inference of modified conclusions
- A probabilistic logic based on the acceptability of gambles
- Solving peptide sequencing as satisfiability
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
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)
