Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]
Logical Methods in Computer ScienceWe introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete.
Stephane Demri, Karin Quaas
doaj +1 more source
The Complexity of Prenex Separation Logic with One Selector
, 2018 We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\geq1$ selector fields ($\seplogk{k}$).
Echenim, Mnacho +2 more
core
Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems
MathematicsSolving satisfiability problems is central to many areas of computer science, including artificial intelligence and optimization. Efficiently solving satisfiability problems requires exploring vast search spaces, where search space partitioning plays a ...
Yuexin Huang, Qinzhou Niu, Yanfang Song
doaj +1 more source
On Relation between Constraint Answer Set Programming and Satisfiability Modulo Theories
, 2016 Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories.
Lierler, Yuliya, Susman, Benjamin
core
Satisfiability of XPath Expressions [PDF]
, 2004 In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0 expressions, i.e., whether there is an XML document for which their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem.
openaire +2 more sources
Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation. [PDF]
PLoS One, 2023 Ali GA +5 more
europepmc +1 more source
Augmenting an electronic Ising machine to effectively solve boolean satisfiability. [PDF]
Sci Rep, 2023 Sharma A, Burns M, Hahn A, Huang M.
europepmc +1 more source
Satisfiability in composition-nominative logics
Open Computer Science, 2012 Nikitchenko Mykola, Tymofieiev Valentyn
doaj +1 more source
Enhancing Security of Web-Based IoT Services via XSS Vulnerability Detection. [PDF]
Sensors (Basel), 2023 Kim J, Park J.
europepmc +1 more source
Tautological formal explanations: does prior knowledge affect their satisfiability? [PDF]
Front Psychol, 2023 Aslanov I, Guerra E.
europepmc +1 more source