Computational aspects of satisfiability in probability logic

DOI10.1002/MALQ.201300015MaRDI QIDQ6828546zbMATH OpenFDO

Authors Rutger Kuyper

Publication date 5 December 2014

Published in Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/2066/135267

zbMATH Keywords

0-logic\(\varepsilon\)-logiccomplexity of satisfiabilitydecidability

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Paraconsistent logics (03B53) Complexity of computation (including implicit computational complexity) (03D15)

This page was built for publication: Computational aspects of satisfiability in probability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828546)