Results 41 to 50 of about 1,182 (134)
Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
IEEE Access, 2020 Solving the satisfiability problems of Boolean polynomial equations is still an open challenge in the fields of mathematics and computer science.
Guangfu Wu +5 more
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
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features [PDF]
Logical Methods in Computer ScienceWe investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC.
Bartosz Bednarczyk
doaj +1 more source
Journal of Graph Theory, Volume 112, Issue 3, Page 198-208, July 2026.ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley +1 more source
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder [PDF]
Logical Methods in Computer ScienceTemporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace ...
Marie Fortin +3 more
doaj +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
Quantum programming of the satisfiability problem with Rydberg atom graphs
Physical Review Research, 2023 Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the
Seokho Jeong +4 more
doaj +1 more source
(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English
Theoria, Volume 92, Issue 3, June 2026.ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley +1 more source
Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Scientific Reports, 2018 Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe +2 more
doaj +1 more source