Probabilistic Satisfiability and Coherence Checking through Integer Programming
From MaRDI portal
Publication:5326414
DOI10.1007/978-3-642-39091-3_13zbMath1390.68591OpenAlexW131918717MaRDI QIDQ5326414
Fabio Gagliardi Cozman, Lucas Fargoni di Ianni
Publication date: 5 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39091-3_13
Integer programming (90C10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
Inconsistency-tolerant reasoning over linear probabilistic knowledge bases ⋮ Syntactic reasoning with conditional probabilities in deductive argumentation ⋮ A further step for efficient corrections of inconsistent probabilistic data sets ⋮ Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities ⋮ Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation ⋮ Generalized probabilistic satisfiability ⋮ Towards classifying propositional probabilistic logics ⋮ A Propositional CONEstrip Algorithm
This page was built for publication: Probabilistic Satisfiability and Coherence Checking through Integer Programming
