Generalized probabilistic satisfiability

DOI10.1016/j.entcs.2017.04.004zbMath1401.68113OpenAlexW2642916709WikidataQ113317597 ScholiaQ113317597MaRDI QIDQ1744442

Carlos Caleiro, Andreia Mordido, Filipe Casal

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2017.04.004

zbMATH Keywords

phase transitionmixed integer programmingprobabilistic satisfiabilityGenPSAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Stochastic programming (90C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities ⋮ Probabilistic logic over equations and domain restrictions ⋮ Probabilistic sentence satisfiability: an approach to PSAT ⋮ GenPSAT

Uses Software

• Gurobi

Cites Work

• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• Probabilistic logic
• Probabilistic satisfiability
• A logic for reasoning about probabilities
• Probabilistic Satisfiability and Coherence Checking through Integer Programming
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized probabilistic satisfiability