Results 11 to 20 of about 770 (181)
Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS [PDF]
Journal of Universal Computer Science, 2023 Restricted preemption plays a crucial role in reducing total completion time while controlling preemption overhead. A typical version of restricted preemptive models is k-restricted preemptive scheduling, where preemption is only allowed after a task has
Xiaojuan Liao +4 more
doaj +3 more sources
Boolean satisfiability with transitivity constraints [PDF]
ACM Transactions on Computational Logic, 2000 We consider a variant of the Boolean satisfiability problem where a subset ε of the propositional variables appearing in formula F sat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables, e
Randal E. Bryant, Miroslav N. Velev
openaire +4 more sources
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
An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity. [PDF]
PLoS ONE, 2015 Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes ...
Changki Hong +3 more
doaj +1 more source
Canonical Models and the Complexity of Modal Team Logic [PDF]
Logical Methods in Computer Science, 2019 We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood.
Martin Lück
doaj +1 more source
Oscillator-Inspired Dynamical Systems to Solve Boolean Satisfiability
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits, 2023 Dynamical systems can offer a novel non-Boolean approach to computing. Specifically, the natural minimization of energy in the system is a valuable property for minimizing the objective functions of combinatorial optimization problems, many of which are ...
Mohammad Khairul Bashar +2 more
doaj +1 more source
HAPLOTYPE INFERENCE WITH BOOLEAN SATISFIABILITY [PDF]
International Journal on Artificial Intelligence Tools, 2008 Mutation in DNA is the principal cause for differences among human beings, and Single Nucleotide Polymorphisms (SNPs) are the most common mutations. Hence, a fundamental task is to complete a map of haplotypes (which identify SNPs) in the human population. Associated with this effort, a key computational problem is the inference of haplotype data from
Inês Lynce, João Marques-Silva 0001
openaire +1 more source
Iraqi Journal for Computer Science and Mathematics, 2022 The Boolean Satisfiability Problem (BSAT) is one of the most important decision problems in mathematical logic and computational sciences for determining whether or not a solution to a Boolean formula.. Hopfield neural network (HNN) is one of the major
Hamza Abubakar +2 more
doaj +1 more source
BeBoSy: Behavior Examples Meet Bounded Synthesis
IEEE Access, 2021 Bounded synthesis generates a state machine satisfying given temporal specification in linear temporal logic (LTL) while bounding the number of states of the target solution.
Daniil Chivilikhin +2 more
doaj +1 more source
Compilation-Based Approaches to Parallel Planning: An Empirical Comparison
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 Automated planning deals with finding a sequence of actions, a plan, to reach a goal. One of the possible approaches to automated planning is a compilation of a planning problem to a Boolean satisfiability problem or to a constraint satisfaction problem,
Kristýna Pantůčková, Roman Barták
doaj +1 more source