Semiring programming: a semantic framework for generalized sum product problems
From MaRDI portal
Publication:2206471
Abstract: To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming. Although it is widely accepted that solving real-world problems requires an integration amongst these, contemporary representation methodologies offer little support for this. In an attempt to alleviate this situation, we introduce a new declarative programming framework that provides abstractions of well-known problems such as SAT, Bayesian inference, generative models, and convex optimization. The semantics of programs is defined in terms of first-order structures with semiring labels, which allows us to freely combine and integrate problems from different AI disciplines.
Recommendations
- Semiring-induced propositional logic: definition and basic algorithms
- A new representation and associated algorithms for generalized planning
- Unifying logical and statistical AI
- Sampling-based SAT/ASP multi-model optimization as a framework for probabilistic inference
- A language-independent framework for reasoning about preferences for declarative problem solving
Cites work
- Algebraic model counting
- An algebra of modular systems: static and dynamic perspectives
- An analysis of first-order logics of probability
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs
- Combining relational algebra, SQL, constraint modelling, and local search
- Constraint and integer programming in OPL
- Essence: A constraint language for specifying combinatorial problems
- Graph implementations for nonsmooth convex programs
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3637601 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- scientific article; zbMATH DE number 2238781 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
- In pursuit of the Holy Grail
- Inductive Logic Programming: Theory and methods
- kProbLog: an algebraic Prolog for machine learning
- Learning explanatory rules from noisy data
- Logic Programming and Nonmonotonic Reasoning
- Markov logic networks
- Mini-buckets: a general scheme for bounded inference
- Mixed logical-linear programming
- Nonlinear optimization applications using the GAMS technology
- On probabilistic inference by weighted model counting
- On SAT Modulo Theories and Optimization Problems
- On the Complexity of Computing the Volume of a Polyhedron
- Optimization modulo theories with linear rational costs
- Path problems in networks
- Probabilistic graphical models.
- Probabilistic reasoning with answer sets
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Semirings for constraint solving and programming.
- Solving \#SAT and Bayesian inference with backtracking search
- The design of the zinc modelling language
Cited in
(7)- Weighted model counting without parameter variables
- Special issue on probabilistic logic programming (PLP 2018)
- Lifted Reasoning for Combinatorial Counting
- Semiring reasoning frameworks in AI and their computational complexity
- Aspmc: new frontiers of algebraic answer set counting
- Semirings for probabilistic and neuro-symbolic logic programming
- Polymorphic dynamic programming by algebraic shortcut fusion
This page was built for publication: Semiring programming: a semantic framework for generalized sum product problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206471)
