Computational aspects of satisfiability in probability logic

Mathematical Logic Quarterly 60 (6):444-470 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.201300015

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

DPLL: The Core of Modern Satisfiability Solvers.Bart Selman, Ashish Sabharwal & Donald Loveland - 2016 - In Alberto Policriti & Eugenio Omodeo (eds.), Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Cham, Switzerland: Springer Verlag.
Spectra and satisfiability for logics with successor and a unary function.Arthur Milchior - 2018 - Mathematical Logic Quarterly 64 (4-5):286-311.
Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.
Algebraic Characterizations of the Satisfiability of First‐Order Logical Formulas and the Halting of Programs.Jean‐Pierre Bénéjam - 1976 - Mathematical Logic Quarterly 23 (7‐12):111-120.
Computability of validity and satisfiability in probability logics over finite and countable models.Greg Yang - 2015 - Journal of Applied Non-Classical Logics 25 (4):324-372.
Review: Temporal Logic: Mathematical Foundations and Computational Aspects D. M. Gabbay, Antony Galton: Temporal Logic: Mathematical Foundations and Computational Aspects. [REVIEW][author unknown] - 1997 - Logic Journal of the IGPL 5 (6):853-857.
Algebra and Probability in Many-Valued Reasoning.Ioana Leuştean & Vincenzo Marra - 2010 - Studia Logica 94 (2):147-150.
Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
On Generalization of the Satisfiability Definition and Proof Rules With Remarks to my Paper: On Theses of the First‐Order Functional Calculus.Juliusz Reichbach - 1962 - Mathematical Logic Quarterly 8 (3‐4):267-276.
On Generalization of the Satisfiability Definition and Proof Rules With Remarks to my Paper: On Theses of the First‐Order Functional Calculus.Juliusz Reichbach - 1962 - Mathematical Logic Quarterly 8 (3-4):267-276.

Analytics

Added to PP
2014-11-07

Downloads
2 (#1,819,493)

6 months
15 (#185,276)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Robust logics.Leslie G. Valiant - 2000 - Artificial Intelligence 117 (2):231-253.
Probability logic.Douglas N. Hoover - 1978 - Annals of Mathematical Logic 14 (3):287.

Add more references