Pages that link to "Item:Q687090"
From MaRDI portal
The following pages link to A continuous approach to inductive inference (Q687090):
Displaying 16 items.
- A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions (Q969776) (← links)
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Branching rules for satisfiability (Q1904401) (← links)
- An approach to guided learning of Boolean functions (Q1910784) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- An artificial neural network satisfiability tester (Q4329689) (← links)
- Boolean satisfiability in quantum compilation (Q4993497) (← links)
- Learning Optimal Decision Sets and Lists with SAT (Q5026234) (← links)
- Differentiable learning of matricized DNFs and its application to Boolean networks (Q6134346) (← links)
