Semiring reasoning frameworks in AI and their computational complexity

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Semirings (16Y60) General topics in artificial intelligence (68T01)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Containment of conjunctive queries on annotated relations
Computing functions with parallel queries to NP
Relations among MOD-classes
NP is as easy as detecting unique solutions
The complexity of optimization problems
Datalog extensions for database queries and updates
Gap-definable counting classes
Is intractability of nonmonotonic reasoning a real drawback?
Counting problems over the reals
Constraint satisfaction problems: Algorithms and applications
Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
Computing with first-order logic
Semiring programming: a semantic framework for generalized sum product problems
A structured view on weighted counting with relations to counting, quantum computation and applications
Neural probabilistic logic programming in DeepProbLog
Weighted automata and weighted logics
Semiring induced valuation algebras: exact and approximate local computation algorithms
Algebraic model counting
Weighted First-Order Logics over Semirings
Polynomial Space Counting Problems
Semiring-Induced Propositional Logic: Definition and Basic Algorithms
A Tutorial on Learning with Bayesian Networks
An Introduction to Bayesian Networks and Their Contemporary Applications
Probabilistic reasoning with answer sets
The Complexity of Enumeration and Reliability Problems
Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
Computational Complexity of Probabilistic Turing Machines
Learning to reason
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
An Algebraic Model for Combinatorial Problems
Efficient Knowledge Compilation Beyond Weighted Model Counting
Sum-of-Products with Default Values: Algorithms and Complexity Results
ASP (): Answer Set Programming with Algebraic Constraints
Counting classes: Thresholds, parity, mods, and fewness
On the complexity of $k$-SAT

This page was built for publication: Semiring reasoning frameworks in AI and their computational complexity