Results 61 to 70 of about 44,054 (190)
On Sub-Propositional Fragments of Modal Logic [PDF]
, 2018 In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the so-called core ...
Bresolin, Davide +2 more
core +3 more sources
A Contextual Accuracy Dominance Argument for Probabilism
Philosophy and Phenomenological Research, EarlyView.ABSTRACT A central motivation for Probabilism—the principle of rationality that requires one to have credences that satisfy the axioms of probability—is the accuracy dominance argument: one should not have accuracy dominated credences, and one avoids accuracy dominance just in case one satisfies Probabilism.
Mikayla Kelley
wiley +1 more source
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 The restricted Maximum k-Satisfiability MAX- kSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization
Mohd Shareduwan Bin Mohd Kasihmuddin +2 more
doaj +1 more source
Timed Context-Free Temporal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-free ...
Laura Bozzelli +2 more
doaj +1 more source
Does Treewidth Help in Modal Satisfiability?
, 2010 Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig +24 more
core +1 more source
The Southern Journal of Philosophy, EarlyView.Abstract This article reinterprets Levinas's account of ethical subjectivity by centering the temporality of the pas encore (“not yet”) and drawing on new materials in Œuvres complètes. I argue that, in Totality and Infinity, eros and ethics are internally continuous: eros generates a responsible not yet of time, secured by fecundity and oriented to ...
Huaiyuan Zhang
wiley +1 more source
Classical and quantum satisfiability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present the linear algebraic definition of QSAT and propose a direct logical characterization of such a definition. We then prove that this logical version of QSAT is not an extension of classical satisfiability problem (SAT).
Anderson de Araújo, Marcelo Finger
doaj +1 more source
Theoria, EarlyView.Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley +1 more source
Counting workflow satisfiability with exclusion constraints based on backtracking tree-decomposition
Dianxin kexue, 2016 Workflow satisfiability（WS）concerns the issue of resource allocation under some access control policies. Counting all its solutions is advantaged to verify the robustness of a workflow to resource exceptions.
Zhinian ZHAI +5 more
doaj +2 more sources
Research of Hamming weight-based algebraic side-channel attack on LED
Tongxin xuebao, 2013 :The security of LED against the algebraic side-channel attack (ASCA)was evaluated, which is a lightweight block cipher proposed in CHES 2011.Firstly, the attack model of ASCA was analyzed, and then the design and algebraic representations of LED were ...
Ke-ke JI +4 more
doaj