A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
From MaRDI portal
(Redirected from Publication:969776)
Recommendations
- GRASP: a search algorithm for propositional satisfiability
- Incorporating clause learning in grid-based randomized SAT solving
- An exact algorithm for the constraint satisfaction problem: Application to logical inference
- Expressing and supporting efficiently greedy algorithms as locally stratified logic programs
- scientific article; zbMATH DE number 1114001
- On the use of stochastic local search techniques to revise first-order logic theories from examples
- Formal derivation of greedy algorithms from relational specifications: a tutorial
- On the minimum number of logical clauses inferred from examples
- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
Cites work
- A continuous approach to inductive inference
- A Relationship Between CNF and DNF Systems Derivable from Examples
- An approach to guided learning of Boolean functions
- Asking questions to minimize errors
- Generating logical expressions from positive and negative examples via a branch-and-bound approach
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 4200003 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
- Mathematical Programming in Neural Networks
- Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
Cited in
(7)- Generating logical expressions from positive and negative examples via a branch-and-bound approach
- A heuristic for mining association rules in polynomial time.
- An approach to guided learning of Boolean functions
- On the minimum number of logical clauses inferred from examples
- An incremental learning algorithm for constructing Boolean functions from positive and negative examples
- Performance analysis of a greedy algorithm for inferring Boolean functions
- Identifying the interacting positions of a protein using Boolean learning and support vector machines
This page was built for publication: A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969776)
