Results 71 to 80 of about 18,245 (221)

Satisfiability in MultiValued Circuits [PDF]

open access: yesSIAM Journal on Computing, 2018
The satisfiability of Boolean circuits is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside the Boolean realm and consider circuits built of any fixed set of gates on an arbitrarily large finite domain.
Pawel M. Idziak, Jacek Krzaczkowski
openaire   +5 more sources

“The future of death in the present of love”: Eros as an ethical pas encore in Levinas's Totality and Infinity

open access: yesThe 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

Symbolic computation and satisfiability checking [PDF]

open access: yes, 2020
The two communities of Symbolic Computation and Satisfiability Checking have recently found themselves tackling similar problems and having a growing interest in each other's technology.
Tinelli, Cesare   +15 more
core   +1 more source

The I in logic

open access: yesTheoria, 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

Effectively Solving NP-SPEC Encodings by Translation to ASP [PDF]

open access: yes, 2015
NP-SPEC is a language for specifying problems in NP in a declarative way. Despite the fact that the semantics of the language was given by referring to Datalog with circumscription, which is very close to ASP, so far the only existing implementations are
Alviano, Mario, Faber, Wolfgang
core   +1 more source

Logic programming with satisfiability [PDF]

open access: yesTheory and Practice of Logic Programming, 2008
Abstract This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other.
Michael Codish   +2 more
openaire   +4 more sources

Revenge Russell‐Myhill and the Ramified Hierarchy

open access: yesTheoria, EarlyView.
ABSTRACT The Russell‐Myhill paradox targeting the structuralist view of proposition in classical higher‐order logic is blocked by implementing restrictions associated with an ordinary account of predicativity. However, it has been shown that these restrictions are not safe: “revenge” versions of the paradox show the inconsistency of the structuralist ...
Jacopo Berneri
wiley   +1 more source

Research of Hamming weight-based algebraic side-channel attack on LED

open access: yesTongxin 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  

Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network

open access: yesInternational 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

Model-Checking Problems as a Basis for Parameterized Intractability [PDF]

open access: yesLogical Methods in Computer Science, 2005
Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj   +1 more source

Home - About - Disclaimer - Privacy