A continuous approach to inductive inference

DOI10.1007/BF01581082MaRDI QIDQ687090zbMATH OpenFDO

Authors Anil P. Kamath, Narendra K. Karmarkar, K. Ramakrishnan, Mauricio G. C. Resende

Publication date 6 January 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01581082

zbMATH Keywords

artificial intelligenceBoolean function synthesis problemhidden Boolean functioninductive inferenceinterior point mathematical programmingRiemannian geometryRiemannian metricsatisfiability problem

Mathematics Subject Classification ID

Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• scientific article; zbMATH DE number 517034
• scientific article; zbMATH DE number 1054681
• An approach to guided learning of Boolean functions
• Boolean regression

Cites work

• A Computing Procedure for Quantification Theory
• A Learning Network Using Adaptive Threshold Elements
• A New Algorithm for Generating Prime Implicants
• A Way to Simplify Truth Functions
• An interior point algorithm to solve computationally difficult set covering problems
• Computational experience with an interior point algorithm on the satisfiability problem
• Computing a Trust Region Step
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• scientific article; zbMATH DE number 4164874 (Why is no real title available?)
• scientific article; zbMATH DE number 3902554 (Why is no real title available?)
• scientific article; zbMATH DE number 4197739 (Why is no real title available?)
• scientific article; zbMATH DE number 4197756 (Why is no real title available?)
• MINI: A Heuristic Approach for Logic Minimization
• Predicting Cause-Effect Relationships from Incomplete Discrete Observations
• Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
• The Problem of Simplifying Truth Functions

Cited in

(24)

• Approximation methods in inductive inference
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• On the complexity of approximating a KKT point of quadratic programming
• Trust region affine scaling algorithms for linearly constrained convex and concave programs
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• A complete adaptive algorithm for propositional satisfiability
• Branching rules for satisfiability
• Boolean regression
• An approach to guided learning of Boolean functions
• On the minimum number of logical clauses inferred from examples
• Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
• Learning inductive invariants by sampling from frequency distributions
• Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
• Dynamics of inductive inference in a unified framework
• An approach to inference based on the search for a fixed point
• A continuous approch for globally solving linearly constrained quadratic
• scientific article; zbMATH DE number 67620 (Why is no real title available?)
• An artificial neural network satisfiability tester
• scientific article; zbMATH DE number 1054681 (Why is no real title available?)
• Boolean satisfiability in quantum compilation
• Learning Optimal Decision Sets and Lists with SAT
• Differentiable learning of matricized DNFs and its application to Boolean networks
• Exact Synthesis of ESOP Forms
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Describes a project that uses

Uses Software

• GQTPAR

This page was built for publication: A continuous approach to inductive inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687090)