Neural model guides PBE problem solving in programming.
problem Synthesizing programs from example inputs/outputs.
method Uses a neural model to guide miniKanren's constraint logic programming system.
result Synthesizes programs faster and generalizes to larger problems.
Paper introduces a new framework combining deep learning and logic for relational data.
problem Scalability and flexibility of deep learning methods for relational data.
method Combines auto-encoding principle with first-order logic and logic programs.
result Latent representations are more accurate, flexible, and interpretable.
Machine learning refactors knowledge to improve learning efficiency.
problem Inductive program synthesis efficiency through knowledge restructuring.
method Introduces Knorf, a system that refactors knowledge bases using constraint optimization.
result Learning from refactored knowledge improves predictive accuracy fourfold and reduces learning time by half.
NLM combines neural networks and logic programming for complex reasoning.
problem Complex reasoning tasks involving logic and properties.
method Neural-symbolic architecture combining neural networks and logic programming.
result NLM achieves perfect generalization on various tasks.
Optimizes train schedules and maintenance using CP and QA.
problem Optimizing train schedules and maintenance considering constraints.
method Used Constraint Programming and Quantum Annealing to model and solve the problem.
result Both CP and QA approaches produce comparable results on real quantum computers.
We present a heuristic based algorithm to induce \textit{nonmonotonic} logic programs that will explain the behavior of XGBoost trained classifiers. We use the technique based on the LIME approach to locally select the most important features contributing to the classification decision. Then, in order to explain the mo…
The field of statistical relational learning aims at unifying logic and probability to reason and learn from data. Perhaps the most successful paradigm in the field is probabilistic logic programming: the enabling of stochastic primitives in logic programming, which is now increasingly seen to provide a declarative bac…
Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.
problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.
Develops logic programs for explaining classification model decisions.
problem Creating explanations for decisions made by classification models.
method Answer-set programs for computing counterfactual interventions.
result Maximum responsibility causal explanations can be computed.
This paper solves steady-state planning for multichain MDPs.
problem Specifying constraints on the steady-state behavior of an agent.
method Linear programming solution for multichain MDPs.
result Optimal solutions yield stationary policies with rigorous guarantees.
Logical scaffolds enhance AI software quality.
problem Improving AI component quality in software.
method Logical scaffolds as a method to improve AI components.
result Logical scaffolds can improve AI beyond perception systems.
This article presents the use of Answer Set Programming (ASP) to mine sequential patterns. ASP is a high-level declarative logic programming paradigm for high level encoding combinatorial and optimization problem solving as well as knowledge representation and reasoning. Thus, ASP is a good candidate for implementing p…
Unified model learns concepts across domains like left and right.
problem Limited generalization of language concepts in inference-only models.
method Logic-Enhanced Foundation Model (LEFT) with a differentiable, domain-independent program executor.
result LEFT flexibly learns and reasons with concepts across 2D images, 3D scenes, human motions, and robotic manipulation.
CLN2INV learns precise loop invariants from program traces.
problem Automated verification of real-world programs with complex loops.
method Continuous Logic Network (CLN) for learning precise loop invariants from program execution traces.
result CLN2INV significantly outperforms existing approaches on the Code2Inv dataset.
Our interest in this paper is in the construction of symbolic explanations for predictions made by a deep neural network. We will focus attention on deep relational machines (DRMs, first proposed by H. Lodhi). A DRM is a deep network in which the input layer consists of Boolean-valued functions (features) that are defi…
Algorithm extracts non-monotonic rules from statistical models using HUIM.
problem Extracting non-monotonic rules from statistical learning models.
method Reduces problem to HUIM, uses TreeExplainer for feature importance.
result Significant improvement in classification metrics and training time.
Safe reinforcement learning with logical constraints for optimal policy synthesis.
problem Ensuring safety during reinforcement learning while maximizing goal satisfaction.
method Adaptive safe padding that synthesizes optimal control policies satisfying temporal logic formulas.
result The proposed method handles the trade-off between exploration and safety with theoretical guarantees.
A user-friendly interface constructs effective background knowledge from ER diagrams.
problem Inefficient construction of background knowledge by domain experts in ILP systems.
method Design of a graphical user interface to interact with Entity Relationship diagrams to construct modes for a probabilistic logic learning system.
result Domain experts can construct effective background knowledge on par with experts using the graphical interface.
SPPL simplifies probabilistic programming for exact inference.
problem Efficient exact inference in probabilistic models.
method SPPL translates probabilistic programs into sum-product expressions, leveraging new techniques for scalability.
result SPPL achieves up to 3500x speedups in exact inference.
Paper proposes a novel RRL framework that learns from images and incorporates expert knowledge.
problem Lack of effective methods to incorporate expert background knowledge and learn from non-relational data in RRL.
method Differentiable Inductive Logic Programming (ILP) for learning relational information from images and incorporating expert knowledge.
result Efficacy demonstrated on various environments and datasets, showing improved learning and generalization.
Unified approach tackles logical constraints in mixed-integer optimization.
problem Logical constraints in mixed-integer optimization problems.
method Express logical constraints non-linearly, reformulate as convex binary optimization, solve using outer-approximation.
result Solves problems faster and at larger scale than existing methods.
DILP improves fraud detection explainability without significant performance boost.
problem Improving fraud detection explainability in machine learning.
method Differentiable Inductive Logic Programming (DILP) for fraud detection with data curation.
result DILP provides comparable results to traditional methods but lacks significant advantage.
New method uses logical relations to derive bounds and inequality constraints from causal models.
problem Recovering bounds and inequality constraints from unobserved confounding.
method Using rules of probability and restrictions on counterfactuals implied by causal graphical models.
result Powerful method to recover known and novel bounds and constraints.
Study uses DRL with Lagrangian relaxation to solve temporal control tasks with STL constraints.
problem Optimal control problems with temporal logic constraints.
method Extended CMDP formulation, Lagrangian relaxation, two-phase constrained DRL algorithm.
result Demonstrated learning performance of the proposed algorithm through simulations.
Introduces LTQL for factored policies in cooperative MARL.
problem Learning optimal joint policies in collaborative MARL scenarios.
method Logical Team Q-learning (LTQL) as a stochastic approximation to dynamic programming.
result LTQL provides factored policies for optimal joint behavior in cooperative MARL.
New method for MAP inference using Benders' decomposition.
problem Finite-time convergence guarantee for MAP inference.
method Sequentially adding constraints using Benders' decomposition.
result Higher optimal posterior value compared to other methods.
Intermediate logic of all convex polyhedra is axiomatized.
problem Defining and axiomatizing intermediate logic for convex polyhedra.
method Using Jankov-Fine formulas, classical polyhedral geometry, and p-morphic images to establish completeness.
result A finite axiomatisation of PL for all convex polyhedra.
A new method streamlines digital payment programming using smart contracts.
problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.
Deep neural networks have achieved impressive supervised classification performance in many tasks including image recognition, speech recognition, and sequence to sequence learning. However, this success has not been translated to applications like question answering that may involve complex arithmetic and logic reason…
Following a review of metric, ultrametric and generalized ultrametric, we review their application in data analysis. We show how they allow us to explore both geometry and topology of information, starting with measured data. Some themes are then developed based on the use of metric, ultrametric and generalized ultrame…
We propose an efficient method to estimate the accuracy of classifiers using only unlabeled data. We consider a setting with multiple classification problems where the target classes may be tied together through logical constraints. For example, a set of classes may be mutually exclusive, meaning that a data instance c…
Proposes a method to generate text that adheres to logical constraints.
problem Generating text that respects logical constraints is hard for autoregressive models.
method Bayesian conditioning to draw samples subject to a constraint, considering the entire sequence and inducing a local, factorized distribution.
result Our approach generates samples that closely approximate the target distribution and are guaranteed to satisfy the constraints.
Tensor logic aims to unify AI types with scalable and transparent features.
problem Lack of a unified AI programming language with scalability and transparency.
method Introduces tensor logic, a new AI language based on tensor equations.
result Tensor logic enables key AI forms like transformers, formal reasoning, and graphical models.
SATNet integrates logical reasoning into deep learning with a differentiable MAXSAT solver.
problem Integrating logical reasoning into deep learning architectures.
method Differentiable MAXSAT solver based on fast coordinate descent for SDP.
result Minimally supervised learning of logical structures in deep learning systems.
Alpha2 discovers logical formulaic alphas using deep reinforcement learning.
problem Discovering interpretable formulaic alphas for better trading strategies.
method Formulating alpha discovery as program construction, using deep reinforcement learning to navigate the search space.
result Empirical experiments show Alpha2 identifies diverse, logical, and effective alphas improving trading strategy performance.
Method trains policies for MDPs that satisfy LTL properties.
problem Training policies for MDPs that meet complex temporal logic constraints.
method Convert LTL to automaton, construct synchronised MDP, adapt reward function, apply neural Q-iteration.
result Synthesised policies satisfy specified LTL properties.
Money is a technology for promoting economic prosperity. Over history money has become increasingly abstract, it used to be hardware, gold coins and the like, now it is mostly software, data structures located in banks. Here I propose the logical conclusion of the abstraction of money: to use as money the most general …
Paper tackles zero-shot learning for semantic image interpretation.
problem Extracting structured semantic descriptions from images requires complete training sets, which are often unavailable.
method Uses Logic Tensor Networks to leverage logical constraints and similarities among relationships in the training set.
result Background knowledge can alleviate the incompleteness of training sets, improving zero-shot learning performance.
LYRICS integrates deep learning and logic inference for complex decision-making.
problem Combining deep learning with symbolic logic for intelligent decision-making.
method LYRICS provides a generic interface layer that integrates TF models with FOL knowledge, converting constraints into optimization problems.
result LYRICS enables learning under logical constraints, improving model performance and decision-making.
SGE learns symbolic node representations from relational data.
problem Mining insights from complex, real-world systems.
method SGE uses frequent pattern mining on a node's neighborhood to learn symbolic node representations.
result SGE outperforms shallow node embedding methods on a venue classification task.
The paper uses temporal logic to guide safe reinforcement learning for complex tasks.
problem Learning safe control policies for complex, long-horizon tasks in physical systems.
method Combines temporal logic, control barrier functions, and control Lyapunov functions to facilitate safe exploration and learning.
result Developed a flexible system that allows users to specify task objectives and constraints in various forms and levels.
Global optimization approach for MAP clustering under Gaussian mixtures.
problem Maximum a-posteriori clustering problem under Gaussian mixture model.
method Mixed-integer nonlinear optimization (MINLP) transformed into mixed-integer quadratic program (MIQP).
result Explicit quantification of optimality gap, leading to globally optimal solutions.
HyperFair integrates fairness in recommender systems using probabilistic soft logic.
problem Ensuring fairness in recommender systems across diverse domains.
method Soft fairness constraints integrated as regularization in a joint inference objective function.
result HyperFair improves fairness of predictions from black-box models and hybrid systems.
CANs improve GANs by enforcing structured constraints during training.
problem Generating valid structured objects like molecules and game maps from examples alone.
method Constrained Adversarial Networks (CANs) embed constraints into the model during training, penalizing invalid structures.
result CANs efficiently generate high-quality and novel valid structures.
New method combines gradient optimization with constraint-based techniques for causal discovery.
problem Causal discovery from observational data, especially with small sample sizes.
method Differentiable d-separation scores using percolation theory and soft logic for gradient-based optimization of conditional independence constraints. result Empirical evaluations show robust performance in low-sample regimes, surpassing traditional methods.
We propose Trusted Neural Network (TNN) models, which are deep neural network models that satisfy safety constraints critical to the application domain. We investigate different mechanisms for incorporating rule-based knowledge in the form of first-order logic constraints into a TNN model, where rules that encode safet…
CLUTRR benchmarks NLU systems' ability to infer logical rules from text.
problem NLU models' failure to generalize systematically and robustly.
method CLUTRR suite requires inference of kinship relations from short stories, evaluating generalization and robustness.
result Graph-based models outperform state-of-the-art NLU models in generalization and robustness.
In the last few years the systematic adoption of deep learning to visual generation has produced impressive results that, amongst others, definitely benefit from the massive exploration of convolutional architectures. In this paper, we propose a general approach to visual generation that combines learning capabilities …