Filters








15,278 Hits in 5.2 sec

A Probabilistic Approach to Satisfiability of Propositional Logic Formulae [article]

Reazul Hasan Russel
<span title="2019-12-04">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We propose a version of WalkSAT algorithm, named as BetaWalkSAT. This method uses probabilistic reasoning for biasing the starting state of the local search algorithm.  ...  Beta distribution is used to model the belief over boolean values of the literals.  ...  To the best of our knowledge, we did not find a paper that applies the idea of Estimation distribution algorithms for boolean satisfiability of propositional logic, maintaining the explicit probabilistic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1912.02150v1">arXiv:1912.02150v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/giotj63ptrd5vi2rfzojkxsotq">fatcat:giotj63ptrd5vi2rfzojkxsotq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200911053348/https://arxiv.org/pdf/1912.02150v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/40/57/4057d36b9af851f512d5922b4dc84b2bc48dce78.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1912.02150v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

An axiomatization of qualitative probability

Zoran Ognjanovic, Aleksandar Perovic, Miodrag Raskovic
<span title="">2007</span> <i title="IEEE"> 2007 5th International Symposium on Intelligent Systems and Informatics </i> &nbsp;
Here we will present a part of our work on the problem of sound, strongly complete and decidable axiomatization of the notion of qualitative probability.  ...  Qualitative reasoning attracts special attention over the last two decades due to its wide applicability in every-day tasks such as diagnostics, tutoring, real-time monitoring, hazard identification, etc  ...  The standard approach to probabilistic logic [3] , [9] (see also the database [10] ) involves extension of the classical propositional or predicate calculus with the modal-like operators, in our notation  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sisy.2007.4342642">doi:10.1109/sisy.2007.4342642</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uz4tu5g4lza4re7rhppiksoqiu">fatcat:uz4tu5g4lza4re7rhppiksoqiu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121207030430/http://www.uni-obuda.hu:80/journal/Ognjanovic_Perovic_Raskovic_13.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6f/f4/6ff4a8fa1da59c1465ab95563aaac385a888e194.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sisy.2007.4342642"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Solving Graded/Probabilistic Modal Logic via Linear Inequalities (System Description) [chapter]

William Snell, Dirk Pattinson, Florian Widmann
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Due to lack of other implementations, no comparison is provided for probabilistic modal logic, the main new feature of our implementation.  ...  We present the experience gained from implementing a new decision procedure for both graded and probabilistic modal logic.  ...  This allows us to effectively delegate propositional reasoning to binary decision diagrams: every satisfying valuation of (the BDD representing) a tableau sequent Γ corresponds to a leaf of a propositional  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-28717-6_30">doi:10.1007/978-3-642-28717-6_30</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5s5zhx6q5rgxrkl43knbmqhsyi">fatcat:5s5zhx6q5rgxrkl43knbmqhsyi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150701201514/http://www.doc.ic.ac.uk:80/~dirk/Publications/gmlmip2011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/44/af/44af417612c308cd8335e6563c6715f0f77a9971.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-28717-6_30"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Exogenous Probabilistic Computation Tree Logic

Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan, Nikolaos Papanikolaou
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
The proposed logic is a temporal enrichment of Exogenous Probabilistic Propositional Logic (EPPL).  ...  We define a logic EpCTL for reasoning about the evolution of probabilistic systems.  ...  This approach has been used to build the probabilistic state logic EPPL and also a logic EQPL for reasoning about states of quantum information systems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2007.07.007">doi:10.1016/j.entcs.2007.07.007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gwskqgyzovcidawl3yb5mj72pa">fatcat:gwskqgyzovcidawl3yb5mj72pa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190328040219/https://core.ac.uk/download/pdf/82245667.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/cc/87cc7e548ee72fc348c12bcfc07a47a6a6df7755.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2007.07.007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Real-time and Probabilistic Temporal Logics: An Overview [article]

