A continuous approach to inductive inference

DOI10.1007/BF01581082zbMath0783.90122MaRDI QIDQ687090

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

Publication date: 6 January 1994

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

zbMATH Keywords

Riemannian metricRiemannian geometryartificial intelligencesatisfiability probleminductive inferenceBoolean function synthesis problemhidden Boolean functioninterior point mathematical programming

Mathematics Subject Classification ID

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

Related Items

Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach, Branching rules for satisfiability, An approach to guided learning of Boolean functions, On the minimum number of logical clauses inferred from examples, On the complexity of approximating a KKT point of quadratic programming, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Differentiable learning of matricized DNFs and its application to Boolean networks, Exact Synthesis of ESOP Forms, An artificial neural network satisfiability tester, Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT, A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions, A continuous approch for globally solving linearly constrained quadratic, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games, A complete adaptive algorithm for propositional satisfiability, Boolean satisfiability in quantum compilation, Learning Optimal Decision Sets and Lists with SAT

Uses Software

• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience with an interior point algorithm on the satisfiability problem
• An interior point algorithm to solve computationally difficult set covering problems
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• A Way to Simplify Truth Functions
• Computing a Trust Region Step
• Predicting Cause-Effect Relationships from Incomplete Discrete Observations
• MINI: A Heuristic Approach for Logic Minimization
• A Learning Network Using Adaptive Threshold Elements
• A New Algorithm for Generating Prime Implicants
• Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
• A Computing Procedure for Quantification Theory
• The Problem of Simplifying Truth Functions