Savas Konur
<span title="2011-04-25">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We extrapolate the notions of decidability, axiomatizability, expressiveness, model checking, etc. for each logic analysed. We also provide a comparison of features of the temporal logics discussed.  ...  Although numerous logics have been introduced for the formal specification of real-time and complex systems, an up to date comprehensive analysis of these logics does not exist in the literature.  ...  There are two main approaches: extending classical logic with probabilistic operators (such as modal logic of knowledge in [27] ); combining probabilistic approach with non-classical logics (probabilistic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1005.3200v3">arXiv:1005.3200v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xhrrcy26bzeehg7wqvjfikm26e">fatcat:xhrrcy26bzeehg7wqvjfikm26e</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1005.3200/1005.3200.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/37/4d/374d52e588e01a9f977121d32863a3f6ac7f77d2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1005.3200v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Relational Probabilistic Conditional Reasoning at Maximum Entropy [chapter]

Matthias Thimm, Gabriele Kern-Isberner, Jens Fisseler
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The formalisms discussed in this paper are relational extensions of a propositional conditional logic based on the principle of maximum entropy.  ...  We also compare our approach to Bayesian logic programs (BLPs) from the field of statistical relational learning which focuses on the combination of probabilistic reasoning and relational knowledge representation  ...  Most of these approaches employ a grounding of relational probabilistic problems to propositional ones in order to benefit from reasoning techniques developed for propositional probabilistic reasoning.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-22152-1_38">doi:10.1007/978-3-642-22152-1_38</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h5gns4u5yjdl5pw74xik3skmiy">fatcat:h5gns4u5yjdl5pw74xik3skmiy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160628045741/http://colonyofmalice.de/pub/2011/Thimm_2011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/51/31515b77a641581bd6f115718b7d21c67cf1ffe9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-22152-1_38"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Probabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum Entropy [chapter]

Rafael Peñaloza, Nico Potyka
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We provide reasoning algorithms for this logic, and show that it satisfies several desirable properties of probabilistic logics.  ...  In order to draw probabilistic conclusions, we employ the principle of maximum entropy.  ...  To facilitate the understanding of our approach, we focus on the DL ALC [27] as a prototypical example of a knowledge representation language, and propositional probabilistic constraints as the framework  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-45856-4_17">doi:10.1007/978-3-319-45856-4_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/edc3boeiazfv7az5vhq4skdno4">fatcat:edc3boeiazfv7az5vhq4skdno4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190223120002/http://pdfs.semanticscholar.org/46e4/67c5ba74e26f857a69141cab04fafbec6527.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/46/e4/46e467c5ba74e26f857a69141cab04fafbec6527.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-45856-4_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Dealing with logical omniscience: Expressiveness and pragmatics

Joseph Y. Halpern, Riccardo Pucella
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/weoplee4x5anpi62cco5v4higa" style="color: black;">Artificial Intelligence</a> </i> &nbsp;
We then consider the pragmatics of dealing with logical omniscience-how to choose an approach and construct an appropriate model.  ...  We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and impossible possible worlds.  ...  To make this precise, define a set Φ of formulas in L K to be propositionally consistent if Φ is a consistent set of formulas of propositional logic when we treat formulas of the form K ϕ as primitive  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2010.04.009">doi:10.1016/j.artint.2010.04.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cbvcg5fclbcgfiu6djckknmjjy">fatcat:cbvcg5fclbcgfiu6djckknmjjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190312101005/https://core.ac.uk/download/pdf/81994475.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/48/f5/48f5ef69536b0216e5a667d1cc90a012bfc26eb5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2010.04.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Probabilistic Logic: Many-valuedness and Intensionality [article]

Zoran Majkic
<span title="2011-03-03">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
about propositional probabilistic logic.  ...  two different 2-valued logics: one for the classical propositional logic at lower-level, and a new one at higher-level for probabilistic constraints with probabilistic variables.  ...  Probabilistic logic and intensionality In order to reason about probabilities of the propositional formulae we need a kind of 2-valued meta-logic with reification features, thus, a kind of intensional  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1103.0676v1">arXiv:1103.0676v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gvnpe2y34zdjbfo5qokzj4ujke">fatcat:gvnpe2y34zdjbfo5qokzj4ujke</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1103.0676/1103.0676.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bb/ce/bbce9193a1c67692504b4bffc1c3529aee103236.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1103.0676v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

The complexity of satisfiability in non-iterated and iterated probabilistic logics

Ioannis Kokkinis
<span title="2018-07-06">2018</span> <i title="Springer Nature America, Inc"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/j2td7x4trvgx7pjoienrccryxq" style="color: black;">Annals of Mathematics and Artificial Intelligence</a> </i> &nbsp;
Let L be some extension of classical propositional logic.  ...  For example in PL we can express a statement like "the probability of truthfulness of A is at 0.3" where A is a formula of L.  ...  This makes our approach more uniform since all of our logics are extension of classical propositional logic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-018-9593-y">doi:10.1007/s10472-018-9593-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/42nxtacfjjhxzafnkbshlmvr2e">fatcat:42nxtacfjjhxzafnkbshlmvr2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831185040/https://arxiv.org/pdf/1712.00810v2.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a2/94/a294893e08638f524f1540dbc8a5ee2af59aabf8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-018-9593-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5 [article]

Tivadar Papai, Henry Kautz, Daniel Stefankovic
<span title="2013-10-23">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Analogous to propositional Markov logic, the knowledge base consists of weighted formulas, whose weights are learned from data.  ...  We propose modal Markov logic as an extension of propositional Markov logic to reason under the principle of maximum entropy for modal logics K45, KD45, and S5.  ...  Heuristics for approximately counting satisfying assignments of propositional formulas exist, and toolboxes are readily available [10] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1310.6439v1">arXiv:1310.6439v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ypcrl3a2pfhqlkzttxjh7o7jiy">fatcat:ypcrl3a2pfhqlkzttxjh7o7jiy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826080430/https://arxiv.org/ftp/arxiv/papers/1310/1310.6439.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/2c/452c9a98e40c72366f8d369d122481bd5fc270e8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1310.6439v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Dealing With Logical Omniscience: Expressiveness and Pragmatics [article]

Joseph Y. Halpern, Riccardo Pucella
<span title="2007-02-01">2007</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We then consider the pragmatics of dealing with logical omniscience-- how to choose an approach and construct an appropriate model.  ...  We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and impossible possible worlds.  ...  To make this precise, let Prop be the axiom ϕ is a valid formula of propositional logic (Prop) and MP be the inference rule From ϕ ⇒ ψ and ϕ infer ψ. Proof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0702011v1">arXiv:cs/0702011v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4wc4rmmwqvdvbhj2mip2fi5zkq">fatcat:4wc4rmmwqvdvbhj2mip2fi5zkq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0702011/cs0702011.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/28/3d/283d5ddf2a3a01e67bdb43323080a14a785f91f9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0702011v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A New Approach to CNF-SAT From a Probabilistic Point of View [article]

Hazem J. Alkhatib
<span title="2021-04-22">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The following paper proposes a new approach to determine whether a logical (CNF) formula is satisfiable or not using probability theory methods.  ...  In our approach, we will follow an enhanced method from a probabilistic point of view that does not always increase exponentially with the number of different literals.  ...  Acknowledgement We wish to give our most deserved gratitude to Raed M. Shaiia and Theophanes E. Raptis for their valuable notes and observations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.11233v1">arXiv:2104.11233v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zejhfq5utbherljcphwayw6yji">fatcat:zejhfq5utbherljcphwayw6yji</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210427042455/https://arxiv.org/pdf/2104.11233v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0c/2c/0c2ca37a4255e08e624d0ea72e0c66be60552888.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.11233v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Generalized probabilistic satisfiability through integer programming

Glauber De Bona, Fabio G. Cozman, Marcelo Finger
<span title="2015-07-15">2015</span> <i title="Springer Nature America, Inc"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vct5ya6gxbcelemee3tlxkwmiu" style="color: black;">Journal of the Brazilian Computer Society</a> </i> &nbsp;
and nested probabilistic formulas.  ...  This paper studies the generalized probabilistic satisfiability (GPSAT) problem, where the probabilistic satisfiability (PSAT) problem is extended by allowing Boolean combinations of probabilistic assertions  ...  If each probabilistic atom of a formula φ is replaced by a new atomic proposition B i , then we have a formula θ from classical propositional logic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s13173-015-0028-x">doi:10.1186/s13173-015-0028-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mg2u5a5fzjccjnml7755oypgnm">fatcat:mg2u5a5fzjccjnml7755oypgnm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150907021005/http://www.journal-bcs.com/content/pdf/s13173-015-0028-x.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/46/47/4647fe5dd2bbb0afcc4488653e655865dce5686a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s13173-015-0028-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

Dealing with logical omniscience

Joseph Y. Halpern, Riccardo Pucella
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wi3otyijsnbgnhvy6gfwdffoiu" style="color: black;">Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge - TARK &#39;07</a> </i> &nbsp;
In particular, adding probabilities to the language allows for finer distinctions between different approaches.  ...  We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and impossible possible worlds.  ...  We give semantics to these formulas using Kripke structures. For simplicity, we focus on approaches that satisfy the K45 axioms (as well as KD45 and S5).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1324249.1324273">doi:10.1145/1324249.1324273</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/tark/HalpernP07.html">dblp:conf/tark/HalpernP07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/aa42ojvufjax7c4phtjky6xjja">fatcat:aa42ojvufjax7c4phtjky6xjja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809143045/https://tark.org/proceedings/tark_jun25_07/p169-halpern.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3e/f4/3ef4365b59481dd34039beebbbf5b2c83229da00.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1324249.1324273"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 15,278 results